|
11
|
Complexity and Randomness
– Sebastiaan A. Terwijn
- 2003
|
|
10
|
Effective Fractal Dimensions
– Jack H. Lutz
|
|
25
|
Effective fractal dimension: foundations and applications
– John M. Hitchcock, Pavan Aduri, Clifford Bergman, Soumendra N. Lahiri, Giora Slutzki
- 2003
|
|
67
|
Effective strong dimension in algorithmic information and computational complexity
– Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
- 2004
|
|
3
|
Schnorr dimension
– Rodney Downey, Wolfgang Merkle, Jan Reimann
- 2001
|
|
4
|
Effective Fractal Dimension in Algorithmic Information Theory
– Elvira Mayordomo
- 2006
|
|
11
|
Computational depth and reducibility
– David W. Juedes, James I. Lathrop, Jack H. Lutz
- 1994
|
|
6
|
Scaled dimension and the Kolmogorov complexity of Turing-hard sets
– John M. Hitchcock, María López-valdés, Elvira Mayordomo
- 2004
|
|
6
|
The Arithmetical Complexity of Dimension and Randomness
– John M. Hitchcock, Jack H. Lutz, Sebastiaan A. Terwijn
- 2003
|
|
1
|
On Oscillation-free ε-random Sequences
– Ludwig Staiger
- 2008
|
|
10
|
Recursive computational depth
– James I. Lathrop, Jack H. Lutz
- 1999
|
|
14
|
Prediction and Dimension
– Lance Fortnow, Jack H. Lutz
- 2002
|
|
60
|
Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity
– Paul Vitányi, Ming Li
- 1998
|
|
33
|
Hausdorff dimension in exponential time
– Klaus Ambos-spies, Wolfgang Merkle, Jan Reimann, Frank Stephan
|
|
3
|
EXTRACTING INFORMATION IS HARD: A TURING DEGREE OF NON-INTEGRAL EFFECTIVE HAUSDORFF DIMENSION
– Joseph S. Miller
|
|
2
|
On generalized computable universal priors and their convergence
– Marcus Hutter
|
|
5
|
Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences
– Jack H. Lutz, David L. Schweizer
- 1999
|
|
32
|
Using random sets as oracles
– Denis R. Hirschfeldt, Frank Stephan, André Nies
|
|
17
|
Relative to a random oracle, NP is not small
– Steven M. Kautz, Peter Bro Miltersen
- 1994
|
