The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On Non-Computable Functions
Abstract
The construction of non-computable functions used in this paper is based on the principle that a finite, non-empty set of non-negative integers has a largest element. Also, this principle is used only for sets which are exceptionally well-defined by current standards. No enumeration of computable functions is used, and in this sense the diagonal process is not employed. Thus, it appears that an apparently self-evident principle, of constant use in every area of mathematics, yields non-constructive entities.
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
Introduction to Metamathematics
Rasiowa, H. (1952) · Medical Entomology and Zoology · Cited by 4,307
Cited by
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
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
The program-size complexity of self-assembled squares (extended abstract)
Rothemund, P. W. K., & Winfree, E. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335358 · Cited by 407
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Undecidability of the spectral gap
Cubitt, T. S., Perez-Garcia, D., & Wolf, M. M. (2015) · Nature · doi:10.1038/nature16059 · Cited by 262
Metadata
- Authors
- Rado, T.
- Venue
- Bell System Technical Journal
- Published
- 1962-05
- Volume
- 41
- Issue
- 3
- Pages
- 877-884
- ISSN
- 0005-8580 (ISSN-L)
- OpenAlex
- W2044633287
- Cited by
- 297
- References
- 1
- FWCI
- 1.24
- 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: On Non-Computable Functions. https://app.cochat.ai/papers/10.1002/j.1538-7305.1962.tb00480.x
- The paper
- Rado, T. (1962). On Non-Computable Functions. Bell System Technical Journal. https://doi.org/10.1002/j.1538-7305.1962.tb00480.x
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.