The DOI matches its Crossref record.
An Unsolvable Problem of Elementary Number Theory
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
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
I.—COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1950) · Mind · doi:10.1093/mind/lix.236.433 · Cited by 10,290
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
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
Polynomial-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
Reiter, R. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90014-4 · Cited by 3,892
Newell, A. (1980) · Cognitive Science · doi:10.1207/s15516709cog0402_2 · Cited by 1,458
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Recursively enumerable sets of positive integers and their decision problems
Post, E. L. (1944) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1944-08111-1 · Cited by 872
Classes of recursively enumerable sets and their decision problems
Rice, H. G. (1953) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1953-0053041-6 · Cited by 869
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
On Notation for Ordinal Numbers
Kleene, S. C. (1938) · Journal of Symbolic Logic · doi:10.2307/2267778 · Cited by 758
Analyzing vision at the complexity level
Tsotsos, J. K. (1990) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00079577 · Cited by 707
Wallis, C. (2003) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/0952813021000055199 · Cited by 682
COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50006-6 · Cited by 678
Information and computation: Classical and quantum aspects
Galindo, A., & Martín-Delgado, M. A. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.347 · Cited by 552
Systems of logic based on ordinals
(2001) · Mathematical Logic · doi:10.1016/b978-044450423-4/50007-3 · Cited by 543
On the interpretation of intuitionistic number theory
Kleene, S. C. (1945) · Journal of Symbolic Logic · doi:10.2307/2269016 · Cited by 538
Recursive Unsolvability of a problem of Thue
Post, E. L. (1947) · Journal of Symbolic Logic · doi:10.2307/2267170 · Cited by 534
Finite combinatory processes—formulation
Post, E. L. (1936) · Journal of Symbolic Logic · doi:10.2307/2269031 · Cited by 516
Tegmark, M. (2008) · Foundations of Physics · doi:10.1007/s10701-007-9186-9 · Cited by 463
Sequential abstract-state machines capture sequential algorithms
Gurevich, Y. (2000) · ACM Transactions on Computational Logic · doi:10.1145/343369.343384 · Cited by 458
Computability of Recursive Functions
Shepherdson, J. C., & Sturgis, H. E. (1963) · Journal of the ACM · doi:10.1145/321160.321170 · Cited by 395
On the concept of a random sequence
Church, A. (1940) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1940-07154-x · Cited by 390
Self-citationRecursive predicates and quantifiers
Kleene, S. C. (1943) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1943-0007371-8 · Cited by 363
Coherence as constraint satisfaction
Thagard, P. (1998) · Cognitive Science · doi:10.1016/s0364-0213(99)80033-0 · Cited by 352
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Definability and decision problems in arithmetic
Robinson, J. (1949) · Journal of Symbolic Logic · doi:10.2307/2266510 · Cited by 314
Fundamentals of quantum information theory
Keyl, M. (2002) · Physics Reports · doi:10.1016/s0370-1573(02)00266-1 · Cited by 303
The Tractable Cognition Thesis
Van Rooij, I. (2008) · Cognitive Science · doi:10.1080/03640210801897856 · Cited by 285
Soare, R. I. (1996) · Bulletin of Symbolic Logic · doi:10.2307/420992 · Cited by 268
General Quantum Interference Principle and Duality Computer
Gui-Lu, L. (2006) · Communications in Theoretical Physics · doi:10.1088/0253-6102/45/5/013 · Cited by 264
Computability and λ-definability
Turing, A. M. (1937) · Journal of Symbolic Logic · doi:10.2307/2268280 · Cited by 262
Physics, Topology, Logic and Computation: A Rosetta Stone
Baez, J., & Stay, M. (2010) · Lecture Notes in Physics · doi:10.1007/978-3-642-12821-9_2 · Cited by 254
Harnessing the Power of the Second Quantum Revolution
Deutsch, I. H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020101 · Cited by 207
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
Secret Collusion among AI Agents: Multi-Agent Deception via Steganography
Motwani, S., Baranchuk, M., Strohmeier, M., Bolina, V., Torr, P., Hammond, L., & Witt, C. D. (2024) · Advances in Neural Information Processing Systems 37 · doi:10.52202/079017-2336 · Cited by 106
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
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
The Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70
Blum, L., & Blum, M. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2115934119 · Cited by 70
Compositional Reasoning in Early Childhood
Piantadosi, S., & Aslin, R. (2016) · PLOS ONE · doi:10.1371/journal.pone.0147734 · Cited by 53
One model for the learning of language
Yang, Y., & Piantadosi, S. T. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2021865119 · Cited by 50
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
The role of quantum mechanics in cognition-based evolution
Marshall, P. (2023) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2023.04.007 · Cited by 11
Assessing Artificial Intelligence: A Critique of Pure Computationalism
Tekinerdogan, B. (2024) · doi:10.31219/osf.io/cdw79 · Cited by 1
Metadata
- Authors
- Church, A.
- Venue
- American Journal of Mathematics
- Publisher
- JSTOR
- Published
- 1936-04
- Volume
- 58
- Issue
- 2
- Pages
- 345
- ISSN
- 0002-9327 (ISSN-L)
- OpenAlex
- W2323777246
- Cited by
- 1,763
- References
- 0
- FWCI
- 35.90
- 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
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.