The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Church's Thesis and Principles for Mechanisms
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
Research works printed but not linked: 10
- Boone, 1974, An algebraic characterization of groups with soluble word problem, J. Austral. Math. Soc., 18, 41, 10.1017/S1446788700019108 · doi:10.1017/s1446788700019108
- Gardner, 1971, Mathematical games, Sci. Am., 223, 120, 10.1038/scientificamerican1070-120 · DOI · Paper page
- Gödel, 1958, Über eine bisher noch nicht benützte Erweiterung des finiten Standpunkts, Diabetica, 12, 280
- Higman, 1961, Subgroups of finitely presented groups, Proc. Roy. Soc. Ser. A., 262, 455
- Kolmogorov, 1953, On the definition of an algorithm, Uspehi Math. Nauk., 8, 125
- 1963, Am. Math. Soc. Translations, 29, 217, 10.1090/trans2/029/07 · doi:10.1090/trans2/029/07
- Kreisel, 1974, A notion of mechanistic theory, Synthese, 29, 11, 10.1007/BF00484949 · doi:10.1007/bf00484949
- Post, 1936, Finite combinatory processes. Formulation I, J. Symbolic Logic, 1, 103, 10.2307/2269031 · DOI · Paper page
- Pour-el, 1974, Abstract computability and its relation to the general purposes analog computer, Trans. Am. Math. Soc., 199, 1, 10.1090/S0002-9947-1974-0347575-8 · DOI · Paper page
- J.C. SHEPHERDSON [1975] Computation over abstract structures: serial and parallel procedures and Friedman's effective definitional schemes, in: Logic Colloquium ‘73, edited by H. E. Rose and J. C. Shepherdson (Amsterdam), pp. 445–513. · doi:10.1016/s0049-237x(08)71963-3
Cited by
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Sequential abstract-state machines capture sequential algorithms
Gurevich, Y. (2000) · ACM Transactions on Computational Logic · doi:10.1145/343369.343384 · Cited by 458
The Nature of Physical Computation
Shagrir, O. (2022) · doi:10.1093/oso/9780197552384.001.0001 · Cited by 70
Metadata
- Venue
- Studies in Logic and the Foundations of Mathematics
- Publisher
- Elsevier
- Published
- 1980
- Pages
- 123-148
- ISSN
- 0049-237X (ISSN-L)
- OpenAlex
- W1494994700
- Cited by
- 331
- References
- 1
- FWCI
- 2.43
- Type
- book chapter
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
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: Church's Thesis and Principles for Mechanisms. https://app.cochat.ai/papers/10.1016/s0049-237x(08)71257-6
- The paper
- Church's Thesis and Principles for Mechanisms. (1980). Studies in Logic and the Foundations of Mathematics. https://doi.org/10.1016/s0049-237x(08)71257-6
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.
