The Kolmogorov complexity of real numbers
- 28 July 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 284 (2) , 455-466
- https://doi.org/10.1016/s0304-3975(01)00102-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal PredictionTheory of Computing Systems, 1998
- Are binary codings universal?Complexity, 1996
- On hausdorff and topological dimensions of the kolmogorov complexity of the real lineJournal of Computer and System Sciences, 1994
- Fractals, dimension, and formal languagesRAIRO - Theoretical Informatics and Applications, 1994
- Kolmogorov Complexity and Hausdorff DimensionInformation and Computation, 1993
- The extent and density of sequences within the minimal-program complexity hierarchiesJournal of Computer and System Sciences, 1974
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMSRussian Mathematical Surveys, 1970
- On normal numbersPacific Journal of Mathematics, 1960
- On a problem of Steinhaus about normal numbersColloquium Mathematicum, 1959