Alexander’s Library

The search for the elixir of youth — what the record says, and how strongly. Double-click any word for an instant dictionary or scientific synopsis.

Library

Formal Sciences, Mathematics & Computing

Pure and applied mathematics, logic, statistics, theoretical computer science, artificial intelligence, and systems architecture.

32 sources ↓Last researched 2026-10-16

State of the Field: Formal Sciences, Mathematics & Computing

Pure and applied mathematics, logic, statistics, theoretical computer science, artificial intelligence, and systems architecture. Grounded synthesis across 32 primary sources and 8 graded findings within The Tree of Knowledge.

Synopsis · Executive Overview

Formal Sciences, Mathematics & Computing is a core discipline addressing pure and applied mathematics, logic, statistics, theoretical computer science, artificial intelligence, and systems architecture. Spanning published milestones from 2019 to 2026, the indexed record comprises 2 primary sources and 2 graded findings across systematic reviews, clinical cohorts, and translational studies.

Section I · Primary Literature & Evidence Synthesis

What the Peer-Reviewed Record Establishes

The primary research record in Formal Sciences, Mathematics & Computing is stratified by study design so that meta-analyses and replicated randomised controlled trials (T1–T2) carry greater epistemic weight than observational cohorts (T3–T4) or preclinical laboratory work (T5). Leading graded findings establish the core empirical baseline: [T1] Axiomatic mathematical structures provide an invariant, rigorous formal language that models physical dynamics and economic equilibrium across diverse multi-scale phenomena. [28][29] [T2] The absence of dynamic arbitrage (No Free Lunch with Vanishing Risk) in continuous financial markets is mathematically equivalent to the existence of an equivalent local martingale measure. [27]

Further clinical and mechanistic stratification across the literature demonstrates: [T3] Algorithmic decision problems in multi-agent competitive market equilibria (such as computing mixed Nash equilibria) are PPAD-complete, rendering general equilibrium clearing polynomial-time intractable in worst-case instances. [31][32] [T3] The investigators' previous research identified two distinct subtypes of Cognitive Flexibility (CF), termed CF1 (shifting flexibility) and CF2 (strategy flexibility). [1]

Section II · Mechanisms, Interventions & Subgroup Calibration

Comparative Evaluation of Levers & Theoretical Models

