INFORMATION-THEORETIC COMPUTATIONAL COMPLEXITY
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
This paper attempts to describe, in nontechnical language, some of the concepts and methods of one school of thought regarding computational complexity. It applies the viewpoint of information theory to computers. This will first lead us to a definition of the degree of randomness of individual binary strings, and then to an information-theoretic version of Gödel's theorem on the limitations of the axiomatic method. Finally, we will examine in the light of these ideas the scientific method and von Neumann's views on the basic conceptual problems of biology. This field's fundamental concept is the complexity of a binary string, that is, a string of bits, of zeros and ones. The complexity of a binary string is the minimum quantity of information needed to define the string. For example, the string of length n consisting entirely of ones is of complexity approximately log 2 n, because only log 2 n bits of information are required to specify n in binary notation. However, this is rather vague. Exactly what is meant by the definition of a string? To make this idea precise a computer is used. One says that a string defines another when the first string gives instructions for constructing the second string. In other words, one string defines another when it is a
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Selforganization of matter and the evolution of biological macromolecules
Eigen, M. (1971) · Die Naturwissenschaften · doi:10.1007/bf00623322 · Cited by 3,788
Cited by
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-citationOrganizations as Adaptive Systems in Complex Environments: The Case of China
Boisot, M., & Child, J. (1999) · Organization Science · doi:10.1287/orsc.10.3.237 · Cited by 605
On the capabilities of multilayer perceptrons
Baum, E. B. (1988) · Journal of Complexity · doi:10.1016/0885-064x(88)90020-9 · Cited by 379
“The question of whether a given algorithm is the shortest representing a given function is in principle undecidable (Kholmogorov 1965; Chaitin, 1974), so that one typically chooses some heuristic for finding a relatively terse algorithmic description The appropriate shape net for learning from…”
BackgroundUntangling Brain-Wide Dynamics in Consciousness by Cross-Embedding
Tajima, S., Yanagawa, T., Fujii, N., & Toyoizumi, T. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004537 · Cited by 76
“We compared the present complexitymeasure to the five other related measures (Materials and Methods): (i) correlation dimension [29], (ii) dimensionality derived from principle component analysis (PCA), (iii) permutation entropy [30,31], (iv) algorithmic (KolmogorovChaitin) complexity [32,33], and (v) the optimal embe…”
Method
Metadata
- Authors
- Chaitin, G. J.
- Venue
- Information, Randomness & Incompleteness
- Publisher
- WORLD SCIENTIFIC
- Published
- 1987-12
- Pages
- 23-32
- OpenAlex
- W2159415349
- Cited by
- 117
- References
- 1
- FWCI
- 6.21
- Type
- book chapter
- 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: INFORMATION-THEORETIC COMPUTATIONAL COMPLEXITY. https://app.cochat.ai/papers/10.1142/9789814434058_0003
- The paper
- Chaitin, G. J. (1987). INFORMATION-THEORETIC COMPUTATIONAL COMPLEXITY. Information, Randomness & Incompleteness. https://doi.org/10.1142/9789814434058_0003
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.