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

by Gregory J. Chaitin
Citations:329 - 16 self

Active Bibliography

320 Algorithmic information theory – G. J. Chaitin - 1977
21 Lecture Notes on Descriptional Complexity and Randomness – Peter Gács
45 Information-theoretic Limitations of Formal Systems – Gregory J. Chaitin - 1974
9 Inductive Inference Theory - A Unified Approach To Problems In Pattern Recognition And Artificial Intelligence – Ray J. Solomonoff - 1975
41 The discovery of algorithmic probability – Ray J. Solomonoff - 1997
6 Basic Elements and Problems of Probability Theory – Hans Primas - 1999
5 Does Algorithmic Probability Solve the Problem of Induction? – Ray Solomonoff - 2001
7 Relations between varieties of Kolmogorov complexity – V. A. Uspensky, A. Shen - 1996
Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence – Marcus Hutter - 2010
18 On the Difficulty of Computations – Gregory J. Chaitin - 1970
93 The Dimensions of Individual Strings and Sequences – Jack H. Lutz - 2003
12 Computational depth and reducibility – David W. Juedes, James I. Lathrop, Jack H. Lutz - 1994
1 Iterated limiting recursion and the program minimalization problem – L. K. Schubert - 1974
34 System Identification, Approximation and Complexity – Brian R. Gaines - 1977
3 Descriptive Complexity of Computable Sequences – Bruno Durand , Alexander Shen, Nikolai Vereshagin - 1998
© Birkhauser Verlag Basel, 1975 – Interdisziplinare Systemforschung, James Gips
On the history of martingales in the study of randomness – Laurent Bienvenu, et al. - 2009
On Natural Representations of Objects – Fouad B. Chedid
31 Algorithmic Theories Of Everything – Jürgen Schmidhuber - 2000