Constructive dimension equals Kolmogorov complexity

Information Processing Letters

Volumn 93, Issue 3, 2005, Pages 149-153

  Staiger, Ludwig ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Constructive dimension; Kolmogorov complexity; Levin's universal semi measure; Theory of computation

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FRACTALS; SET THEORY; THEOREM PROVING;

CONSTRUCTIVE DIMENSION; KOLMOGROV COMPLEXITY; LEVIN'S UNIVERSAL SEMI-MEASURE; THEORY OF COMPUTATION;

COMPUTATIONAL COMPLEXITY;

EID: 10444249657     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.09.023     Document Type: Article

References (20)

1. K.B. Athreya, J.M. Hitchcock, J.H. Lutz, E. Mayordomo, Effective strong dimension, algorithmic information, and computational complexity, in: Proc. 21st Symp. on Theoretical Aspects of Computer Science, Springer-Verlag, Berlin, 2004, pp. 632-643.
2. J. Cai, J. Hartmanis, On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line, J. Comput. Systems Sci. 49 (1994) 605-619.
3. G.A. Edgar, Integral, Probability, and Fractal Measures, Springer-Verlag, New York, 1998.
4. K. Falconer, Fractal Geometry, Wiley, New York, 1990.
5. J.M. Hitchcock, Gales suffice for constructive dimension, Inform. Process. Lett. 86 (2003) 9-12.
6. M. Li, P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, second ed., Springer-Verlag, Berlin, 1997.
7. J.H. Lutz, Dimension in complexity classes, SIAM J. Comput. 32 (2003) 1236-1250.
8. J.H. Lutz, Gales and the constructive dimension of individual sequences, in: Proc. 27th Internat. Colloquium on Automata, Languages, and Programming, Springer-Verlag, Heidelberg, 2000, pp. 902-913.
9. J.H. Lutz, The dimensions of individual strings and sequences, Inform, and Comput. 187 (2003) 49-79.
10. E. Mayordomo, A Kolmogorov complexity characterization of constructive Hausdorff dimension, Inform. Process. Lett. 84 (2002) 1-3.
11. J.C. Oxtoby, Measure and Category, Springer-Verlag, Berlin, 1971.
12. B.Ya. Ryabko, Coding of combinatorial sources and Hausdorff dimension, Soviet Math. Dokl. 30 (1) (1984) 219-222.
13. B.Ya. Ryabko, Noiseless coding of combinatorial sources, Probl. Inform. Transmission 22 (1986) 170-179.
14. B.Ya. Ryabko, The complexity and effectiveness of prediction problems, J. Complexity 10 (1994) 281-295.
15. L. Staiger, Kolmogorov complexity and Hausdorff dimension, Inform, and Comput. 103 (1993) 159-194.
16. L. Staiger, A tight upper bound on Kolmogorov complexity and uniformly optimal prediction, Theory Comput. Syst. 31 (1998) 215-229.
17. L. Staiger, The Kolmogorov complexity of real numbers, Theoret. Comput. Sci. 284 (2002) 455-466.
18. K. Tadaki, A generalization of Chaitin's halting probability Ω and halting self-similar sets, Hokkaido Math. J. 31 (2002) 219-253.
19. V.A. Uspensky, A. Shen, Relations between varieties of Kolmogorov complexities, Math. Systems Theory 29 (1996) 271-292.
20. A.K. Zvonkin, L.A. Levin, Complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms, Russian Math. Surv. 25 (1970) 83-124.