Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)

DOI10.1016/j.apal.2010.09.007zbMath1267.68125OpenAlexW2963509449MaRDI QIDQ638490

Leonid A. Levin

Publication date: 12 September 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2010.09.007

zbMATH Keywords

entropyalgorithminformationKolmogorov complexityrandomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Information theory (general) (94A15) Axioms; other general questions in probability (60A05) Algorithmic randomness and dimension (03D32)

Related Items (3)

Gacs-Kucera theorem ⋮ Strict process machine complexity ⋮ Putnam's diagonal argument and the impossibility of a universal learning machine

Cites Work

• On the Length of Programs for Computing Finite Binary Sequences
• Logical basis for information theory and probability theory
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The definition of random sequences
• A formal theory of inductive inference. Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)