The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
Abstract
problems and computable functionsUniversal Turing Machine R.I
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The chemical basis of morphogenesis
Turing, A. M. (1952) · Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences · doi:10.1098/rstb.1952.0012 · Cited by 11,733
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Computing Machinery and Intelligence (1950)
Turing, A. (2004) · The Essential Turing · doi:10.1093/oso/9780198250791.003.0017 · Cited by 6,118
Dictionary of Scientific Biography
Miller, S. T. (1981) · Reference Services Review · doi:10.1108/eb048704 · Cited by 2,405
ROUNDING-OFF ERRORS IN MATRIX PROCESSES
TURING, A. M. (1948) · The Quarterly Journal of Mechanics and Applied Mathematics · doi:10.1093/qjmam/1.1.287 · Cited by 387
On Computable Numbers, with an Application to the Entscheidungsproblem (1936)
Turing, A. (2004) · The Essential Turing · doi:10.1093/oso/9780198250791.003.0005 · Cited by 322
Computability and λ-definability
Turing, A. M. (1937) · Journal of Symbolic Logic · doi:10.2307/2268280 · Cited by 262
Intelligent Machinery, A Heretical Theory*
TURING, A. M. (1996) · Philosophia Mathematica · doi:10.1093/philmat/4.3.256 · Cited by 160
Davis, M. D. (2004) · Medical Entomology and Zoology · Cited by 151
Self-citationCopeland, J. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198747826.003.0035 · Cited by 104
Cited by
Cellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G
Vaezi, M., Azari, A., Khosravirad, S. R., Shirvanimoghaddam, M., Azari, M. M., Chasaki, D., & Popovski, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3151028 · Cited by 631
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
The Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70
Bernoulli's principle of insufficient reason and conservation of information in computer search
Dembski, W. A., & Marks, R. J. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346119 · Cited by 32
Metadata
- Authors
- Elgot, C. C., & Davis, M.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1966-01
- Volume
- 20
- Issue
- 93
- Pages
- 199
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W2958814800
- Cited by
- 323
- References
- 19
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. https://app.cochat.ai/papers/10.2307/2004326
- The paper
- Elgot, C. C., & Davis, M. (1966). The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Mathematics of Computation. https://doi.org/10.2307/2004326
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.