The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Computability of Recursive Functions
Abstract
article Free Access Share on Computability of Recursive Functions Authors: J. C. Shepherdson University of Bristol, England and University of California, Berkeley University of Bristol, England and University of California, BerkeleyView Profile , H. E. Sturgis University of California, Berkeley University of California, BerkeleyView Profile Authors Info & Claims Journal of the ACMVolume 10Issue 2April 1963 pp 217–255https://doi.org/10.1145/321160.321170Published:01 April 1963Publication History 298citation1,685DownloadsMetricsTotal Citations298Total Downloads1,685Last 12 Months134Last 6 weeks25 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
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
Introduction to Metamathematics
Rasiowa, H. (1952) · Medical Entomology and Zoology · Cited by 4,307
An Unsolvable Problem of Elementary Number Theory
Church, A. (1936) · American Journal of Mathematics · doi:10.2307/2371045 · Cited by 1,763
Computability and Unsolvability.
Elgot, C., & Davis, M. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002808 · Cited by 980
Formal Reductions of the General Combinatorial Decision Problem
Post, E. L. (1943) · American Journal of Mathematics · doi:10.2307/2371809 · Cited by 850
A note on the Entscheidungsproblem
Church, A. (1936) · Journal of Symbolic Logic · doi:10.2307/2269326 · Cited by 810
General recursive functions of natural numbers
Kleene, S. C. (1936) · Mathematische Annalen · doi:10.1007/bf01565439 · Cited by 593
A Set of Postulates for the Foundation of Logic
Church, A. (1932) · The Annals of Mathematics · doi:10.2307/1968337 · Cited by 583
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
Cited by
Blum, L., Shub, M., & Smale, S. (1989) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1989-15750-9 · Cited by 1,056
Atchison, W. F., Conte, S. D., Hamblen, J. W., Hull, T. E., Keenan, T. A., Kehl, W. B., McCluskey, E. J., Navarro, S. O., Rheinboldt, W. C., Schweppe, E. J., et al. (1968) · Communications of the ACM · doi:10.1145/362929.362976 · Cited by 468
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Cook, S. A. (1971) · Journal of the ACM · doi:10.1145/321623.321625 · Cited by 360
Computability: An introduction to recursive function theory
Cutland, N. (1980) · doi:10.1017/cbo9781139171496 · Cited by 206
Metadata
- Authors
- Shepherdson, J. C., & Sturgis, H. E.
- Venue
- Journal of the ACM
- Published
- 1963-04
- Volume
- 10
- Issue
- 2
- Pages
- 217-255
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2094542439
- Cited by
- 395
- References
- 14
- FWCI
- 10.07
- 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: Computability of Recursive Functions. https://app.cochat.ai/papers/10.1145/321160.321170
- The paper
- Shepherdson, J. C., & Sturgis, H. E. (1963). Computability of Recursive Functions. Journal of the ACM. https://doi.org/10.1145/321160.321170
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.