A Theory of Program Size Formally Identical to Information Theory (1975)

by Gregory J. Chaitin
Citations:274 - 16 self

Documents Related by Co-Citation

294 The definition of random sequences – P Martin-Löf
1412 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
133 Zufälligkeit und Wahrscheinlichkeit – C Schnorr - 1971
397 Three approaches to the quantitative definition of information – A N Kolmogorov - 1965
914 On computable numbers, with an application to the “Entscheidungsproblem – A Turing
72 On the symmetry of algorithmic information – P Gács - 1974
32 A formal theory of inductive inference – R J Solomono - 1964
316 A formal theory of inductive inference – R Solomonoff - 1964
91 On the notion of a random sequence – L A Levin - 1973
39 A variant of the Kolmogorov concept of complexity – D Loveland - 1969
72 Process complexity and effective random tests – C P Schnorr - 1973
411 Recursively Enumerable Sets and Degrees – Robert I Soare - 1987
64 Laws of information conservation (non-growth) and aspects of the foundations of probability theory – L A Levin - 1974
138 The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms – A. K. Zvonkin, L. A. Levin - 1970
19 Various measures of complexity for finite objects (axiomatic description – L Levin - 1976
54 Draft of a paper (or series of papers) on Chaitin’s work. Unpublished notes – R Solovay - 1975
32 Information-theoretic computational complexity – Gregory J. Chaitin - 1974
6517 Elements of information theory – T Cover, J Thomas - 1991
55 Information-Theoretic Characterizations of Recursive Infinite Strings – Gregory J. Chaitin - 1976