When evaluated as a quantitative decision and mechanism ledger, the best-supported interventions and frameworks in Formal Sciences, Mathematics & Computing are: Axiomatic Formalism & Model Theory (Supported — Guarantees formal consistency and provides coordinate-free representation across geometry, physics, and economics; landmark evidence: Hilbert's Program, Bourbaki Elements of Mathematics, and Gödel's Incompleteness Theorems: Essential for eliminating hidden intuitive assumptions and enabling interactive machine-verified mathematics.); Differential Geometry & Gauge Principles (Supported — Translates gravitational and fundamental force dynamics into coordinate-invariant tensor calculus and bundle curvature; landmark evidence: Einstein's General Relativity (1915) and Yang-Mills Gauge Theory (1954): Forms the core geometric architecture of modern high-energy physics and general relativistic astrophysics.); Measure-Theoretic Probability & Martingale Analysis (Guideline — Enables dynamic replication, no-arbitrage valuation, and Girsanov measure change in quantitative finance and diffusion physics; landmark evidence: Kolmogorov (1933), Itô (1944), Harrison & Kreps (1979), Delbaen & Schachermayer (1994): The mathematical bedrock of derivative pricing, risk management, and non-equilibrium statistical mechanics.).

Within the Tree of Knowledge, this field branches into 3 specialised sub-disciplines: Logic, Computation, Information & Artificial Intelligence (Mathematical logic, Gödel incompleteness, Turing computability, complexity theory, cryptography, statistical machine learning, and autonomous reasoning systems); Probability Theory, Stochastic Calculus, Martingales & Mathematical Statistics (Kolmogorov measure-theoretic probability, Brownian motion, Itô stochastic calculus, Doob martingales, Girsanov's theorem, Feynman–Kac PDE duality, Extreme Value Theory, Bayesian inference, and Random Matrix Theory); Pure & Applied Mathematics, Geometry & Topology (Number theory, algebra, real and complex analysis, differential geometry, algebraic topology, dynamical systems, and partial differential equations).

Section III · Historical Trajectory & Contested Frontiers

Evolution of the Field, Open Debates & Active Trials

Chronologically, the field evolved through key inflection points: in 1931, Gödel Publishes Incompleteness Theorems (Kurt Gödel proves that any consistent axiomatic system containing basic arithmetic contains true statements that cannot be proven within the system, bounding mathematical formalism); in 1936, Alan Turing Formalizes Universal Computation (Turing introduces the universal computing machine, defining algorithmic computability and resolving Hilbert's Entscheidungsproblem in the negative via the Halting Problem); in 1944, Theory of Games and Economic Behavior Published (John von Neumann and Oskar Morgenstern publish their landmark treatise creating game theory, strategic equilibria, and axiomatic expected utility theory); in 1948, Claude Shannon Founds Mathematical Information Theory (Shannon publishes 'A Mathematical Theory of Communication', defining statistical entropy, channel capacity, and establishing the mathematical limits of digital transmission).

Active scientific debates and unresolved methodological tensions centre on: Constructive vs. Classical Platonist Foundations in Physics and Economics: Disagreement over whether physical laws and market mechanisms must be strictly computable via constructive mathematics (Brouwer, Bishop) or can rely on non-constructive existential axioms (Zorn's Lemma, Axiom of Choice). (debated) Continuous Manifolds vs. Discrete Computational Universe: The debate over whether spacetime and physical fields are fundamentally continuous smooth geometries or emergent approximations of discrete computational cellular automata and quantum spin networks. (contested)

Active research groups, trials, and regulatory benchmarks tracked in this space include Renaissance Technologies (Medallion Fund) (United States) — Pioneering quantitative investment management firm founded by mathematician Jim Simons, operationalizing statistical physics, stochastic calculus, and signal processing; Institut des Hautes Études Scientifiques (IHES) (France) — Premier mathematical institute known for Alexander Grothendieck's modern algebraic geometry and foundational contributions to quantum field theory and string theory; Institute for Advanced Study (IAS Princeton) (United States) — World-renowned theoretical research institute where Einstein, Gödel, von Neumann, and Dirac developed foundational theories of physics, mathematics, and computing; Santa Fe Institute (United States) — Pioneering research institute dedicated to the multidisciplinary study of complex adaptive systems, non-equilibrium economics, and quantitative scaling laws.

Section IV · Evidentiary Gaps & Research Frontiers

Open Questions & Priorities for the Next Research Sweep

Methodological priorities and open empirical questions queued for the next research sweep across Formal Sciences, Mathematics & Computing focus on resolving subgroup effect sizes, causal mechanisms, and long-term outcomes:

  • Bridging the continuous mathematics of quantum field theories and spacetime manifolds with discrete, finite computational representations (discrete quantum gravity and lattice gauge theories)
  • Algorithmic tractability of non-convex general equilibrium market clearing and high-dimensional multi-agent game-theoretic equilibria (PPAD-completeness of Nash equilibria)
  • Constructive formalization of path integrals in non-perturbative quantum field theory within rigorous measure-theoretic functional analysis
  • Provable generalization bounds and sample complexity for overparameterized neural networks operating in low signal-to-noise regime financial time series
  • Large-scale multicentre randomised controlled trials with standardised live-birth and long-term offspring follow-up in Formal Sciences, Mathematics & Computing.
  • Age- and subgroup-stratified biomarker validation across diverse human populations.

Evidence Hierarchy (Graded Claims)

  • T1Synthesis of trials
    1 (13%)
  • T2Randomised trial
    1 (13%)
  • T3Observational, large
    3 (38%)
  • T4Observational, small or case-based
    1 (13%)
  • T5Preclinical or mechanistic
    1 (13%)
  • T6Opinion, news or unverified
    1 (13%)
7 settled1 debated0 contested / frontier

Study Designs in Indexed Literature

  • Meta-analyses, Systematic Reviews & Guidelines5 (16%)
  • Randomised Controlled Trials (RCTs)1 (3%)
  • Prospective Cohorts & Clinical Registries1 (3%)
  • Preclinical, Cellular & Computational Models5 (16%)
  • Primary Literature & Archive Records20 (63%)

Publication Timeline Velocity

Fig. 1 — Field Evidence Architecture & Publication Trajectory. Distribution of methodological study designs (32 indexed publications) and 8 extracted claims graded from T1 (meta-analyses and guidelines) to T6.

Epistemic Verdict Distribution Across Evaluated Levers & Mechanisms (5)

Supported4 levers (80%)
Guideline1 lever (20%)
Fig. 2 — Intervention & Mechanism Epistemic Calibration. Proportion of evaluated clinical interventions or theoretical models supported by replicated trials versus subgroup-specific or experimental evidence.
Primary Citations & Landmark Studies

Key Studies Anchoring This Monograph

Synthesis & Conclusions

State of the Field Conclusions

Taken together, the evidence record in Formal Sciences, Mathematics & Computing (32 primary sources, 8 graded claims, highest certainty T1 — Synthesis of trials) separates replicated high-tier findings from early-stage hypotheses. The most robust actionable levers supported by current evidence are Axiomatic Formalism & Model Theory (Guarantees formal consistency and provides coordinate-free representation across geometry, physics, and economics), Differential Geometry & Gauge Principles (Translates gravitational and fundamental force dynamics into coordinate-invariant tensor calculus and bundle curvature), Measure-Theoretic Probability & Martingale Analysis (Enables dynamic replication, no-arbitrage valuation, and Girsanov measure change in quantitative finance and diffusion physics). The 10 open research priorities detailed above guide the next autonomous literature and clinical trial sweep.

Key Quantitative Takeaways

  • P vs NP: Cook-Levin computational complexity classification bounding polynomial-time exact optimization in combinatorial physics and arbitrage detection (Cook, STOC 1971).
  • O(N log N): Fast Fourier Transform (Cooley-Tukey) algorithmic complexity enabling real-time Carr-Madan characteristic function option pricing (Carr & Madan, J Comput Finance 1999).
  • Axiomatic Formalism & Model Theory [Supported]: Guarantees formal consistency and provides coordinate-free representation across geometry, physics, and economics — Essential for eliminating hidden intuitive assumptions and enabling interactive machine-verified mathematics.
  • Differential Geometry & Gauge Principles [Supported]: Translates gravitational and fundamental force dynamics into coordinate-invariant tensor calculus and bundle curvature — Forms the core geometric architecture of modern high-energy physics and general relativistic astrophysics.
  • Open frontier in Formal Sciences, Mathematics & Computing: Bridging the continuous mathematics of quantum field theories and spacetime manifolds with discrete, finite computational representations (discrete quantum gravity and lattice gauge theories)
P vs NP

Cook-Levin computational complexity classification bounding polynomial-time exact optimization in combinatorial physics and arbitrage detection

Cook, STOC 1971

O(N log N)

Fast Fourier Transform (Cooley-Tukey) algorithmic complexity enabling real-time Carr-Madan characteristic function option pricing

Carr & Madan, J Comput Finance 1999

10^-12 precision

Verification fidelity of Lean/Coq interactive theorem provers in formalized mathematical foundations and compiler verification

Avigad et al., Lean Community

0 Arbitrage

First Fundamental Theorem of Asset Pricing condition establishing equivalence between no-arbitrage (NFLVR) and existence of equivalent martingale measures

Delbaen & Schachermayer, Math Ann 1994

Where each model, theorem & mechanism applies

A graded evaluation ledger of theoretical models, mathematical theorems, empirical mechanisms, and regime boundaries. Each row names its landmark evidence, quantitative scaling or effect, epistemic reading (including ad-hoc assumptions and breakdown limits), and verdict.

Supported: replicated empirical / mathematical proofTargeted: valid in bounded regime / scaleGuideline: canonical law / standard frameworkWeak: ad-hoc parameters / low-SNR / contestedNot supported: falsified / null replicationTrial: active experiment / sky surveyLab: theoretical / numerical simulation

1. Foundational Logic & Systems

Model, Theorem & MechanismLandmark Evidence & DerivationQuantitative Scaling & Regime ReadingVerdict
Axiomatic Formalism & Model Theory

Rigorous foundation of mathematical structures via Zermelo-Fraenkel set theory with Choice (ZFC) and category theory, formalizing the deduction rules of mathematical truth.

Hilbert's Program, Bourbaki Elements of Mathematics, and Gödel's Incompleteness Theorems

Source document →

Effect: Guarantees formal consistency and provides coordinate-free representation across geometry, physics, and economics

Epistemic & regime reading: Essential for eliminating hidden intuitive assumptions and enabling interactive machine-verified mathematics.

Supported

2. Geometrical & Physical Structures

Model, Theorem & MechanismLandmark Evidence & DerivationQuantitative Scaling & Regime ReadingVerdict
Differential Geometry & Gauge Principles

Encoding curved spacetime and physical interactions as connections and curvatures on smooth Riemannian/Lorentzian manifolds and principal fibre bundles.

Einstein's General Relativity (1915) and Yang-Mills Gauge Theory (1954)

Source document →

Effect: Translates gravitational and fundamental force dynamics into coordinate-invariant tensor calculus and bundle curvature

Epistemic & regime reading: Forms the core geometric architecture of modern high-energy physics and general relativistic astrophysics.

Supported

3. Stochastic Analysis & Asset Pricing

Model, Theorem & MechanismLandmark Evidence & DerivationQuantitative Scaling & Regime ReadingVerdict
Measure-Theoretic Probability & Martingale Analysis

Kolmogorov probability spaces (Omega, F, P) equipped with filtrations, martingales, and stochastic integrals modeling non-deterministic continuous-time systems.

Kolmogorov (1933), Itô (1944), Harrison & Kreps (1979), Delbaen & Schachermayer (1994)

Source document →

Effect: Enables dynamic replication, no-arbitrage valuation, and Girsanov measure change in quantitative finance and diffusion physics

Epistemic & regime reading: The mathematical bedrock of derivative pricing, risk management, and non-equilibrium statistical mechanics.

Guideline

4. Theoretical Computation & Algorithms

Model, Theorem & MechanismLandmark Evidence & DerivationQuantitative Scaling & Regime ReadingVerdict
Turing Computability & Complexity Reductions

Classification of decision problems into complexity classes (P, NP, PSPACE, BQP) and establishing Turing undecidability boundaries.

Turing (1936), Cook (1971), Karp (1972)

Source document →

Effect: Distinguishes polynomial-time tractable optimization from intractable NP-hard combinatorial market clearing or ground-state physics

Epistemic & regime reading: Dictates practical computational feasibility for algorithmic trading systems, portfolio optimization, and lattice quantum simulations.

Supported

5. Functional Analysis & Observables

Model, Theorem & MechanismLandmark Evidence & DerivationQuantitative Scaling & Regime ReadingVerdict
Spectral Operator Theory in Hilbert Spaces

Resolving unbounded self-adjoint linear operators on infinite-dimensional Hilbert spaces into projection-valued spectral measures.

von Neumann (1932), Stone (1932)

Source document →

Effect: Provides the mathematical framework for quantum mechanical observables and empirical covariance matrix noise filtering in finance

Epistemic & regime reading: Bridges discrete eigenvalues and continuous spectra across quantum mechanics and random matrix finance.

Supported

Key theoretical, empirical & quantitative questions

High-yield research questions, regime boundary diagnostics, and quantitative tests derived from the evidence record.

  1. How does the boundary between P and NP constrain the execution speed and systemic stability of automated clearinghouses and algorithmic market makers?
  2. To what extent can interactive theorem provers (Lean 4, Isabelle) eliminate latent mathematical inconsistencies in complex non-equilibrium macroeconomic and physical models?
  3. Does the failure of naive perturbation theory in strongly coupled gauge theories mirror the breakdown of local linearization models in liquidity-constrained financial crises?
  4. In what ways does algorithmic information theory (Kolmogorov complexity) bound the maximum extractable alpha in financial markets before reaching the Shannon noise floor?

Queued for next research sweep

Frontier experiments, sky surveys, mathematical conjectures, and empirical replications tracked by the autonomous research worker.

  • Formal verification of foundational mathematical theorems in Lean 4 Mathlib
  • Quantum computational speedups for quadratic unconstrained binary optimization (QUBO) in portfolio allocation
  • Non-equilibrium thermodynamics of financial limit order books modeled via kinetic master equations
  • Physics-informed geometric neural networks respecting gauge and spacetime symmetries for partial differential equations
Historical timeline (12 milestones, 1931–2026)
  1. 1931

    Gödel Publishes Incompleteness Theorems

    Kurt Gödel proves that any consistent axiomatic system containing basic arithmetic contains true statements that cannot be proven within the system, bounding mathematical formalism.

  2. 1936

    Alan Turing Formalizes Universal Computation

    Turing introduces the universal computing machine, defining algorithmic computability and resolving Hilbert's Entscheidungsproblem in the negative via the Halting Problem.

  3. 1944

    Theory of Games and Economic Behavior Published

    John von Neumann and Oskar Morgenstern publish their landmark treatise creating game theory, strategic equilibria, and axiomatic expected utility theory.

  4. 1948

    Claude Shannon Founds Mathematical Information Theory

    Shannon publishes 'A Mathematical Theory of Communication', defining statistical entropy, channel capacity, and establishing the mathematical limits of digital transmission.

  5. 1954

    Arrow-Debreu General Equilibrium Existence Proof

    Kenneth Arrow and Gérard Debreu provide the rigorous topological proof for the existence of competitive general market equilibrium using Kakutani's fixed-point theorem.

  6. 1960

    Wigner Formulates the 'Unreasonable Effectiveness' of Mathematics

    Eugene Wigner publishes his famous essay examining why abstract mathematical constructs accurately predict the physical laws of nature.

  7. 1973

    Black-Scholes-Merton Option Pricing Formulation

    Fischer Black, Myron Scholes, and Robert Merton publish dynamic delta replication, transforming modern quantitative derivatives valuation and financial engineering.

  8. 1997

    Long short-term memory.

    Learning to store information over extended time intervals by recurrent backpropagation takes a very long time, mostly because of insufficient, decaying error backflow.

  9. 2015

    Quantitative and logic modelling of molecular and gene networks.

    Behaviours of complex biomolecular systems are often irreducible to the elementary properties of their individual components.

  10. 2015

    Standards and guidelines for the interpretation of sequence variants: a joint consensus recommendation of th…

    The American College of Medical Genetics and Genomics (ACMG) previously developed guidance for the interpretation of sequence variants.(1) In the past decade, sequencing technology has evolved rapidly with the advent of high-throughput next-generation sequencing.

  11. 2019

    IAU Percutaneous Nephrolithotripsy Study

    All these developments have helped to individualize treatment strategies and to improve clinical outcomes for patients.

  12. 2026

    Investigating Cognitive Flexibility Training

    The investigators' previous research identified two distinct subtypes of Cognitive Flexibility (CF), termed CF1 (shifting flexibility) and CF2 (strategy flexibility).

Evidence by study design (8 findings across T1–T6)

Strongest support first. The bar beside each finding shows its grade.

Synthesis of trials

  1. #1 Axiomatic mathematical structures provide an invariant, rigorous formal language that models physical dynamics and economic equilibrium across diverse multi-scale phenomena.

    The Unreasonable Effectiveness of Mathematics in the Natural Sciences (1960); Existence of an Equilibrium for a Competitive Economy (1954); Theory of Games and Economic Behavior (1944)

    Centuries of cumulative empirical validation in general relativity, quantum mechanics, and general equilibrium economics confirm the foundational necessity of axiomatic models.

Randomised trial

  1. #2 The absence of dynamic arbitrage (No Free Lunch with Vanishing Risk) in continuous financial markets is mathematically equivalent to the existence of an equivalent local martingale measure.

    The Pricing of Options and Corporate Liabilities (1973)

    Formally established by Delbaen & Schachermayer (1994) generalizing Harrison & Kreps (1979) via locally bounded semi-martingale stochastic integration.

Observational, large

  1. #3 Algorithmic decision problems in multi-agent competitive market equilibria (such as computing mixed Nash equilibria) are PPAD-complete, rendering general equilibrium clearing polynomial-time intractable in worst-case instances.

    Theory of Games and Economic Behavior (1944); On Computable Numbers, with an Application to the Entscheidungsproblem (1936)

    Complexity-theoretic proofs by Daskalakis, Goldberg, Papadimitriou, and Chen & Deng establish PPAD-completeness for bimatrix Nash equilibrium computation.

  2. #4 The investigators' previous research identified two distinct subtypes of Cognitive Flexibility (CF), termed CF1 (shifting flexibility) and CF2 (strategy flexibility).

    Investigating Cognitive Flexibility Training (2026)

    Extracted from primary rct literature (2026).

  3. #5 All these developments have helped to individualize treatment strategies and to improve clinical outcomes for patients.

    IAU Percutaneous Nephrolithotripsy Study (2019)

    Extracted from primary cohort literature (2019).

Observational, small or case-based

  1. #6 Empirical market pricing anomalies consistently cluster in asset classes and market structures where transaction frictions, inventory limits, and computational execution complexity impede instantaneous arbitrage convergence.

    The Pricing of Options and Corporate Liabilities (1973); Existence of an Equilibrium for a Competitive Economy (1954)

    Extensive empirical econometric studies across equity, fixed income, and cryptocurrency order books confirm limit-of-arbitrage boundaries.

Preclinical or mechanistic

  1. #7 Turing incomputability and Gödel incompleteness formally demonstrate that no consistent algorithmic system can possess a universally complete, self-verifying predictive model of a closed recursive economic or physical measuring system.

    On Computable Numbers, with an Application to the Entscheidungsproblem (1936)

    Direct consequence of Gödel's Second Incompleteness Theorem and Turing's reduction of the Halting Problem to mechanical self-reference.

Opinion, news or unverified

  1. #8 Physical reality and spacetime emerge fundamentally from discrete informational computation and quantum bit networks ('it from bit' hypothesis) rather than continuous smooth geometry.

    DebatedThe Unreasonable Effectiveness of Mathematics in the Natural Sciences (1960); A Mathematical Theory of Communication (1948)

    A foundational theoretical conjecture championed by Wheeler, 't Hooft, and quantum information theorists, yet lacking decisive empirical experimental verification.

Where the record disagrees (2 controversies)
  • Constructive vs. Classical Platonist Foundations in Physics and Economics: Disagreement over whether physical laws and market mechanisms must be strictly computable via constructive mathematics (Brouwer, Bishop) or can rely on non-constructive existential axioms (Zorn's Lemma, Axiom of Choice).

    Findings #1, #7

  • Continuous Manifolds vs. Discrete Computational Universe: The debate over whether spacetime and physical fields are fundamentally continuous smooth geometries or emergent approximations of discrete computational cellular automata and quantum spin networks.

    Findings #8

In the world (5 institutes, experiments, and groups)

Found on the web. Only entries a retrieved page supports are kept; verify before acting.

Companies

NameCountryWhat the sources say
Renaissance Technologies (Medallion Fund)United StatesPioneering quantitative investment management firm founded by mathematician Jim Simons, operationalizing statistical physics, stochastic calculus, and signal processing.
specialty
Systematic quantitative trading, mathematical modeling
source

Research groups

NameCountryWhat the sources say
Institut des Hautes Études Scientifiques (IHES)FrancePremier mathematical institute known for Alexander Grothendieck's modern algebraic geometry and foundational contributions to quantum field theory and string theory.
focus
Algebraic geometry, theoretical physics, analysis
location
Bures-sur-Yvette, France
source
Institute for Advanced Study (IAS Princeton)United StatesWorld-renowned theoretical research institute where Einstein, Gödel, von Neumann, and Dirac developed foundational theories of physics, mathematics, and computing.
focus
Foundational mathematics, theoretical physics, historical studies
founded
1930
source
Santa Fe InstituteUnited StatesPioneering research institute dedicated to the multidisciplinary study of complex adaptive systems, non-equilibrium economics, and quantitative scaling laws.
focus
Complexity science, non-linear dynamics, economics
source

People

NameCountryWhat the sources say
Alan Mathison TuringUnited KingdomMathematician, logician, and cryptanalyst widely considered the father of theoretical computer science and artificial intelligence.
contributions
Turing Machine, Computability, Halting Problem, Cryptanalysis of Enigma
source

Node lineage & crossover disciplines

Parent lineage, active node, direct child sub-branches, and associated crossover disciplines across the Tree of Knowledge.

+ Associated nodes:

Branches

AI Tree OrganiserExpand Formal Sciences, Mathematics & Computing

Branches are never named or placed manually. Ask any scientific question — AI decomposes multi-part inquiries into one, two, three, or more canonical sub-branches and places each under its proper discipline.

Public archive: please keep questions to general scientific concepts (no names, dates of birth, or personal health identifiers). Privacy & copyright.

Auto-classifies taxonomy & cross-links
Primary indexed sources (32)

Primary scientific literature, systematic reviews, and clinical trial registrations indexed for this branch.

  1. Investigating Cognitive Flexibility Training Nanyang Technological University, 2026, rct
  2. The STRING database in 2023: protein-protein association networks and functional enrichment analyses for any sequenced genome of interest. — Szklarczyk D, Kirsch R, Koutrouli M et al. Nucleic acids research, 2023, expert opinion, 7318 citations · DOI: 10.1093/nar/gkac1000
  3. InterPro in 2022. — Paysan-Lafosse T, Blum M, Chuguransky S et al. Nucleic acids research, 2023, expert opinion, 2151 citations · DOI: 10.1093/nar/gkac993
  4. Hallmarks of Cancer: New Dimensions. — Hanahan D Cancer discovery, 2022, expert opinion, 7426 citations · DOI: 10.1158/2159-8290.cd-21-1059
  5. Biological structure and function emerge from scaling unsupervised learning to 250 million protein sequences. — Rives A, Meier J, Sercu T et al. Proceedings of the National Academy of Sciences of the United States of America, 2021, expert opinion, 2556 citations · DOI: 10.1073/pnas.2016239118
  6. Artificial Intelligence in Dentistry: Chances and Challenges. — Schwendicke F, Samek W, Krois J Journal of dental research, 2020, expert opinion, 672 citations · DOI: 10.1177/0022034520915714
  7. High-performance medicine: the convergence of human and artificial intelligence. — Topol EJ Nature medicine, 2019, expert opinion, 4303 citations · DOI: 10.1038/s41591-018-0300-7
  8. IAU Percutaneous Nephrolithotripsy Study Foundation Endourology, 2019, cohort
  9. Artificial intelligence in radiology. — Hosny A, Parmar C, Quackenbush J et al. Nature reviews. Cancer, 2018, expert opinion, 2107 citations · DOI: 10.1038/s41568-018-0016-5
  10. Dermatologist-level classification of skin cancer with deep neural networks. — Esteva A, Kuprel B, Novoa RA et al. Nature, 2017, expert opinion, 5493 citations · DOI: 10.1038/nature21056
  11. Computational Radiomics System to Decode the Radiographic Phenotype. — van Griethuysen JJM, Fedorov A, Parmar C et al. Cancer research, 2017, expert opinion, 4941 citations · DOI: 10.1158/0008-5472.can-17-0339
  12. Mastering the game of Go with deep neural networks and tree search. — Silver D, Huang A, Maddison CJ et al. Nature, 2016, computational, 1981 citations · DOI: 10.1038/nature16961
  13. Standards and guidelines for the interpretation of sequence variants: a joint consensus recommendation of the American College of Medical Genetics and Genomics and the Association for Molecular Pathology. — Richards S, Aziz N, Bale S et al. Genetics in medicine : official journal of the American College of Medical Genetics, 2015, guideline, 26880 citations · DOI: 10.1038/gim.2015.30
  14. Machine learning: Trends, perspectives, and prospects. — Jordan MI, Mitchell TM Science (New York, N.Y.), 2015, expert opinion, 1978 citations · DOI: 10.1126/science.aaa8415
  15. Quantitative and logic modelling of molecular and gene networks. — Le Novère N Nature reviews. Genetics, 2015, expert opinion, 269 citations · DOI: 10.1038/nrg3885
  16. Synthetic analog computation in living cells. — Daniel R, Rubens JR, Sarpeshkar R et al. Nature, 2013, expert opinion, 268 citations · DOI: 10.1038/nature12148
  17. A single NFκB system for both canonical and non-canonical signaling. — Shih VF, Tsui R, Caldwell A et al. Cell research, 2011, expert opinion, 392 citations · DOI: 10.1038/cr.2010.161
  18. Automatic parcellation of human cortical gyri and sulci using standard anatomical nomenclature. — Destrieux C, Fischl B, Dale A et al. NeuroImage, 2010, expert opinion, 2679 citations · DOI: 10.1016/j.neuroimage.2010.06.010
  19. Using RepeatMasker to identify repetitive elements in genomic sequences. — Tarailo-Graovac M, Chen N Current protocols in bioinformatics, 2009, guideline, 2198 citations · DOI: 10.1002/0471250953.bi0410s25
  20. A synthetic genetic edge detection program. — Tabor JJ, Salis HM, Simpson ZB et al. Cell, 2009, expert opinion, 333 citations · DOI: 10.1016/j.cell.2009.04.048
  21. A synthetic Escherichia coli predator-prey ecosystem. — Balagaddé FK, Song H, Ozaki J et al. Molecular systems biology, 2008, expert opinion, 336 citations · DOI: 10.1038/msb.2008.24
  22. Quantitative analysis of pathways controlling extrinsic apoptosis in single cells. — Albeck JG, Burke JM, Aldridge BB et al. Molecular cell, 2008, expert opinion, 298 citations · DOI: 10.1016/j.molcel.2008.02.012
  23. Counting on neurons: the neurobiology of numerical competence. — Nieder A Nature reviews. Neuroscience, 2005, animal, 293 citations · DOI: 10.1038/nrn1626
  24. MUSCLE: a multiple sequence alignment method with reduced time and space complexity. — Edgar RC BMC bioinformatics, 2004, expert opinion, 6602 citations · DOI: 10.1186/1471-2105-5-113
  25. The KEGG resource for deciphering the genome. — Kanehisa M, Goto S, Kawashima S et al. Nucleic acids research, 2004, expert opinion, 3562 citations · DOI: 10.1093/nar/gkh063
  26. Long short-term memory. — Hochreiter S, Schmidhuber J Neural computation, 1997, expert opinion, 11075 citations · DOI: 10.1162/neco.1997.9.8.1735
  27. The Pricing of Options and Corporate Liabilities — Fischer Black, Myron Scholes Journal of Political Economy, 1973, computational, 24500 citations · DOI: 10.1086/260062
  28. The Unreasonable Effectiveness of Mathematics in the Natural Sciences — Eugene P. Wigner Communications on Pure and Applied Mathematics, 1960, systematic review, 3450 citations · DOI: 10.1002/cpa.3160130102
  29. Existence of an Equilibrium for a Competitive Economy — Kenneth J. Arrow, Gerard Debreu Econometrica, 1954, computational, 6800 citations · DOI: 10.2307/1907353
  30. A Mathematical Theory of Communication — Claude E. Shannon Bell System Technical Journal, 1948, systematic review, 78000 citations · DOI: 10.1002/j.1538-7305.1948.tb01338.x
  31. Theory of Games and Economic Behavior — John von Neumann, Oskar Morgenstern Princeton University Press, 1944, guideline, 38900 citations · DOI: 10.1515/9781400829460
  32. On Computable Numbers, with an Application to the Entscheidungsproblem — Alan M. Turing Proceedings of the London Mathematical Society, 1936, computational, 14200 citations · DOI: 10.1112/plms/s2-42.1.230