Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension

DOI10.1007/978-3-642-22953-4_22zbMath1342.68173MaRDI QIDQ3088288

Ludwig Staiger

Publication date: 19 August 2011

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22953-4_22

Mathematics Subject Classification ID

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

Related Items

Exact constructive and computable dimensions, Subcomputable Hausdorff function dimension, On Oscillation-Free Chaitin h-Random Sequences, A Correspondence Principle for Exact Constructive Dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive dimension equals Kolmogorov complexity
• Random closed sets viewed as random recursions
• The extent and density of sequences within the minimal-program complexity hierarchies
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
• A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
• The dimensions of individual strings and sequences
• Kolmogorov complexity and Hausdorff dimension
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• On partial randomness
• Exact Hausdorff dimension in random recursive constructions
• Algorithmic Randomness and Complexity
• The exact Hausdorff dimension in random recursive constructions
• Relations between varieties of kolmogorov complexities
• Refined Bounds on Kolmogorov Complexity for ω-Languages
• On Oscillation-free ε-random Sequences
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS