Dimensions of Points in Self-similar Fractals

DOI10.1007/978-3-540-69733-6_22zbMath1148.68389MaRDI QIDQ3511330

Jack H. Lutz, Elvira Mayordomo

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

28A80: Fractals

Related Items

Connectivity Properties of Dimension Level Sets, Effective aspects of Hausdorff and Fourier dimension, Connectivity properties of dimension level sets, A characterization of constructive dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hausdorff dimension in probability theory. I, II
• Correspondence principles for effective dimensions
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
• Billingsley dimension in probability spaces
• Iterated function systems and control languages
• The dimensions of individual strings and sequences
• Is the Mandelbrot set computable?
• Computable functionals
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Constructing non-computable Julia sets
• The computational complexity of some julia sets
• Computability of Self-Similar Sets
• Dimensions and Measures of Quasi Self-Similar Sets
• Connectivity Properties of Dimension Level Sets
• Kolmogorov Complexity with Error
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability