The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Algorithmic Information Theory
Abstract
This paper reviews algorithmic information theory, which is an attempt to apply information-theoretic and probabilistic ideas to recursive function theory. Typical concerns in this approach are, for example, the number of bits of information required to specify an algorithm, or the probability that a program whose bits are chosen by coin flipping produces a given output. During the past few years the definitions of algorithmic information theory have been reformulated. The basic features of the new formalism are presented here and certain results of R. M. Solovay are reported.
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
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
Chaitin, G. J. (1969) · Journal of the ACM · doi:10.1145/321526.321530 · Cited by 99
Self-citation
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
Universality and complexity in cellular automata
Wolfram, S. (1984) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(84)90245-8 · Cited by 1,914
Complexity as thermodynamic depth
Lloyd, S., & Pagels, H. (1988) · Annals of Physics · doi:10.1016/0003-4916(88)90094-2 · Cited by 517
Niche Construction Theory: A Practical Guide for Ecologists
Odling-Smee, J., Erwin, D. H., Palkovacs, E. P., Feldman, M. W., & Laland, K. N. (2013) · The Quarterly Review of Biology · doi:10.1086/669266 · Cited by 466
Probabilistic Incremental Program Evolution
Salustowicz, R., & Schmidhuber, J. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.2.123 · Cited by 249
Metadata
- Authors
- Chaitin, G. J.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1977-07
- Volume
- 21
- Issue
- 4
- Pages
- 350-359
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W2567782165
- Cited by
- 982
- References
- 2
- FWCI
- 2.94
- 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: Algorithmic Information Theory. https://app.cochat.ai/papers/10.1147/rd.214.0350
- The paper
- Chaitin, G. J. (1977). Algorithmic Information Theory. IBM Journal of Research and Development. https://doi.org/10.1147/rd.214.0350
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.
