Effective strong dimension in algorithmic information and computational complexity

SIAM Journal on Computing

Volumn 37, Issue 3, 2007, Pages 671-705

  Athreya, Krishna B ^a   Hitchcock, John M ^b   Lutz, Jack H ^c   Mayordomo, Elvira ^d  

^a IOWA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF WYOMING   (United States)

^c Iowa State University   (United States)

^d UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

Computational complexity; Effective dimension; Hausdorff dimension; Kolmogorov complexity; Martin L f randomness; Packing dimension

Indexed keywords

(2+1) DIMENSIONS; (ALGORITHMIC) COMPLEXITY; BASIC PROPERTIES; BOOLEAN CIRCUITS; CAMBRIDGE; COMPLEXITY CONSTRAINTS; EFFECTIVE DIMENSIONS; FINITE STATES; FLORENCE , ITALY; FRACTAL GEOMETRY; GALE CHARACTERIZATION; GENERAL (CO); HAUSDORFF; HAUSDORFF DIMENSIONS; KOLMOGOROV COMPLEXITY (KC); PACKING DIMENSION; POLYNOMIAL TIME DEGREES; POLYNOMIAL-TIME; SIZE COMPLEXITY;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATA COMPRESSION; DYNAMICAL SYSTEMS; FRACTALS; INITIATORS (CHEMICAL); MATHEMATICAL TECHNIQUES; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SCHRODINGER EQUATION; SET THEORY;

FRACTAL DIMENSION;

EID: 34948824745     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703446912     Document Type: Article

References (49)

