A Correspondence Principle for Exact Constructive Dimension

DOI10.1007/978-3-642-30870-3_69zbMath1358.68150OpenAlexW125840490MaRDI QIDQ2904465

Ludwig Staiger

Publication date: 14 August 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-30870-3_69

Mathematics Subject Classification ID

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

Related Items (2)

Exact constructive and computable dimensions ⋮ Subcomputable Hausdorff function dimension

Cites Work

• Correspondence principles for effective dimensions
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
• 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)
• Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension
• Algorithmic Randomness and Complexity
• The exact Hausdorff dimension in random recursive constructions
• Fractals, dimension, and formal languages
• Relations between varieties of kolmogorov complexities
• Refined Bounds on Kolmogorov Complexity for ω-Languages
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Correspondence Principle for Exact Constructive Dimension