On computable numbers, with an application to the entscheidungsproblem
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
A brain can be substituted with a Turing machine or cellular automaton because both are capable of universal computation and may emulate the brain's responses.
“Examples of such substitutions may involve substituting a brain with a Turing machine or a cellular automaton since both types of systems are capable of universal computation (Turing 1937; Wolfram 1984) and hence may emulate the brain’s responses”
From Falsification and consciousness (2021) · cites this paper as Turing 1937
Turing machines, being capable of universal computation, should provide an ideal candidate for a universal substitution.
“Since they are capable of universal computation (Turing 1937), they should provide an ideal candidate for a universal substitution.”
From Falsification and consciousness (2021) · cites this paper as Turing 1937
Cited by
Sorted by citations
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570 · see citing works
High-performance medicine: the convergence of human and artificial intelligence
Topol, E. J. (2019) · Nature Medicine · doi:10.1038/s41591-018-0300-7 · Cited by 10,450 · see citing works
I.—COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1950) · Mind · doi:10.1093/mind/lix.236.433 · Cited by 10,290 · see citing works
Self-citationPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904 · see citing works
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896 · see citing works
Artificial intelligence in higher education: the state of the field
Crompton, H., & Burke, D. (2023) · International Journal of Educational Technology in Higher Education · doi:10.1186/s41239-023-00392-8 · Cited by 2,010 · see citing works
“It was coined in 1956 by McCarthy (Cris-tianini, 2016) who followed up on the work of Turing (e.g., Turing, 1937, 1950).”
BackgroundA formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758 · see citing works
The World’s Technological Capacity to Store, Communicate, and Compute Information
Hilbert, M., & López, P. (2011) · Science · doi:10.1126/science.1200970 · Cited by 1,643 · see citing works
Neuroscience-Inspired Artificial Intelligence
Hassabis, D., Kumaran, D., Summerfield, C., & Botvinick, M. (2017) · Neuron · doi:10.1016/j.neuron.2017.06.011 · Cited by 1,557 · see citing works
A formal theory of inductive inference. Part I
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90223-2 · Cited by 1,192 · see citing works
The Distributed Nature of Working Memory
Christophel, T. B., Klink, P. C., Spitzer, B., Roelfsema, P. R., & Haynes, J.-D. (2017) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2016.12.007 · Cited by 882 · see citing works
Montague, P. R., Dolan, R. J., Friston, K. J., & Dayan, P. (2012) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2011.11.018 · Cited by 809 · see citing works
Artificial intelligence in medical practice: the question to the answer?
Miller, D. D., & Brown, E. W. (2018) · The American Journal of Medicine · doi:10.1016/j.amjmed.2017.10.035 · Cited by 774 · see citing works
On Notation for Ordinal Numbers
Kleene, S. C. (1938) · Journal of Symbolic Logic · doi:10.2307/2267778 · Cited by 758 · see citing works
Playing Research: Methodological approaches to game analysis
Aarseth, E. (2007) · Artnodes · doi:10.7238/a.v0i7.763 · Cited by 413 · see citing works
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Valiant, L. G. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700377025 · Cited by 311 · see citing works
A Computational Foundation for the Study of Cognition
Chalmers, D. J. (2011) · Journal of Cognitive Science · doi:10.17791/jcs.2011.12.4.325 · Cited by 294 · see citing works
The Integration of Artificial Intelligence into Clinical Practice
Karalis, V. D. (2024) · Applied Biosciences · doi:10.3390/applbiosci3010002 · Cited by 255 · see citing works
Piccinini, G. (2004) · Synthese · doi:10.1023/b:synt.0000043018.52445.3e · Cited by 215 · see citing works
Computability: An introduction to recursive function theory
Cutland, N. (1980) · doi:10.1017/cbo9781139171496 · Cited by 206 · see citing works
The algorithmic origins of life
Walker, S. I., & Davies, P. C. W. (2013) · Journal of The Royal Society Interface · doi:10.1098/rsif.2012.0869 · Cited by 196 · see citing works
An artificial intelligence educational strategy for the digital transformation
Cantú-Ortiz, F. J., Galeano Sánchez, N., Garrido, L., Terashima-Marin, H., & Brena, R. F. (2020) · International Journal on Interactive Design and Manufacturing (IJIDeM) · doi:10.1007/s12008-020-00702-8 · Cited by 192 · see citing works
Lehman, J., Clune, J., Misevic, D., Adami, C., Altenberg, L., Beaulieu, J., Bentley, P. J., Bernard, S., Beslon, G., Bryson, D. M., et al. (2020) · Artificial Life · doi:10.1162/artl_a_00319 · Cited by 181 · see citing works
Dissipative Quantum Church-Turing Theorem
Kliesch, M., Barthel, T., Gogolin, C., Kastoryano, M., & Eisert, J. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.120501 · Cited by 154 · see citing works
The unfolding argument: Why IIT and other causal structure theories cannot explain consciousness
Doerig, A., Schurger, A., Hess, K., & Herzog, M. H. (2019) · Consciousness and Cognition · doi:10.1016/j.concog.2019.04.002 · Cited by 140 · see citing works
“Moreover, the universal function approximator property is not restricted to neural networks but also holds true for Turing machines, cellular automata, cyclic tag systems, and more generally for any universal computing system (Turing, 1937; Wolfram, 2002).”
Hrastinski, S., Olofsson, A. D., Arkenback, C., Ekström, S., Ericsson, E., Fransson, G., Jaldemark, J., Ryberg, T., Öberg, L.-M., Fuentes, A., et al. (2019) · Postdigital Science and Education · doi:10.1007/s42438-019-00046-x · Cited by 145 · see citing works
Machine learning and digital biomarkers can detect early stages of neurodegenerative diseases
Chudzik, A., Śledzianowski, A., & Przybyszewski, A. W. (2024) · Sensors · doi:10.3390/s24051572 · Cited by 122 · see citing works
Gödel Machines: Fully Self-referential Optimal Universal Self-improvers
Schmidhuber, J. (2007) · Cognitive Technologies · doi:10.1007/978-3-540-68677-4_7 · Cited by 110 · see citing works
Neural networks for computer-aided diagnosis in medicine: A review
lin, D., Vasilakos, A. V., Tang, Y., & Yao, Y. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.08.039 · Cited by 105 · see citing works
Hoffman, D. D., & Prakash, C. (2014) · Frontiers in Psychology · doi:10.3389/fpsyg.2014.00577 · Cited by 103 · see citing works
Kendall, G., & Teixeira da Silva, J. A. (2024) · Learned Publishing · doi:10.1002/leap.1578 · Cited by 100 · see citing works
Origins of life: a problem for physics, a key issues review
Walker, S. I. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7804 · Cited by 94 · see citing works
A cross-disciplinary introduction to quantum annealing-based algorithms
Venegas-Andraca, S. E., Cruz-Santos, W., McGeoch, C., & Lanzagorta, M. (2018) · Contemporary Physics · doi:10.1080/00107514.2018.1450720 · Cited by 83 · see citing works
The cognitive architecture for chaining of two mental operations
Sackur, J., & Dehaene, S. (2009) · Cognition · doi:10.1016/j.cognition.2009.01.010 · Cited by 73 · see citing works
Cognitive Architectures for Language Agents
Sumers, T. R., Yao, S., Narasimhan, K., & Griffiths, T. L. (2023) · arXiv · doi:10.48550/arxiv.2309.02427 · Cited by 72 · see citing works
The Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70 · see citing works
From symbols to icons: the return of resemblance in the cognitive neuroscience revolution
Williams, D., & Colling, L. (2018) · Synthese · doi:10.1007/s11229-017-1578-6 · Cited by 69 · see citing works
Computational complexity in electronic structure
Whitfield, J. D., Love, P. J., & Aspuru-Guzik, A. (2013) · Phys. Chem. Chem. Phys. · doi:10.1039/c2cp42695a · Cited by 71 · see citing works
Can a machine think (anything new)? Automation beyond simulation
Fazi, M. B. (2019) · AI & SOCIETY · doi:10.1007/s00146-018-0821-0 · Cited by 62 · see citing works
Reduced predictable information in brain signals in autism spectrum disorder
Gómez, C., Lizier, J. T., Schaum, M., Wollstadt, P., Grützner, C., Uhlhaas, P., Freitag, C. M., Schlitt, S., Bölte, S., Hornero, R., et al. (2014) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2014.00009 · Cited by 59 · see citing works
AHaH Computing–From Metastable Switches to Attractors to Machine Learning
Nugent, M. A., & Molter, T. W. (2014) · PLoS ONE · doi:10.1371/journal.pone.0085175 · Cited by 55 · see citing works
Dual Process Theory: Embodied and Predictive; Symbolic and Classical
Bellini-Leite, S. C. (2022) · Frontiers in Psychology · doi:10.3389/fpsyg.2022.805386 · Cited by 52 · see citing works
Analogue Computation and Representation
Maley, C. J. (2023) · The British Journal for the Philosophy of Science · doi:10.1086/715031 · Cited by 52 · see citing works
Falsification and consciousness
Kleiner, J., & Hoel, E. (2021) · Neuroscience of Consciousness · doi:10.1093/nc/niab001 · Cited by 46 · see citing works
Falsification and consciousness
Kleiner, J., & Hoel, E. (2020) · arXiv · doi:10.48550/arxiv.2004.03541 · Cited by 46
Merrill, W., Goldberg, Y., Schwartz, R., & Smith, N. A. (2021) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00412 · Cited by 44 · see citing works
THE NATURE OF HIERARCHICAL CONTROLS IN LIVING MATTER
Pattee, H. H. (1972) · Foundations of Mathematical Biology · doi:10.1016/b978-0-12-597201-7.50008-5 · Cited by 43 · see citing works
The Physical Meaning of the Holographic Principle
Fields, C., Glazebrook, J. F., & Marcianò, A. (2022) · Quanta · doi:10.12743/quanta.v11i1.206 · Cited by 37 · see citing works
AI chatbots: A disguised enemy for academic integrity?
Niloy, A. C., Hafiz, R., Hossain, B. M., Gulmeher, F., Sultana, N., Islam, K. F., Bushra, F., Islam, S., Hoque, S. I., Rahman, M., et al. (2024) · International Journal of Educational Research Open · doi:10.1016/j.ijedro.2024.100396 · Cited by 26 · see citing works
Rethinking Turing’s Test and the Philosophical Implications
Proudfoot, D. (2020) · Minds and Machines · doi:10.1007/s11023-020-09534-7 · Cited by 24 · see citing works
On the Limits of Recursively Self-Improving AGI
Yampolskiy, R. V. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-21365-1_40 · Cited by 23 · see citing works
Discussion: McCulloch-Pitts and related neural nets from 1943 to 1989
Cowan, J. D. (1990) · Bulletin of Mathematical Biology · doi:10.1007/bf02459569 · Cited by 22 · see citing works
Necessary and Sufficient Conditions for Quantum Computation
Lloyd, S. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552341 · Cited by 19 · see citing works
Basis for a neuronal version of Grover's quantum algorithm
Clark, K. B. (2014) · Frontiers in Molecular Neuroscience · doi:10.3389/fnmol.2014.00029 · Cited by 16 · see citing works
The computational stance in biology.
Wood, C. C. (2019) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2018.0380 · Cited by 14 · see citing works
Searching for the Non-Consequential: Dialectical Activities in HCI and the Limits of Computers
Zhang, H. (2024) · Proceedings of the CHI Conference on Human Factors in Computing Systems · doi:10.1145/3613904.3641945 · Cited by 12 · see citing works
A Computability Argument Against Superintelligence
Wiedermann, J. (2012) · Cognitive Computation · doi:10.1007/s12559-012-9124-9 · Cited by 12 · see citing works
Computing Education Research Today
Fincher, S. A., Tenenberg, J., Dorn, B., Hundhausen, C., McCartney, R., & Murphy, L. (2019) · The Cambridge Handbook of Computing Education Research · doi:10.1017/9781108654555.003 · Cited by 7 · see citing works
Imitation Game: Threshold or Watershed?
Neufeld, E., & Finnestad, S. (2020) · Minds and Machines · doi:10.1007/s11023-020-09544-5 · Cited by 5 · see citing works
ProgramBench: Can Language Models Rebuild Programs From Scratch?
Yang, J., Lieret, K., Ma, J., Thakkar, P., Pedchenko, D., Sootla, S., McMilin, E., Yin, P., Hou, R., Synnaeve, G., et al. (2026) · arXiv · doi:10.48550/arxiv.2605.03546
Zhang, J., Zhao, B., Yang, W., Foerster, J., Clune, J., Jiang, M., Devlin, S., & Shavrina, T. (2026) · arXiv · doi:10.48550/arxiv.2603.19461
- Authors
- Turing, A. M.
- Affiliations
- Princeton University (US)
- Corresponding author
- Turing, A. M.
- Venue
- Proceedings of the London Mathematical Society
- Publisher
- Wiley
- Published
- 1937
- Volume
- s2-42
- Issue
- 1
- Pages
- 230-265
- ISSN
- 0024-6115 (ISSN-L)
- OpenAlex
- W2126160338
- Cited by
- 8,283
- References
- 0
- Citations by year
- 2026: 173 · 2025: 437 · 2024: 281 · 2023: 329 · 2022: 415 · 2021: 369 · 2020: 380 · 2019: 393 · 2018: 331 · 2017: 307 · 2016: 268 · 2015: 308 · 2014: 296 · 2013: 301 · 2012: 338
- FWCI
- 8.84
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- Proceedings of the London Mathematical Society (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Keywords
- computable numbers, Entscheidungsproblem, computability, Turing machines, decidability, formal systems
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review