(Enter summary)
Abstract: This document has been prepared using the L a T
E
X system. We thank
Donald Knuth for T E X, Leslie Lamport for L a T
E
X, and Jan van der Steen
at CWI for online help. Some figures were prepared by John Tromp using
the xpic program.
The London Mathematical Society kindly gave permission to reproduce
a long extract by A.M. Turing. The Indian Statistical Institute, through
the editor of Sankhy¯a, kindly gave permission to quote A.N. Kolmogorov.
We gratefully acknowledge the financial support by... (Update)
Cited by: More
On Sample Complexity for Computational - Classification Problems Daniil
(Correct)
Model Selection and the Principle of Minimum Description Length - Hansen, Yu (1998)
(Correct)
Embracing Statistical Challenges in the Information Technology Age - Yu
(Correct)
Similar documents based on text: More All
0.3: Logical operations and Kolmogorov complexity II - Muchnik, Vereshchagin
(Correct)
0.1: The Boltzmann Entropy and Randomness Tests - Gacs (1994)
(Correct)
0.1: Occam's Razor and Macro Management - Siebenmann (1995)
(Correct)
Related documents from co-citation: More All
20: Three approaches to the quantitative definition of information (context) - Kolmogorov - 1965
18: the length of programs for computing finite binary sequences
- Chaitin - 1966
16: A formal theory of inductive inference (context) - Solomonoff - 1964
BibTeX entry: (Update)
M. Li and P.M.B. Vitanyi. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, New York, second edition, 1997. http://citeseer.ist.psu.edu/li97introduction.html More
@book{ ming93introduction,
author = "Li, Ming and Vitanyi, Paul M. B.",
title = "An Introduction to Kolmogorov Complexity and Its Applications",
publisher = "Springer-Verlag",
address = "Berlin",
year = "1993",
url = "citeseer.ist.psu.edu/li97introduction.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cwi.nl/~paulv/kolmogorov.html):
The Discovery Of Algorithmic Probability - Solomonoff (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC