Skip to main content

Correspondence Principles for Effective Dimensions

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2380))

Included in the following conference series:

Abstract

We show that the classical Hausdorff and constructive dimensions of any union of Π 01 -definable sets of binary sequences are equal. If the union is effective, that is, the set of sequences is Σ 02 -definable, then the computable dimension also equals the Hausdorff dimension. This second result is implicit in the work of Staiger (1998).

Staiger also proved related results using entropy rates of decidable languages. We show that Staiger’s computable entropy rate provides an equivalent definition of computable dimension. We also prove that a constructive version of Staiger’s entropy rate coincides with constructive dimension.

This research was supported in part by National Science Foundation Grant 9988483.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. H. Lutz. Dimension in complexity classes. In Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, pages 158–169. IEEE Computer Society Press, 2000.

    Google Scholar 

  2. J. H. Lutz. Information and computation seminar. Iowa State University, 2000. Unpublished lectures.

    Google Scholar 

  3. J. H. Lutz. The dimensions of individual strings and sequences. Technical Report cs.CC/0203016, ACM Computing Research Repository, 2002.

    Google Scholar 

  4. C. A. Rogers. Hausdorff Measures. Cambridge University Press, 1998. Originally published in 1970.

    Google Scholar 

  5. L. Staiger. Kolmogorov complexity and Hausdorff dimension. Information and Control, 103:159–94, 1993.

    MATH  MathSciNet  Google Scholar 

  6. L. Staiger. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems, 31:215–29, 1998.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hitchcock, J.M. (2002). Correspondence Principles for Effective Dimensions. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43864-9

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics