John M. Hitchcock
Jack H. Lutz
Abstract
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned a dimension dim(A) ∈ [0,1] and a strong dimension Dim(A) ∈ [0,1].
Let DIMα and DIMαstr be the classes of all sequences of dimension α and of strong dimension α, respectively. We show that DIM0 is properly Π02, and that for all Δ02-computable α ∈ (0, 1], DIMα is properly Π03.
To classify the strong dimension classes, we use a more powerful effective Borel hierarchy where a coenumerable predicate is used rather than an enumerable predicate in the definition of the Σ01 level. For all Δ02-computable α ∈ [0, 1), we show that DIMαstr is properly in the Π03 level of this hierarchy. We show that DIM1str is properly in the Π02 level of this hierarchy.
We also prove that the class of Schnorr random sequences and the class of computably random sequences are properly Π03.
- Ambos-Spies, K., Merkle, W., Reimann, J., and Stephan, F. 2001. Hausdorff dimension in exponential time. In Proceedings of the 16th IEEE Conference on Computational Complexity. 210--217. Google Scholar
Digital Library
- Athreya, K. B., Hitchcock, J. M., Lutz, J. H., and Mayordomo, E. 2004. Effective strong dimension in algorithmic information and computational complexity. In Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science. Springer Verlag. 632--643. To appear in SIAM J. Comput.Google Scholar
- Dai, J. J., Lathrop, J. I., Lutz, J. H., and Mayordomo, E. 2004. Finite-State dimension. Theor. Comput. Sci. 310, 1 3, 1--33. Google ScholarDigital Library
- Fenner, S. A. 2002. Gales and supergales are equivalent for defining constructive Hausdorff dimension. Tech. Rep. cs.CC/0208044, Computing Research Repository.Google Scholar
- Fortnow, L. and Lutz, J. H. 2005. Prediction and dimension. J. Comput. Syst. Sci. 70, 4, 570--589. Google ScholarDigital Library
- Hausdorff, F. 1919. Dimension und äußeres Maß. Mathematische Annalen 79, 157--179.Google ScholarCross Ref
- Hitchcock, J. M. 2002. MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theor. Comput. Sci. 289, 1, 861--869. Google ScholarDigital Library
- Hitchcock, J. M. 2003a. Fractal dimension and logarithmic loss unpredictability. Theor. Comput. Sci. 304, 1 3, 431--441. Google ScholarCross Ref
- Hitchcock, J. M. 2003b. Gales suffice for constructive dimension. Inf. Process. Lett. 86, 1, 9--12. Google ScholarDigital Library
- Jockusch, C. G. 1980. Degrees of generic sets. In Recursion Theory: Its Generalizations and Applications. London Mathematical Society Lecture Notes Series, vol. 45. Cambridge University Press, New York. 110--139.Google Scholar
- Kechris, A. S. 1994. Classical Descriptive Set Theory. Springer Verlag.Google Scholar
- Ki, H. and Linton, T. 1994. Normal numbers and subsets of N with given densities. Fundamenta Mathematicae 144, 163--179.Google Scholar
- Kreisel, G. 1950. Note on arithmetical models for consistent formulae of the predicate calculus. Fundam. Mathematicae 37, 265--285.Google ScholarCross Ref
- Li, M. and Vitányi, P. M. B. 1997. An Introduction to Kolmogorov Complexity and its Applications, 2nd ed Springer Verlag, Berlin. Google ScholarDigital Library
- Lutz, J. H. 2003a. Dimension in complexity classes. SIAM J. Comput. 32, 5, 1236--1259. Google ScholarDigital Library
- Lutz, J. H. 2003b. The dimensions of individual strings and sequences. Inf. Comput. 187, 1, 49--79. Google ScholarDigital Library
- Martin-Löf, P. 1966. The definition of random sequences. Inf. Control 9, 602--619.Google ScholarCross Ref
- Mayordomo, E. 2002. A Kolmogorov complexity characterization of constructive Hausdorff dimension. Inf. Process. Lett. 84, 1, 1--3. Google ScholarDigital Library
- Moschovakis, Y. N. 1980. Descriptive Set Theory. North-Holland, Amsterdam.Google Scholar
- Odifreddi, P. 1989. Classical recursion theory. In Studies in Logic and the Foundations of Mathematics, vol. 125. North-Holland.Google Scholar
- Rogers, Jr, H. 1967. Theory of Recursive Functions and Effective Computability. McGraw - Hill, New York. Google ScholarDigital Library
- Schnorr, C. P. 1971. Zufälligkeit und wahrscheinlichkeit. Lecture Not. Math. 218.Google Scholar
- Schnorr, C. P. 1977. A survey of the theory of random sequences. In Basic Problems in Methodology and Linguistics, R. E. Butts and J. Hintikka, Eds. D. Reidel. 193--211.Google Scholar
- Staiger, L. 1993. Recursive automata on infinite words. In Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science. Springer Verlag. 629--639. Google ScholarDigital Library
- Staiger, L. 2000. On the power of reading the whole infinite input tape. In Finite Versus Infinite: Contributions to an Eternal Dilemma, C. S. Calude and G. Paun, Eds. Springer Verlag. 335--348.Google Scholar
- Staiger, L. 2005. Constructive dimension equals Kolmogorov complexity. Inf. Process. Lett. 93, 3, 149--153. Google ScholarDigital Library
- Terwijn, S. A. 2004. Complexity and randomness. Rendiconti del Seminario Matematico di Torino 62, 1, 1--38.Google Scholar
- van Lambalgen, M. 1987. Random sequences. Ph.D. thesis, Department of Mathematics, University of Amsterdam.Google Scholar
- Ville, J. 1939. Étude Critique de la Notion de Collectif. Gauthier Villars, Paris.Google Scholar
- Wadge, W. W. 1972. Degrees of complexity of subsets of the Baire space. Not. Amer. Math. Soc. 19, 714--715.Google Scholar
- Wadge, W. W. 1983. Reducibility and determinateness on the Baire space. Ph.D. thesis, U. C. Berkeley.Google Scholar
- Wang, Y. 1996. Randomness and complexity. Ph.D. thesis, Department of Mathematics, University of Heidelberg.Google Scholar
Index Terms
- The arithmetical complexity of dimension and randomness
Recommendations
Arithmetic complexity via effective names for random sequences
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-Löf, computably, Schnorr, and Kurtz random ...
Effective Randomness for Computable Probability Measures
Any notion of effective randomness that is defined with respect to arbitrary computable probability measures canonically induces an equivalence relation on such measures for which two measures are considered equivalent if their respective classes of ...
A divergence formula for randomness and dimension
If S is an infinite sequence over a finite alphabet @S and @b is a probability measure on @S, then the dimension of S with respect to @b, written dim^@b(S), is a constructive version of Billingsley dimension that coincides with the (constructive ...
Comments