Active Bibliography

93 The Dimensions of Individual Strings and Sequences – Jack H. Lutz - 2003
18 Relative to a random oracle, NP is not small – Steven M. Kautz, Peter Bro Miltersen - 1994
2 On generalized computable universal priors and their convergence – Marcus Hutter
Is Game Theory Real? – Player Player - 2011
46 Degrees of random sets – Steven M. Kautz - 1991
3 Independence properties of algorithmically random sequences – Steven M. Kautz - 1994
10 An Experimental Investigation of Unprofitable Games – John Morgan, Martin Sefton - 2002
2 Algorithmically Independent Sequences – Cristian S. Calude, Marius Zimand - 2008
79 Effective strong dimension in algorithmic information and computational complexity – Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo - 2004
21 Relativizing Chaitin’s halting probability – Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller, André Nies
1 EXACT PAIRS FOR THE IDEAL OF THE K-TRIVIAL SEQUENCES IN THE TURING DEGREES – George Barmpalias, Rod G. Downey - 2012
ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY – George Barmpalias
14 Professionals Play Minimax – Ignacio Palacios-Huerta - 2003
5 Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences – Jack H. Lutz, David L. Schweizer - 1999
UNIVERSALITY PROBABILITY OF A PREFIX-FREE MACHINE – George Barmpalias, David, L. Dowe
18 Recursive computational depth – James I. Lathrop, Jack H. Lutz - 1999
11 Algorithmic randomness of closed sets – George Barmpalias, Paul Brodhead, Rebecca Weber, et al. - 2007
11 Complexity and Randomness – Sebastiaan A. Terwijn - 2003
Recursion and topology on . . . – Veronica Becher , Serge Grigorieff - 2004