The Kolmogorov complexity of random reals

Annals of Pure and Applied Logic

Volumn 129, Issue 1-3, 2004, Pages 163-180

  Yu, Liang ^a   Ding, Decheng ^b   Downey, Rodney ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b NANJING UNIVERSITY   (China)

Author keywords

Kolmogorov complexity; Prefix free; Randomness; Reducibility

Indexed keywords

EID: 3543088028     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2004.01.006     Document Type: Article

References (25)

1. C. Calude, P. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin's Ω number, in: STACS'98, Lecture Notes in Computer Science, vol. 1373, Springer, Berlin, 1998, 596-606
2. Chaitin G.J. A theory of program size formally identical to information theory J. Assoc. Comput. Mach. 22 1975 329-340
3. Chaitin G.J. Incompleteness theorems for random reals Adv. in Appl. Math. 8 1987 119-146
4. Chaitin G.J. Algorithmic Information Theory 1987 Cambridge University Press Cambridge
5. R.G. Downey, Some computability-theoretical aspects of reals and randomness, in: P. Cholak (Ed.), Lecture Notes in Logic, to appear.
6. R.G. Downey, D. Hirschfeldt, Algorithmic Randomness and Complexity, Monographs in Computer Science, Springer, Berlin, in preparation.
7. R. Downey, D. Hirschfeldt, G. Laforte, Randomness and reducibility, J. Comput. Systems Sci. 68 (2004) 96-114
8. Extended abstract appeared in: J. Sgall, A. Pultr, P. Kolman (Eds.), Mathematical Foundations of Computer Science, 2001, Lecture Notes in Computer Science, vol. 2136, Springer, Berlin, 2001, 316-327
9. R.G. Downey, D.R. Hirschfeldt, A. Nies, F. Stephan, Trivial reals, in: Downey, et al. (Eds.), Proc. of the 7th and 8th Asian Logic Conf., World Scientific, Singapore, 2003, 103-132.
10. Kejia Ho, Kolmogorov complexity, strong reducibilities, and computably enumerable sets, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 2000.
11. S. Kautz, Degrees of random sets, Ph.D. Dissertation, Cornell University, 1991.
12. A.N. Kolmogorov, Three approaches to the quantitative definition of information, Problems of Information Transmission (Problemy Peredachi Informatsii) 1 (1965) 1-7.
13. Kucera A. Slaman T.A. Randomness and recursive enumerability SIAM J. Comput. 31 2001 199-211
14. S. Kurtz, Randomness and genericity in the degrees of unsolvability, Ph.D. Dissertation, University of Illinois, Urbana, 1981.
15. Levin L.A. On the notion of a random sequence Soviet Math. Dokl. 14 1973 1413-1416
16. Martin-Löf P. The definition of random sequences Inform. and Control 9 1966 602-619
17. Li Ming Vitanyi P. Kolmogorov Complexity and its Applications 1993 Springer Heidelberg
18. C.P. Schnorr, Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, vol. 218, Springer, New York, 1971.
19. Soare R.I. Recursively Enumerable Sets and Degrees 1987 Springer Heidelberg
20. Solomonoff R. A formal theory of inductive inference, part 1 and part 2 Inform. and Control 7 1964 224-254
21. R.M. Solovay, Draft of paper (or series of papers) on Chaitin's work, unpublished notes, May, 1975, 215
22. M. van Lambalgen, Random sequences, Ph.D. Dissertation, University of Amsterdam, 1987.
23. von Mises R. Grundlagen der Wahrscheinlichkeitsrechnung Math. Z. 5 1919 52-99
24. Yu Liang, Ding Decheng, The initial segment complexity of random reals, Proc. Amer. Math. Soc., to appear.
25. Zvonkin A.K. Levin L.A. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms Russian Math. Surveys 25 6 1970 83-124