The Dimensions of Individual Strings and Sequences (2003)

Cached

Download Links

by Jack H. Lutz
Venue:INFORMATION AND COMPUTATION
Citations:93 - 10 self

Active Bibliography

12 Computational depth and reducibility – David W. Juedes, James I. Lathrop, Jack H. Lutz - 1994
11 Complexity and Randomness – Sebastiaan A. Terwijn - 2003
67 Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity – Paul Vitányi, Ming Li - 1998
18 Recursive computational depth – James I. Lathrop, Jack H. Lutz - 1999
21 Lecture Notes on Descriptional Complexity and Randomness – Peter Gács
27 Effective fractal dimension: foundations and applications – John M. Hitchcock, Pavan Aduri, Clifford Bergman, Soumendra N. Lahiri, Giora Slutzki - 2003
320 Algorithmic information theory – G. J. Chaitin - 1977
7 Effective Fractal Dimension in Algorithmic Information Theory – Elvira Mayordomo - 2006
41 The discovery of algorithmic probability – Ray J. Solomonoff - 1997
2 On generalized computable universal priors and their convergence – Marcus Hutter
Turing and Randomness – Rod Downey
On the history of martingales in the study of randomness – Laurent Bienvenu, et al. - 2009
7 Relations between varieties of Kolmogorov complexity – V. A. Uspensky, A. Shen - 1996
The Classes of Algorithmically Random Reals – Stephanie Reid - 2003
50 Discovering Neural Nets With Low Kolmogorov Complexity And High Generalization Capability – Jürgen Schmidhuber - 1997
16 Discovering Problem Solutions with Low Kolmogorov Complexity and High Generalization Capability – Jürgen Schmidhuber - 1994
17 Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences – V.V. V'Yugin - 1999
31 Algorithmic Theories Of Everything – Jürgen Schmidhuber - 2000
16 Effective Fractal Dimensions – Jack H. Lutz