Cited by 8,283Computability, Logic, AI Algorithmssemigroups and automata theoryLogic, programming, and type systems

On computable numbers, with an application to the entscheidungsproblem

Turing, A. M.·1937·Proceedings of the London Mathematical Society

Integrity signals

Registry

Crossref · 10.1112/plms/s2-42.1.230

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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

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
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