The DOI matches its Crossref record.
Randomness and Mathematical Proof
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
Cited by
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006
Algorithmic Information Theory
Chaitin, G. J. (1977) · IBM Journal of Research and Development · doi:10.1147/rd.214.0350 · Cited by 982
Self-citationA Theory of Program Size Formally Identical to Information Theory
Chaitin, G. J. (1975) · Journal of the ACM · doi:10.1145/321892.321894 · Cited by 849
Self-citationQuasi-Monte Carlo methods and pseudo-random numbers
Niederreiter, H. (1978) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1978-14532-7 · Cited by 806
Approximate Entropy and Sample Entropy: A Comprehensive Tutorial
Delgado-Bonal, A., & Marshak, A. (2019) · Entropy · doi:10.3390/e21060541 · Cited by 660
Metadata
- Authors
- Chaitin, G. J.
- Venue
- Scientific American
- Published
- 1975-05
- Volume
- 232
- Issue
- 5
- Pages
- 47-52
- ISSN
- 0036-8733 (ISSN-L)
- OpenAlex
- W2033651947
- Cited by
- 656
- References
- 0
- FWCI
- 16.37
- 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: Randomness and Mathematical Proof. https://app.cochat.ai/papers/10.1038/scientificamerican0575-47
- The paper
- Chaitin, G. J. (1975). Randomness and Mathematical Proof. Scientific American. https://doi.org/10.1038/scientificamerican0575-47
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.