1. K. AMBOS-SPIES, W. MERKLE, J. REIMANN, AND F. STEPHAN, Hausdorff dimension in exponential time, in Proceedings of the 16th IEEE Conference on Computational Complexity, Chicago, IL, IEEE Computer Society Press, Piscataway, NJ, 2001, pp. 210-217.
2. K. AMBOS-SPIES, S. A. TERWIJN, AND X. ZHENG, Resource bounded randomness and weakly complete problems, Theoret. Comput. Sci., 172 (1997), pp. 195-207.
3. P. BILLINGSLEY, Probability and Measure, 3rd ed., John Wiley & Sons, New York, 1995.
4. J. M. BREUTZMANN AND J. H. LUTZ, Equivalence of measures of complexity classes, SIAM J. Comput., 29 (1999), pp. 302-326.
5. J. CAI AND J. HARTMANIS, On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line, J. Comput. Systems Sci., 49 (1994), pp. 605-619.
6. G. J. CHAITIN, A theory of program size formally identical to information theory, J. ACM, 22 (1975), pp. 329-340.
7. J. J. DAI, J. I. LATHROP, J. H. LUTZ, AND E. MAYORDOMO, Finite-state dimension, Theoret. Comput. Sci., 310 (2004), pp. 1-33.
8. K. FALCONER, Techniques in Fractal Geometry, John Wiley & Sons, New York, 1997.
9. K. FALCONER, Fractal Geometry: Mathematical Foundations and Applications, 2nd ed., John Wiley & Sons, New York, 2003.
10. S. A. FENNER, Gales and Supergales are Equivalent for Defining Constructive Hausdorff Dimension, Technical Report cs.CC/0208044, Computing Research Repository, Cornell University, Ithaca, NY, 2002.
11. L. FORTNOW AND J. H. LUTZ, Prediction and dimension, J. Comput. System Sci., 70 (2005), pp. 570-589.
12. F. HAUSDORFF, Dimension und äußeres Maß, Math. Ann., 79 (1919), pp. 157-179.
13. J. M. HITCHCOCK, MAX3SAT is exponentially hard to approximate if NP has positive dimension, Theoret. Comput. Sci., 289 (2002), pp. 861-869.
14. J. M. HITCHCOCK, Fractal dimension and logarithmic loss unpredictability, Theoret. Comput. Sci., 304 (2003), pp. 431-441.
15. J. M. HITCHCOCK, Gales suffice for constructive dimension, Inform. Process. Lett., 86 (2003), pp. 9-12.
16. J. M. HITCHCOCK, Correspondence principles for effective dimensions, Theory Comput. Systems, 38 (2005), pp. 559-571.
17. S. KAKUTANI, On the equivalence of infinite product measures, Ann. Math., 49 (1948), pp. 214-224.
18. P. LÉVY, Théorie de l'Addition des Variables Aleatoires, 2nd ed., Gauthier-Villars, Paris, 1954.
19. M. LI AND P. M. B. VITÁNYI, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed., Springer-Verlag, Berlin, 1997.
20. J. H. LUTZ, Almost everywhere high nonuniform complexity, J. Comput. System Sci., 44 (1992), pp. 220-258.
21. J. H. LUTZ, Resource-bounded measure, in Proceedings of the 13th IEEE Conference on Computational Complexity, Buffalo, NY, 1998, IEEE Computer Society Press, Piscataway, NJ, 1998, pp. 236-248.
22. J. LUTZ, Dimension in complexity classes, in Proceedings of the 15th IEEE Conference on Computational Complexity, Florence, Italy, 2000, IEEE Computer Society Press, Piscataway, NJ, 2000, pp. 158-169.
23. J. H. LUTZ, Dimension in complexity classes, SIAM J. Comput., 32 (2003), pp. 1236-1259.
24. J. H. LUTZ, The dimensions of individual strings and sequences, Inform. Comput., 187 (2003), pp. 49-79.
25. P. MARTIN-LÖF, The definition of random sequences, Information and Control, 9 (1966), pp. 602-619.
26. P. MATTILA AND R. MAULDIN, Measure and dimension functions: Measurability and densities, Math. Proc. Cambridge Philos. Soc., 121 (1997), pp. 81-100.
27. E. MAYORDOMO, A Kolmogorov complexity characterization of constructive Hausdorff dimension, Inform. Process. Lett., 84 (2002), pp. 1-3.
28. E. MAYORDOMO, Effective Hausdorff dimension, in Classical and New Paradigms of Computation and Their Complexity Hierarchies, Trends in Logic 23, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004, pp. 171-186.
29. B. YA, RYABKO, Coding of combinatorial sources and Hausdorff dimension, Soviet Math. Dokl., 30 (1984), pp. 219-222.
30. B. YA, RYABKO, Noiseless coding of combinatorial sources, Probl. Inform. Transm., 22 (1986), pp. 170-179.
31. B. YA, RYABKO, Algorithmic approach to the prediction problem, Probl. Inform. Transm., 29 (1993), pp. 186-193.
32. B. YA, RYABKO, The complexity and effectiveness of prediction problems, J. Complexity, 10 (1994), pp. 281-295.
33. C. P. SCHNORR, A unified approach to the definition of random sequences, Math. Systems Theory, 5 (1971), pp. 246-258.
34. C. P. SCHNORR, Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Math. 218, Springer-Verlag, New York, 1971.
35. C. P. SCHNORR, Process complexity and effective random tests, J. Comput. System Sci., 7 (1973), pp. 376-388.
36. C. P. SCHNORR, A survey of the theory of random sequences, in Basic Problems in Methodology and Linguistics, R. E. Butts and J. Hintikka, eds., D. Reidel, Boston, 1977, pp. 193-211.
37. C. E. SHANNON, A mathematical theory of communication, Bell System Tech. J., 27 (1948), pp. 379-423, 623-656.
38. L. STAIGER, Kolmogorov complexity and Hausdorff dimension, Inform. Comput., 103 (1993), pp. 159-194.
39. L. STAIGER, A tight upper bound on Kolmogorov complexity and uniformly optimal prediction, Theory Comput. Syst., 31 (1998), pp. 215-229.
40. L. STAIGER, How much can you win when your adversary is handicapped?, in Numbers, Information and Complexity, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000, pp. 403-412.
41. D. SULLIVAN, Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups, Acta Math., 153 (1984), pp. 259-277.
42. K. TADAKI, A generalization of Chaitin's halting probability Ω and halting self-similar sets, Hokkaido Math. J., 31 (2002), pp. 219-253.
43. C. TRICOT, Two definitions of fractional dimension, Math. Proc. Cambridge Philos. Soc., 91 (1982), pp. 57-74.
44. M. VAN LAMBALGEN, Random Sequences, Ph.D. thesis, Department of Mathematics, University of Amsterdam, Amsterdam, 1987.
45. M. VAN LAMBALGEN, Von Mises' definition of random sequences reconsidered, J. Symbolic Logic, 52 (1987), pp. 725 755.
46. J. VILLE, Étude Critique de la Notion de Collectif Gauthier-Villars, Paris, 1939.
47. V. G. VOVK, On a randomness criterion, Soviet Math. Dokl., 35 (1987), pp. 656-660.
48. J. ZIV, Coding theorems for individual sequences, IEEE Trans. Inform. Theory, 24 (1978), pp. 405-412.
49. J. ZIV AND A. LEMPEL, Compression of individual sequences via variable rate coding, IEEE Trans. Inform. Theory, 24 (1978), pp. 530-536.