Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 395

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

Shepherdson, J. C., Sturgis, H. E.·1963·Journal of the ACM

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/321160.321170

Cites

14 of 14 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 14 references

Cited by

See all 395

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.