Hierarchies Of Generalized Kolmogorov Complexities And Nonenumerable Universal Measures Computable In The Limit (2000)

Cached

Download Links

by Jürgen Schmidhuber
Venue:INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Citations:30 - 13 self

Active Bibliography

21 Algorithmic Theories Of Everything – Jürgen Schmidhuber - 2000
6 The New AI: General & Sound & Relevant for Physics – Jürgen Schmidhuber - 2003
39 Logical Depth and Physical Complexity – Charles H. Bennett - 1988
37 The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions – Jürgen Schmidhuber - 2002
77 The Dimensions of Individual Strings and Sequences – Jack H. Lutz - 2003
11 Gödel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements – Jürgen Schmidhuber - 2003
18 Lecture Notes on Descriptional Complexity and Randomness – Peter Gács
15 Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences – V.V. V'Yugin - 1999
17 Discovering Problem Solutions with Low Kolmogorov Complexity and High Generalization Capability – Jürgen Schmidhuber - 1994
41 Discovering Neural Nets With Low Kolmogorov Complexity And High Generalization Capability – Jürgen Schmidhuber - 1997
Simplicity, Information, Kolmogorov Complexity, and Prediction – Paul Vitányi, Ming Li - 1998
60 Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity – Paul Vitányi, Ming Li - 1998
9 On Prediction by Data Compression – Paul Vitányi, Ming Li - 1997
Recent Progress in the Fields of Universal Learning Algorithms and Optimal Search – Jürgen Schmidhuber
17 Relative to a random oracle, NP is not small – Steven M. Kautz, Peter Bro Miltersen - 1994
47 Optimal Ordered Problem Solver – Jürgen Schmidhuber - 2002
3 The Kolmogorov Complexity of Random Reals – Liang Yu, Decheng Ding, Nanjing Jiang Su, Rodney Downey - 2003
11 Complexity and Randomness – Sebastiaan A. Terwijn - 2003
4 Is Randomness "native" to Computer Science? – Marie Ferbus-Zanda, Serge Grigorieff - 2003