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 [Book Review]

Bulletin of Symbolic Logic 19 (3):397-399 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600010714

Links

PhilArchive



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

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,.
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.
Some theorems on the algorithmic approach to probability theory and information theory:(1971 dissertation directed by AN Kolmogorov).Leonid A. Levin - 2010 - Annals of Pure and Applied Logic 162 (3):224-235.
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.
Tabular degrees in \Ga-recursion theory.Colin Bailey & Rod Downey - 1992 - Annals of Pure and Applied Logic 55 (3):205-236.
Two splitting theorems for beta-recursion theory.Steven Homer - 1980 - Annals of Mathematical Logic 18 (2):137.
The metamathematics of random graphs.John T. Baldwin - 2006 - Annals of Pure and Applied Logic 143 (1-3):20-28.
The incompleteness theorems after 70 years.Henryk Kotlarski - 2004 - Annals of Pure and Applied Logic 126 (1-3):125-138.
The application of algorithmic information theory to noisy patterned strings.Sean Devine - 2006 - Complexity 12 (2):52-58.
A theory of hyperfinite sets.P. V. Andreev & E. I. Gordon - 2006 - Annals of Pure and Applied Logic 143 (1-3):3-19.
Game arguments in computability theory and algorithmic information theory.Alexander Shen - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 655--666.
CUMMINGS, J., Possible behaviours for the Mitchell ordering DOUGHERTY, R., Critical points in an algebra of elementary embeddings DOWNEY, R. and STOB, M., Splitting theorems in recursion theory. [REVIEW]J. Vaananen - 1993 - Annals of Pure and Applied Logic 65:307.
An axiomatic approach to rank in model theory.J. T. Baldwin - 1974 - Annals of Mathematical Logic 7 (2-3):295-324.
A categorical approach to the theory of computation.Philip S. Mulry - 1989 - Annals of Pure and Applied Logic 43 (3):293-305.
Extended use of IST.I. P. Van den Berg - 1992 - Annals of Pure and Applied Logic 58 (1):73-92.

Analytics

Added to PP
2019-04-25

Downloads
7 (#1,356,784)

6 months
5 (#629,136)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references