Effective fractal dimensions

Mathematical Logic Quarterly

Volumn 51, Issue 1, 2005, Pages 62-72

  Lutz, Jack H ^a  

^a Iowa State University   (United States)

Author keywords

Algorithmic information; Circuit size complexity; Computational complexity; Constructive dimension; Entropy; Gales; Hausdorff dimension; Kolmogorov complexity; Martingales; Packing dimension; Polynomial time degrees; Random sequences; Resource bounded dimension

Indexed keywords

EID: 11944273760     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.200310127     Document Type: Article

References (66)

1. K. Ambos-Spies and E. Mayordomo, Resource-bounded measure and randomness. In: Complexity, Logic and Recursion Theory (A. Sorbi, ed.), pp. l-47, Lecture Notes in Pure and Applied Mathematics (Marcel Dekker, New York 1997).
2. K. Ambos-Spies, W. Merkle, J. Reimann, and F. Stephan, Hausdorff dimension in exponential time. Proceedings of the 16th IEEE Conference on Computational Complexity, pp. 210-217 (2001).
3. K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo, Effective strong dimension, algorithmic information, and computational complexity. Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science, pp. 632-643 (Springer-Verlag, New York et al. 2004)
4. R. Beigel, L. Fortnow, and F. Stephan, Infinitely-often autoreducible sets. Proceedings of the 14th Annual International Symposium on Algorithms and Computation, pp. 98-107 (2003).
5. H. Buhrman and L. Torenvliet, Complete sets and structure in subrecursive classes. In: Proceedings of Logic Colloquium '96, Lecture Notes in Logic 12, 45-78 (1998).
6. H. Buhrman, D. van Melkebeek, K. W. Regan, D. Sivakumar, and M. Strauss, A generalization of resource-bounded measure, with application to the BPP vs. EXP Problem. SIAM J. Computing 30, 576-601 (2001).
7. J. Cai and J. Hartmanis, On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. J. Computer and Systems Sciences 49, 605-619 (1994).
8. G. J. Chaitin, A theory of program size formally identical to information theory. J. ACM 22, 329-340 (1975).
9. G. J. Chaitin, Incompleteness theorems for random reals. Advances in Applied Mathematics 8, 119-146 (1987).
10. J. J. Dai, J. I. Lathrop, J. H. Lutz, and E. Mayordomo, Finite-state dimension. Theoret. Comp. Sci. 310, 1-33 (2004).
11. T. Ebert, Applications of recursive operators to randomness and complexity. PhD thesis, University of California at Santa Barbara 1998.
12. T. Ebert, W. Merkle, and H. Vollmer, On the autoreducibility of random sequences. SIAM J. Computing 32, 1542-1569 (2003).
13. G. A. Edgar, Measure, Topology, and Fractal Geometry (Springer-Verlag, New York et al. 1990).
14. K. Falconer, Fractal Geometry: Mathematical Foundations and Applications (John Wiley & Sons, New York 1990).
15. S. A. Fenner, Gales and supergales are equivalent for defining constructive Hausdorff dimension. Technical Report cs.CC/0208044, Computing Research Repository 2002.
16. L. Fortnow and J. H. Lutz, Prediction and dimension. J. of Computer and System Sciences (to appear). A preliminary version appeared in: Proceedings of the 15th Annual Conference on Computational Learning Theory, pp. 380-395 (2002).
17. F. Hausdorff, Dimension und äusseres Maß. Math. Annalen 79, 157-179 (1919).
18. J. M. Hitchcock, Effective Fractal Dimension Bibliography. Available under http://www.cs.uwyo.edu/~jhitchco/bib/dim.html (current July, 2003).
19. J. M. Hitchcock, Resource-Bounded Measure Bibliography. Available under http://www.cs.uwyo.edu/~jhitchco/bib/rbm.html (current July, 2003).
20. J. M. Hitchcock, Correspondence principles for effective dimensions. Theory of Computing Systems (to appear). A preliminary version appeared in: Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, p. 561-571 (2002).
21. J. M. Hitchcock, MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theoret. Comput. Sci. 289, 861-869 (2002).
22. J. M. Hitchcock, Fractal dimension and logarithmic loss unpredictability. Theoret. Comp. Sci. 304, 431-441 (2003).
23. J. M. Hitchcock, Gales suffice for constructive dimension. Information Processing Letters 86, 9-12 (2003).
24. J. M. Hitchcock, Small spans in scaled dimension. In: Proceedings of the 19th IEEE Conference on Computational Complexity 2004.
25. J. M. Hitchcock, J. H. Lutz, and E. Mayordomo, Scaled dimension and nonuniform complexity. J. Computer and System Sciences (to appear). A preliminary version appeared in: Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, pp. 278-290 (2003).
26. J. M. Hitchcock, J. H. Lutz, and S. A. Terwijn, The arithmetical complexity of dimension and randomness. Proceedings of the 12th Annual Conference of the European Association for Computer Science Logic, pp. 241-254 (SpringerVerlag, New York et al. 2003).
27. D. W. Jucdes and J. H. Lutz, The complexity and distribution of hard problems. SIAM J. Computing 24, 279-295 (1995).
28. L. A. Levin, On the notion of a random sequence. Soviet Mathematics Doklady 14, 1413-1416 (1973).
29. L. A. Levin, Laws of information conservation (nongrowth) and aspects of the foundation of probability theory. Problems of Information Transmission 10, 206-210 (1974).
30. P. Lévy, Théorie de l' Addition des Variables Aleatoires (Gauthier-Villars, Paris 1937 - second edition 1954).
31. M. Li and P. M. B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications (Springer-Verlag, Berlin et al. 1997).
32. J. H. Lutz, Almost everywhere high nonuniform complexity. J. Computer and System Sciences 44, 220-258 (1992).
33. J. H. Lutz, The quantitative structure of exponential time. In: Complexity Theory Retrospective II (L. A. Hemaspaandra and A. L. Selman, eds.), pp. 225-254 (Springer-Verlag, New York et al. 1997).
34. J. H. Lutz, Resource-bounded measure. Proceedings of the 13th IEEE Conference on Computational Complexity, 236-248 (1998).
35. J. H. Lutz, Gales and the constructive dimension of individual sequences. Proceedings of the 27th International Colloquium on Automata, Languages, and Programming, 902-913 (2000). Revised as [37].
36. J. H. Lutz, Dimension in complexity classes. SIAM J. Computing 32, 1236-1259 (2003). A preliminary version appeared in: Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, 158-169 (2000).
37. J. H. Lutz, Dimension in complexity classes. SIAM J. Computing 32, 1236-1259 (2003). A preliminary version appeared in: Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, 158-169 (2000).
38. J. H. Lutz, The dimensions of individual strings and sequences. Information and Computation 187, 49-79 (2003).
39. J. H. Lutz and E. Mayordomo, Twelve problems in resource-bounded measure. Bulletin of the European Association for Theoretical Computer Science 68, 64-80 (1999).
40. P. Martin-Löf, The definition of random sequences. Information and Control 9, 602-619 (1966).
41. P. Mattila and R. Mauldin, Measure and dimension functions: measurability and densities. Mathematical Proceedings of the Cambridge Philosophical Society 121, 81-100 (1997).
42. E. Mayordomo, Effective Hausdorff dimension. Proceedings of Foundations of the Formal Sciences III, pp. 171-186 (Kluwer Academic Press).
43. E. Mayordomo, A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters 84, 1-3 (2002).
44. C. A. Rogers, Hausdorff Measures (Cambridge University Press, Cambridge 1998).
45. B. Ya. Ryabko, Coding of combinatorial sources and Hausdorff dimension. Soviet Mathematics Doklady 30, 219-222 (1984).
46. B. Ya. Ryabko, Noiseless coding of combinatorial sources. Problems of Information Transmission 22, 170-179 (1986).
47. B. Ya. Ryabko, Algorithmic approach to the prediction problem. Problems of Information Transmission 29, 186-193 (1993).
48. B. Ya. Ryabko, The complexity and effectiveness of prediction problems. Journal of Complexity 10, 281-295 (1994).
49. C. P. Schnorr, A unified approach to the definition of random sequences. Mathematical Systems Theory 5, 246-258 (1971).
50. C. P. Schnorr, Zufälligkeit und Wahrscheinlichkeit (Springer-Verlag, Berlin et al. 1971).
51. C. P. Schnorr, Process complexity and effective random tests. J. Computer and System Sciences 7, 376-388 (1973).
52. 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.), pp. 193-210 (D. Reidel, Dordrecht 1977).
53. C. E. Shannon, The synthesis of two-terminal switching circuits. Bell System Technical J. 28, 59-98 (1949).
54. A. Kh. Shen', The frequency approach to the definition of a random sequence. Semiotika i Informatika 18, 14-42 (1982). (In Russian.)
55. A. Kh. Shen', On relations between different algorithmic definitions of randomness. Soviet Mathematics Doklady 38, 316-319 (1989).
56. R. M. Solovay 1975. Reported in [9].
57. L. Staiger, Kolmogorov Complexity and Hausdorff Dimension. Information and Computation 103, 159-194 (1993).
58. L. Staiger, A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems 31, 215-229 (1998).
59. L. Staiger, How much can you win when your adversary is handicapped. In: Numbers, Information and Complexity, pp. 403-412 (Kluwer Academic Press, 2000).
60. L. Staiger, Constructive dimension equals Kolmogorov complexity. Technical Report CDMTCS-210, University of Auckland, January 2003.
61. D. Sullivan, Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups. Acta Mathematica 153, 259-277 (1984).
62. K. Tadaki, A generalization of Chaitin's halting probability Ω and halting self-similar sets. Hokkaido Mathematical Journal 31, 219-253 (2002).
63. S. A. Terwijn, Complexity and randomness. Technical Report CDMTCS-212, University of Auckland, March 2003.
64. C. Tricot, Two definitions of fractional dimension. Mathematical Proceedings of the Cambridge Philosophical Society 91, 57-74 (1982).
65. J. Ville, Étude Critique de la Notion de Collectif (Gauthier-Villars, Paris 1939).
66. A. K. Zvonkin and L. A. Levin, The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys 25, 83-124 (1970).