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.007zbMATH Open1267.68125OpenAlexW2963509449MaRDI QIDQ638490FDOQ638490
Authors: 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
Recommendations
Information theory (general) (94A15) Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Axioms; other general questions in probability (60A05)
Cites Work
- Title not available (Why is that?)
- A formal theory of inductive inference. Part I
- 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
- On the Length of Programs for Computing Finite Binary Sequences
- Logical basis for information theory and probability theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
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)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638490)
