Active Bibliography

UNIVERSALITY PROBABILITY OF A PREFIX-FREE MACHINE – George Barmpalias, David, L. Dowe
17 Relative to a random oracle, NP is not small – Steven M. Kautz, Peter Bro Miltersen - 1994
77 The Dimensions of Individual Strings and Sequences – Jack H. Lutz - 2003
2 On generalized computable universal priors and their convergence – Marcus Hutter
37 Degrees of random sets – Steven M. Kautz - 1991
3 Independence properties of algorithmically random sequences – Steven M. Kautz - 1994
3 Professionals Play Minimax – Ignacio Palacios-Huerta - 2003
1 Algorithmically Independent Sequences – Cristian S. Calude, Marius Zimand - 2008
67 Effective strong dimension in algorithmic information and computational complexity – Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo - 2004
20 Relativizing Chaitin’s halting probability – Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller, André Nies
5 Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences – Jack H. Lutz, David L. Schweizer - 1999
10 Recursive computational depth – James I. Lathrop, Jack H. Lutz - 1999
4 Algorithmic randomness of closed sets – George Barmpalias, Paul Brodhead, Rebecca Weber, et al. - 2007
Recursion and topology on . . . – Veronica Becher , Serge Grigorieff - 2004
11 Complexity and Randomness – Sebastiaan A. Terwijn - 2003
The Classes of Algorithmically Random Reals – Stephanie Reid - 2003
17 Discovering Problem Solutions with Low Kolmogorov Complexity and High Generalization Capability – Jürgen Schmidhuber - 1994
22 The discovery of algorithmic probability – Ray J. Solomonoff, Royal Holloway - 1997
4 Is Randomness "native" to Computer Science? – Marie Ferbus-Zanda, Serge Grigorieff - 2003