Randomness and recursive enumerability

SIAM Journal on Computing

Volumn 31, Issue 1, 2001, Pages 199-211

  Kučera, Antonín ^a   Slaman, Theodore A ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Chaitin; Kolmogorov; Random real; number

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

RANDOM NUMBERS;

NUMBER THEORY;

EID: 0036214633     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799357441     Document Type: Article

References (19)

1. C. CALUDE, Information and Randomness. An Algorithmic Perspective, Springer-Verlag, Berlin, 1994.
2. C. S. CALUDE, P. H. HERTLING, B. KHOUSSAINOV, AND Y. WANG, Recursively enumerable reals and Chaitin Ω numbers, in Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS 98), Springer, Berlin, 1998, pp. 596-606.
3. G. J. CHAITIN, A theory of program size formally identical to information theory, J. Assoc. Comput. Mach., 22 (1975), pp. 329-340.
4. G. J. CHAITIN, Algorithmic information theory, IBM J. Res. Develop., 21 (1977), pp. 350-359, 496. Reprinted in [5].
5. G. J. CHAITIN, Information, Randomness, and Incompleteness. Papers on Algorithmic Information Theory, 2nd ed., World Scientific, River Edge, NJ, 1990.
6. O. DEMUTH, On constructive pseudonumbers, Comment. Math. Univ. Carolin., 16 (1975), pp. 315-331 (in Russian).
7. O. DEMUTH, On some classes of arithmetical real numbers, Comment. Math. Univ. Carolin., 23 (1982), pp. 453-465 (in Russian).
8. O. DEMUTH, Reducibilities of sets based on constructive functions of a real variable, Comment. Math. Univ. Carolin., 29 (1988), pp. 143-156.
9. O. DEMUTH, Remarks on the structure of tt-degrees based on constructive measure theory, Comment. Math. Univ. Carolin., 29 (1988), pp. 233-247.
10. O. DEMUTH, Remarks on Denjoy sets, in Proceedings of the Summer School Conference Dedication of the 90th Anniversary of Heyting, Plenum Press, New York, 1990, pp. 267-280.
11. A. N. KOLMOGOROV, Three approaches to the definition of the concept "quantity of information," Problemy Peredači Informacii, 1 (1965), pp. 3-11.
12. L. A. LEVIN, Laws of information conservation (non-growth) and aspects of the foundation of probability theory, Problems Inform. Transmission, 10 (1974), pp. 206-210.
13. M. LI AND P. VITANYI, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed., Springer-Verlag, New York, 1997.
14. P. MARTIN-LÖF, The definition of random sequences, Information and Control, 9 (1966), pp. 602-619.
15. C.-P. SCHNORR, Process complexity and effective random tests, J. Comput. System Sci., 7 (1973), pp. 376-388.
16. R. J. SOLOMONOFF, A formal theory of inductive inference. I, Information and Control, 7 (1964), pp. 1-22.
17. R. J. SOLOMONOFF, A formal theory of inductive inference. II, Information and Control, 7 (1964), pp. 224-254.
18. R. M. SOLOVAY, Draft of a Paper (or Series of Papers) on Chaitin's Work ... , manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974, p. 215.
19. R. M. SOLOVAY, private communication, 1999.