Dimensions of Points in Self-Similar Fractals

DOI10.1137/070684689zbMath1187.68269WikidataQ60578970 ScholiaQ60578970MaRDI QIDQ3631903

Elvira Mayordomo, Jack H. Lutz

Publication date: 22 June 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.8395

zbMATH Keywords

Hausdorff dimension; iterated function system; packing dimension; computability; geometric measure theory; fractal geometry; constructive dimension; self-similar fractal; Billingsley dimension

Mathematics Subject Classification ID

11K55: Metric theory of other algorithms and expansions; measure and Hausdorff dimension

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

28A78: Hausdorff and packing measures

03D99: Computability and recursion theory

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Algorithmic Fractal Dimensions in Geometric Measure Theory, Dimension spectra of lines1, Fractal Intersections and Products via Algorithmic Dimension, ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY, Randomness and Effective Dimension of Continued Fractions., Projection theorems using effective dimension, Functions that preserve p-randomness, Dimension spectra of random subfractals of self-similar fractals, Random sequences with respect to a measure defined by two linear fractional transformations, A divergence formula for randomness and dimension, Mutual dimension and random sequences, Effective Hausdorff dimension in general metric spaces, Dimension spectra of lines, Bounding the dimension of points on a line, On continued fraction randomness and normality, Mutual Dimension, Lines missing every random point1, Who Asked Us? How the Theory of Computing Answers Questions about Analysis, A Divergence Formula for Randomness and Dimension