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.

Type

Journal article

Intellectual base

Primary research

Year

1965

Link

https://www.mathnet.ru/eng/ppi68

Cited from

information_theory, mathematics, philosophy

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).

• 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.)

• 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.)

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:181c95651082 · see in the full table