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

Association for Symbolic Logic: The Bulletin of Symbolic Logic (forthcoming)
  Copy   BIBTEX

Abstract

Review by: Jan Reimann The Bulletin of Symbolic Logic, Volume 19, Issue 3, Page 397-399, September 2013

Categories

Keywords

Reprint years

Links

PhilArchive



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

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

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.
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.
Reviewed Work(s): Finite and algorithmic model theory by Javier Esparza; Christian Michaux; Charles Steinhorn.Michael Benedikt - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Kolmogorov–Loveland randomness and stochasticity.Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann & Frank Stephan - 2006 - Annals of Pure and Applied Logic 138 (1):183-210.
Kolmogorov complexity and set theoretical representations of integers.Marie Ferbus-Zanda & Serge Grigorieff - 2006 - Mathematical Logic Quarterly 52 (4):375-403.
Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic.J. W. Addison - 2004 - Annals of Pure and Applied Logic 126 (1-3):77-92.
Information, learning and falsification.David Balduzzi - 2011
Non-Archimedean Probability.Vieri Benci, Leon Horsten & Sylvia Wenmackers - 2013 - Milan Journal of Mathematics 81 (1):121-151.
Probability Logic and Borel's Denumerable Probability.Theodore Hailperin - 2008 - History and Philosophy of Logic 29 (3):307-307.
Towards a stable definition of algorithmic randomness.Hector Zenil - unknown
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.

Analytics

Added to PP
2013-11-23

Downloads
33 (#473,861)

6 months
4 (#800,606)

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