The Kolmogorov complexity of real numbers

Theoretical Computer Science

Volumn 284, Issue 2, 2002, Pages 455-466

  Staiger, Ludwig ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

words; Base r expansion; Disjunctive words; Kolmogorov complexity; Liouville numbers

Indexed keywords

FUNCTIONS; NUMBER THEORY; RANDOM PROCESSES;

REAL NUMBERS;

COMPUTATIONAL COMPLEXITY;

EID: 0037189796     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00102-5     Document Type: Article

References (20)

1. On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
2. Are binary codings universal?
3. Randomness as an invariant for number representations
4. On a problem of Steinhaus about normal numbers
5. The extent and density of sequences within the minimal-program complexity hierarchies
6. Disjunctive ω-words and real numbers
7. Randomness spaces
8. Some structural properties of ω-languages
9. Fractals, dimension, and formal languages
10. Noiseless coding of combinatorial sources, Hausdorff dimension and Kolmogorov complexity
11. On normal numbers
12. Kolmogorov complexity and Hausdorff dimension
13. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
14. The degrees of discontinuity of some translators between representations of the real numbers
15. Complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms