Some theorems on the algorithmic approach to probability theory and information theory:(1971 dissertation directed by AN Kolmogorov)

Annals of Pure and Applied Logic 162 (3):224-235 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2010.09.007

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Reviewed Work(s): Some theorems on the algorithmic approach to probability theory and information theory (1971 Dissertation directed by A. N. Kolmogorov). Annals of Pure and Applied Logic, vol. 162 by L. A. Levin. [REVIEW]Review by: Jan Reimann - 2013 - Bulletin of Symbolic Logic 19 (3):397-399,.
Reviewed Work(s): Some theorems on the algorithmic approach to probability theory and information theory (1971 Dissertation directed by A. N. Kolmogorov). Annals of Pure and Applied Logic, vol. 162 by L. A. Levin. [REVIEW]Jan Reimann - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Referee’s report on Leonid Levin’s dissertation “Some Theorems on the Algorithmic Approach to Probability Theory and Information Theory”. [REVIEW]N. A. Shanin - 2010 - Annals of Pure and Applied Logic 162 (3):236.
Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers.Peter D. Grünwald & Paul M. B. Vitányi - 2003 - Journal of Logic, Language and Information 12 (4):497-529.
Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.
Non-Archimedean Probability.Vieri Benci, Leon Horsten & Sylvia Wenmackers - 2013 - Milan Journal of Mathematics 81 (1):121-151.
Towards a stable definition of algorithmic randomness.Hector Zenil - unknown
Kolmogorov complexity and set theoretical representations of integers.Marie Ferbus-Zanda & Serge Grigorieff - 2006 - Mathematical Logic Quarterly 52 (4):375-403.
Information, learning and falsification.David Balduzzi - 2011
Bridging Conceptual Gaps: The Kolmogorov-Sinai Entropy.Massimiliano Badino - forthcoming - Isonomía. Revista de Teoría y Filosofía Del Derecho.
On the Kolmogorov-Chaitin complexity for short sequences.Hector Zenil - unknown
An algorithmic information theory challenge to intelligent design.Sean Devine - 2014 - Zygon 49 (1):42-65.
The application of algorithmic information theory to noisy patterned strings.Sean Devine - 2006 - Complexity 12 (2):52-58.
Axioms for Non-Archimedean Probability (NAP).Vieri Benci, Leon Horsten & Sylvia Wenmackers - 2012 - In De Vuyst J. & Demey L. (eds.), Future Directions for Logic; Proceedings of PhDs in Logic III - Vol. 2 of IfColog Proceedings. College Publications.

Analytics

Added to PP
2013-12-18

Downloads
18 (#785,610)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Randomness? What Randomness?Klaas Landsman - 2020 - Foundations of Physics 50 (2):61-104.
Strict process machine complexity.Ferit Toska - 2014 - Archive for Mathematical Logic 53 (5-6):525-538.
Randomness, computation and mathematics.Rod Downey - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 162--181.

Add more citations

References found in this work

Computability by Probabilistic Machines.K. de Leeuw, E. F. Moore, C. E. Shannon & N. Shapiro - 1970 - Journal of Symbolic Logic 35 (3):481-482.

Add more references