Skip to main content

The Dimension of a Point: Computability Meets Fractal Geometry

  • Conference paper
New Computational Paradigms (CiE 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3526))

Included in the following conference series:

  • 1117 Accesses

Abstract

Recent developments in the theory of computing give a canonical way of assigning a dimension to each point of n-dimensional Euclidean space. Computable points have dimension 0, random points have dimension n, and every real number in [0,n] is the dimension of uncountably many points. If X is a reasonably simple subset of n-dimensional Euclidean space (a union of computably closed sets), then the classical Hausdorff dimension of X is just the supremum of the dimensions of the points in X. In this talk I will discuss the meaning of these developments, their implications for both the theory of computing and fractal geometry, and directions for future research.

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

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

References

  1. Falconer, K.: The Geometry of Fractal Sets. Cambridge University Press, Cambridge (1985)

    Book  MATH  Google Scholar 

  2. Falconer, K.: Fractal Geometry: Mathematical Foundations and Applications. John Wiley & Sons, Chichester (1990)

    MATH  Google Scholar 

  3. Hitchcock, J.M.: Correspondence principles for effective dimensions. Theory of Computing Systems. In: Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, pp. 561–571 (2002) (to appear) (Preliminary version appeared)

    Google Scholar 

  4. Lutz, J.H.: Dimension in complexity classes. SIAM Journal on Computing 32, 1236–1259 (2003); Preliminary version appeared in Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, pp. 158–169 (2000)

    Google Scholar 

  5. Lutz, J.H.: The dimensions of individual strings and sequences. Information and Computation 187, 49–79 (2003)

    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

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lutz, J.H. (2005). The Dimension of a Point: Computability Meets Fractal Geometry. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_37

Download citation

  • DOI: https://doi.org/10.1007/11494645_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26179-7

  • Online ISBN: 978-3-540-32266-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics