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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,394

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,.
L. A. Levin. 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 (2010), pp. 224–235. [REVIEW]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.
Tabular degrees in \Ga-recursion theory.Colin Bailey & Rod Downey - 1992 - Annals of Pure and Applied Logic 55 (3):205-236.
The incompleteness theorems after 70 years.Henryk Kotlarski - 2004 - Annals of Pure and Applied Logic 126 (1-3):125-138.
Kolmogorov complexity and computably enumerable sets.George Barmpalias & Angsheng Li - 2013 - Annals of Pure and Applied Logic 164 (12):1187-1200.
A categorical approach to the theory of computation.Philip S. Mulry - 1989 - Annals of Pure and Applied Logic 43 (3):293-305.
A bialgebraic approach to automata and formal language theory.James Worthington - 2012 - Annals of Pure and Applied Logic 163 (7):745-762.
Algorithmic correspondence and canonicity for distributive modal logic.Willem Conradie & Alessandra Palmigiano - 2012 - Annals of Pure and Applied Logic 163 (3):338-376.

Analytics

Added to PP
2013-12-18

Downloads
29 (#775,805)

6 months
5 (#1,042,355)

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.
Randomness, computation and mathematics.Rod Downey - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 162--181.
Strict process machine complexity.Ferit Toska - 2014 - Archive for Mathematical Logic 53 (5-6):525-538.

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