On the computability of fractal dimensions and Hausdorff measure

Annals of Pure and Applied Logic 93 (1-3):195-216 (1998)
  Copy   BIBTEX

Abstract

It is shown that there exist subsets A and B of the real line which are recursively constructible such that A has a nonrecursive Hausdorff dimension and B has a recursive Hausdorff dimension but has a finite, nonrecursive Hausdorff measure. It is also shown that there exists a polynomial-time computable curve on the two-dimensional plane that has a nonrecursive Hausdorff dimension between 1 and 2. Computability of Julia sets of computable functions on the real line is investigated. It is shown that there exists a polynomial-time computable function f on the real line whose Julia set is not recurisvely approximable

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Fractal dimensions of K-automatic sets.Alexi Block Gorman & Chris Schulz - forthcoming - Journal of Symbolic Logic:1-30.
Effective fractal dimensions.Jack H. Lutz - 2005 - Mathematical Logic Quarterly 51 (1):62-72.
Effectively closed sets of measures and randomness.Jan Reimann - 2008 - Annals of Pure and Applied Logic 156 (1):170-182.
Projective Hausdorff gaps.Yurii Khomskii - 2014 - Archive for Mathematical Logic 53 (1-2):57-64.
Feasible graphs with standard universe.Douglas Cenzer & Jeffrey B. Remmel - 1998 - Annals of Pure and Applied Logic 94 (1-3):21-35.
Random closed sets viewed as random recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.
Hausdorff measure on o-minimal structures.A. Fornasiero & E. Vasquez Rifo - 2012 - Journal of Symbolic Logic 77 (2):631-648.
On p-reducibility of numerations.A. N. Degtev - 1993 - Annals of Pure and Applied Logic 63 (1):57-60.

Analytics

Added to PP
2014-01-16

Downloads
17 (#896,285)

6 months
5 (#710,385)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computability of measurable sets via effective topologies.Yongcheng Wu & Decheng Ding - 2006 - Archive for Mathematical Logic 45 (3):365-379.
Computable symbolic dynamics.Douglas Cenzer, S. Ali Dashti & Jonathan L. F. King - 2008 - Mathematical Logic Quarterly 54 (5):460-469.

Add more citations

References found in this work

No references found.

Add more references