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

320 Algorithmic information theory – G. J. Chaitin - 1977
333 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
1689 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
35 Information-theoretic computational complexity – Gregory J. Chaitin - 1974
53 Gödel's Theorem and Information – Gregory J. Chaitin - 1982
23 What is a computation – M Davis - 1978
532 Three approaches to the quantitative definition of information – A N Kolmogorov - 1965
73 Randomness and mathematical proof – G J Chaitin - 1975
14 Randomness and mathematical proof. Scientific American – Gregory J Chaitin - 1975
16 Algorithmic Entropy Of Sets – Gregory J. Chaitin, G. J. Chaitin - 1976
13 Algorithmic Information Theory – Michiel van Lambalgen, Michiel Van Lambalgen - 1989
9 LISP Program-Size Complexity – G. J. Chaitin - 1992
121 Information and Randomness. An Algorithmic Perspective – C S Calude - 2002
334 The Definition of Random Sequences – Per Martin-Löf - 1966
21 Impossibility: The limits of science and the science of limits – John Barrow - 1998
389 Über Formal Unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte für Mathematik und Physik – Kurt Gödel - 1931
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
35 Theories of Computational Complexity – C Calude - 1988