The Kolmogorov complexity of real numbers.

DOI10.1016/S0304-3975(01)00102-5zbMath1042.68056MaRDI QIDQ1607299

Ludwig Staiger

Publication date: 31 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexityLiouville numbersbase expansiondisjunctive omega-wordsomega-words

Mathematics Subject Classification ID

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

Related Items (10)

Normality and finite-state dimension of Liouville numbers ⋮ Constructive dimension equals Kolmogorov complexity ⋮ Natural halting probabilities, partial randomness, and zeta functions ⋮ Is there a universal image generator? ⋮ Bi-immunity over different size alphabets ⋮ Irrationality exponent, Hausdorff dimension and effectivization ⋮ Randomness relative to Cantor expansions ⋮ Liouville, computable, Borel normal and Martin-Löf random numbers ⋮ On the Kolmogorov Complexity of Continuous Real Functions ⋮ Finite state incompressible infinite sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On normal numbers
• Are binary codings universal?
• The extent and density of sequences within the minimal-program complexity hierarchies
• Results and trends in theoretical computer science, Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994. Proceedings
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
• Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
• Kolmogorov complexity and Hausdorff dimension
• On a problem of Steinhaus about normal numbers
• Fractals, dimension, and formal languages
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

This page was built for publication: The Kolmogorov complexity of real numbers.