Three approaches to the quantitative definition of information.¶
Kolmogorov, A. N. (1965). Three approaches to the quantitative definition of information. Problems of Information Transmission, 1(1), 1-7.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Compression
- Compression clarifies that information has both a surface representation and an irreducible content (entropy)
This sourceDefines the algorithmic (descriptional) complexity of an individual object as the length of its shortest program — the incompressible 'irreducible content'. SUPPORTS marker 176 (information has an irreducible content / entropy). Link is the canonical Mathnet.ru record (parallel work: Solomonoff 1964, Chaitin 1969).
- Compression clarifies that information has both a surface representation and an irreducible content (entropy)
- Parsimony (Occam's Razor)
- based on Kolmogorov complexity
This source(Originating treatment of Kolmogorov complexity / algorithmic information theory; defines incompressibility-based randomness for individual sequences. Parallel independent work: Solomonoff 1964, Chaitin 1969.)
- based on Kolmogorov complexity
- Randomness
- 2. Outcome unpredictability: within a specified class of predictors, no pattern permits reliably guessing the next outcome better than baseline; the sequence is incompressible in the sense of Kolmogorov (1965)
This source(Originating treatment of Kolmogorov complexity / algorithmic information theory; defines incompressibility-based randomness for individual sequences. Parallel independent work: Solomonoff 1964, Chaitin 1969.)
- 2. Outcome unpredictability: within a specified class of predictors, no pattern permits reliably guessing the next outcome better than baseline; the sequence is incompressible in the sense of Kolmogorov (1965)
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 3 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:181c95651082 · see in the full table