The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
General recursive functions of natural numbers
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
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (1931) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01700692 · Cited by 2,395
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (2006) · Monatshefte für Mathematik · doi:10.1007/s00605-006-0423-7 · Cited by 2,077
Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion
Péter, R. (1935) · Mathematische Annalen · doi:10.1007/bf01448046 · Cited by 46
Cited by
I.—COMPUTING MACHINERY AND INTELLIGENCE
TURING, A. M. (1950) · Mind · doi:10.1093/mind/lix.236.433 · Cited by 10,290
Stanford encyclopedia of philosophy: a dynamic reference work
Nodelman, U., Allen, C., & Zalta, E. N. (2002) · Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries · doi:10.1145/544220.544327 · Cited by 1,988
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
On Notation for Ordinal Numbers
Kleene, S. C. (1938) · Journal of Symbolic Logic · doi:10.2307/2267778 · Cited by 758
Self-citationSystems 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
Self-citationComputability of Recursive Functions
Shepherdson, J. C., & Sturgis, H. E. (1963) · Journal of the ACM · doi:10.1145/321160.321170 · Cited by 395
Recursive predicates and quantifiers
Kleene, S. C. (1943) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1943-0007371-8 · Cited by 363
Self-citationCoherence 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
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
Computability and λ-definability
Turing, A. M. (1937) · Journal of Symbolic Logic · doi:10.2307/2268280 · Cited by 262
The Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70
Assessing Artificial Intelligence: A Critique of Pure Computationalism
Tekinerdogan, B. (2024) · doi:10.31219/osf.io/cdw79 · Cited by 1
Metadata
- Authors
- Kleene, S. C.
- Venue
- Mathematische Annalen
- Published
- 1936-12
- Volume
- 112
- Issue
- 1
- Pages
- 727-742
- ISSN
- 0025-5831 (ISSN-L)
- 1432-1807
- OpenAlex
- W2023778211
- Cited by
- 593
- References
- 3
- FWCI
- 21.51
- 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.