The Kolmogorov complexity of real numbers.
From MaRDI portal
Publication:1607299
Recommendations
- Publication:4934359
- Représentations des nombres réels par développements en base entière et complexité. (Representations of real numbers by expansions on integer basis and complexity)
- The Kolmogorov complexity of random reals
- On Kolmogorov complexity in the real Turing machine setting
- Kolmogorov Complexity Theory over the Reals
Cites work
- scientific article; zbMATH DE number 3941840 (Why is no real title available?)
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- scientific article; zbMATH DE number 1223737 (Why is no real title available?)
- scientific article; zbMATH DE number 736618 (Why is no real title available?)
- scientific article; zbMATH DE number 1418486 (Why is no real title available?)
- scientific article; zbMATH DE number 3344793 (Why is no real title available?)
- A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
- Are binary codings universal?
- Fractals, dimension, and formal languages
- Information, randomness and incompleteness. Papers on algorithmic information theory
- Kolmogorov complexity and Hausdorff dimension
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
- On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
- On a problem of Steinhaus about normal numbers
- On normal numbers
- Results and trends in theoretical computer science, Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994. Proceedings
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The extent and density of sequences within the minimal-program complexity hierarchies
Cited in
(13)- Constructive dimension equals Kolmogorov complexity
- The Kolmogorov complexity of random reals
- Is there a universal image generator?
- Kolmogorov complexity and set theoretical representations of integers
- Liouville, computable, Borel normal and Martin-Löf random numbers
- Randomness relative to Cantor expansions
- Normality and finite-state dimension of Liouville numbers
- On the Kolmogorov complexity of continuous real functions
- Bi-immunity over different size alphabets
- Irrationality exponent, Hausdorff dimension and effectivization
- Natural halting probabilities, partial randomness, and zeta functions
- scientific article; zbMATH DE number 1390092 (Why is no real title available?)
- Finite state incompressible infinite sequences
This page was built for publication: The Kolmogorov complexity of real numbers.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607299)
