Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-7479d7b7d-fwgfc Total loading time: 0 Render date: 2024-07-09T06:26:04.002Z Has data issue: false hasContentIssue false

Effective Hausdorff dimension

from ARTICLES

Published online by Cambridge University Press:  31 March 2017

By
Jan Reimann  and
Frank Stephan
Edited by
Matthias Baaz ,
Sy-David Friedman  and
Jan Krajíček
Matthias Baaz
Affiliation:
Technische Universität Wien, Austria
Sy-David Friedman
Affiliation:
Universität Wien, Austria
Jan Krajíček
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Get access

Summary

Abstract. We continue the study of effective Hausdorff dimension as it was initiated by Lutz. Whereas he uses a generalization of martingales on the Cantor space to introduce this notion we give a characterization in terms of effective s-dimensional Hausdorff measures, similar to the effectivization of Lebesgue measure by Martin-Löf. It turns out that effective Hausdorff dimension allows to classify sequences according to their ‘degree’ of algorithmic randomness, i.e., their algorithmic density of information. Earlier the works of Staiger and Ryabko showed a deep connection between Kolmogorov complexity and Hausdorff dimension. We further develop this relationship and use it to give effective versions of some important properties of (classical) Hausdorff dimension. Finally, we determine the effective dimension of some objects arising in the context of computability theory, such as degrees and spans.

§1. Introduction. Generally speaking, the concepts of Hausdorff measure and dimension are a generalization of Lebesgue measure theory. In the early 20th century, Hausdorff [9] used Caratheodory's construction of measures to define a whole family of outer measures. For examining a set of a peculiar topological or geometrical nature Lebesgue measure often is too coarse to investigate the features of the set, so one may ‘pick’ a measure from this family of outer measures that is suited to study this particular set. This is one reason why Hausdorff measure and dimension became a prominent tool in fractal geometry.

Hausdorff dimension is extensively studied in the context of dynamical systems, too. On the Cantor space, the space of all infinite binary sequences, the interplay between dimension and concepts from dynamical systems such as entropy becomes really close. Results of Besicovitch [3] and Eggleston [7] early brought forth a correspondence between the Hausdorff dimension of frequency sets (i.e., sets of sequences in which every symbol occurs with a certain frequency) and the entropy of a process creating such sequences as typical outcomes. Besides, under certain conditions the Hausdorff dimension of a set in the Cantor space equals the topological entropy of this set, viewed as a shift space.

Type
Chapter
Information
Logic Colloquium '01 , pp. 369 - 385
Publisher: Cambridge University Press
Print publication year: 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Klaus, Ambos-Spies, WolfgangMerkle, Jan, Reimann, and Frank, Stephan, Hausdorff dimension in exponential time, Proceedings of the Sixteenth Annual IEEE Conference on Computational Complexity, IEEE Computer Society, 2001, pp. 210–217.
[2] Richard, Beigel, Martin, Kummer, and Frank, Stephan, Quantifying the amount of verboseness, Information and Computation, vol. 118 (1995), no. 1, pp. 73–90.Google Scholar
[3] Abram S., Besicovitch, On the sumof digits of real numbers represented in the dyadic system, Mathematische Annalen, vol. 110 (1934), pp. 321–330.Google Scholar
[4] A. A., Brudno, Entropy and the complexity of the trajectories of a dynamical system, Transactions of the MoscowMathematical Society, vol. 1983 (1983), no. 2, pp. 127–151.Google Scholar
[5] Jin-Yi, Cai and Juris, Hartmanis, On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line, Journal of Computer and System Sciences, vol. 49 (1994), no. 3, pp. 605–619.
[6] Gerald A., Edgar, Measure, topology, and fractal geometry, Springer-Verlag, 1990.
[7] H. G., Eggleston, Sets of fractional dimensions which occur in some problems of number theory, Proceedings of the London Mathematical Society, II. Ser., vol. 54 (1951), pp. 42–93.Google Scholar
[8] Kenneth, Falconer, Fractal geometry, JohnWiley & Sons Ltd., 1990.
[9] Felix, Hausdorff, Dimension und äußeres Maß, Mathematische Annalen, vol. 79 (1919), pp. 157–179.Google Scholar
[10] Carl, Jockusch, Semirecursive sets and positive reducibility, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 420–436.Google Scholar
[11] MingLi and PaulVitànyi, An introduction toKolmogorov complexity and its applications, 2nd ed., Springer-Verlag, 1997.
[12] Jack H., Lutz, Dimension in complexity classes, Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, IEEE Computer Society, 2000, pp. 158–169.
[13] Jack H., Lutz, Gales and the constructive dimension of individual sequences, Proceedings of the Twenty-Seventh International Colloquium on Automata, Languages, and Programming (Ugo, Montanari, Josè D. P., Rolim, and EmoWelzl, editors), Springer-Verlag, 2000, pp. 902–913.
[14] Per, Martin-Löf, The definition of random sequences, Information and Control, vol. 9 (1967), pp. 602–619.Google Scholar
[15] Pertti, Mattila, Geometry of sets and measures in Euclidean spaces, Cambridge University Press, 1995.
[16] Elvira, Mayordomo, A Kolmogorov complexity characterization of constructiveHausdorff dimension, Technical Report TR01-059, Electronic Colloquium on Computational Complexity, 2001.
[17] Piergiorgio, Odifreddi, Classical Recursion Theory, North-Holland, 1989.
[18] C. A., Rogers, Hausdorff measures, Cambridge University Press, 1970.
[19] Boris Ya., Ryabko, The complexity and effectiveness of prediction algorithms, Journal of Complexity, vol. 10 (1994), no. 3, pp. 281–295.Google Scholar
[20] Ludwig, Staiger, Kolmogorov complexity andHausdorff dimension, Information andComputation, vol. 103 (1993), no. 2, pp. 159–194.Google Scholar
[21] Sebastiaan A., Terwijn, Computability and measure, Ph.D. thesis, Universiteit van Amsterdam, 1998.
[22] Homer S., White, Algorithmic complexity of points in dynamical systems, Ergodic Theory and Dynamical Systems, vol. 13 (1992), no. 4, pp. 807–830.Google Scholar
[23] Alexander K., Zvonkin and Leonid 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, vol. 25 (1970), no. 6, pp. 83–124.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×