Information-theoretic Limitations of Formal Systems (1974)

by Gregory J. Chaitin
Venue:JOURNAL OF THE ACM
Citations:45 - 7 self

Documents Related by Co-Citation

319 Algorithmic information theory – G. J. Chaitin - 1977
329 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
35 Information-theoretic computational complexity – Gregory J. Chaitin - 1974
71 Randomness and mathematical proof – G J Chaitin - 1975
51 Gödel's Theorem and Information – Gregory J. Chaitin - 1982
521 Three approaches to the quantitive definition of information – A Kolmogorov - 1965
1678 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
403 A formal theory of inductive inference – R Solomonoff - 1964
14 Randomness and mathematical proof. Scientific American – Gregory J Chaitin - 1975
16 Algorithmic Entropy Of Sets – Gregory J. Chaitin, G. J. Chaitin - 1976
120 Information and Randomness: An Algorithmic Perspective – Cristian S Calude - 2002
23 What is a computation – M Davis - 1978
4 Mathematical Logic for Computer Scientists – M Levin - 1974
26 Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin – T M Cover - 1974
332 The definition of random sequences – P Martin-Löf - 1966
89 Logical basis for information theory and probability theory – Andrei N Kolmogorov - 1968
218 The Feynmann Lectures on Physics – R P Feynman - 1964
22 Computational complexity and probability construction – D Willis
44 A variant of the kolmogorov concept of complexity – Donald W Loveland - 1969