Randomness and reducibility

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 316-327

  Downey, Rod G ^a   Hirschfeldt, Denis R ^b   LaForte, Geoff ^c  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF CHICAGO   (United States)

^c UNIVERSITY OF WEST FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974660128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_28     Document Type: Conference Paper

References (37)

1. K. Ambos-Spies and A. Kučera, Randomness in computability theory, in P. A. Cholak, S. Lempp, M. Lerman, and R. A. Shore (eds.), Computability Theory and Its Applications (Boulder, CO, 1999), vol. 257 of Contemp. Math. (Amer. Math. Soc., Providence, RI, 2000) 1-14.
2. K. Ambos-Spies, K. Weihrauch, and X. Zheng, Weakly computable real numbers, J. Complexity 16 (2000) 676-690.
3. C. S. Calude, A characterization of c.e. random reals, to appear in Theoret. Comput. Sci.
4. C. S. Calude, Information and Randomness, an Algorithmic Perspective, Monographs in Theoretical Computer Science (Springer-Verlag, Berlin, 1994).
5. C. S. Calude and G. Chaitin, Randomness everywhere, Nature 400 (1999) 319-320.
6. C. S. Calude and R. J. Coles, Program-size complexity of initial segments and domination reducibility, in J. Karhumäki, H.Maurer, G. Păun, and G. Rozenberg (eds.), Jewels Are Forever (Springer-Verlag, Berlin, 1999) 225-237.
7. C. S. Calude, R. J. Coles, P. H. Hertling, and B. Khoussainov, Degree-theoretic aspects of computably enumerable reals, in S. B. Cooper and J. K. Truss (eds.), Models and Computability (Leeds, 1997), vol. 259 of London Math. Soc. Lecture Note Ser. (Cambridge Univ. Press, Cambridge, 1999) 23-39.
8. C. S. Calude, P. H. Hertling, B. Khoussainov, and Y. Wang, Recursively enumerable reals and Chaitin Ω numbers, Centre for Discrete Mathematics and Theoretical Computer Science Research Report Series 59, University of Auckland (October 1997), extended abstract in STACS 98, Lecture Notes in Comput. Sci. 1373, Springer, Berlin, 1998, 596-606.
9. C. S. Calude and A. Nies, Chaitin Ω numbers and strong reducibilities, J. Univ. Comp. Sci. 3 (1998) 1162-1166.
10. G. S. Ceĭtin, A pseudofundamental sequence that is not equivalent to a monotone one, Zap. Naučn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 20 (1971) 263-271, 290, in Russian with English summary.
11. G. J. Chaitin, A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22 (1975) 329-340
12. G. J. Chaitin, Algorithmic information theory, IBM J. Res. Develop. 21 (1977) 350-359, 496.
13. G. J. Chaitin, Incompleteness theorems for random reals, Adv. in Appl. Math. 8 (1987) 119-146
14. G. J. Chaitin, Information, Randomness & Incompleteness, vol. 8 of Series in Computer Science, 2nd ed. (World Scientific, River Edge, NJ, 1990)
15. R. Downey, D. R. Hirschfeldt, and A. Nies, Randomness, computability, and density, to appear in SIAM J. Comp. (extended abstract in A. Ferreira and H. Reichel (eds.), STACS 2001 Proceedings, Lecture Notes in Computer Science 2010 (Springer, 2001), 195-205)
16. R. Downey and G. LaForte, Presentations of computably enumerable reals, to appear in Theoret. Comput. Sci.
17. L. Fortnow, Kolmogorov complexity, to appear in R. G. Downey and D. R. Hirschfeldt (eds.), Aspects of Complexity, Minicourses in Algorithmics, Complexity, and Computational Algebra, NZMRI Mathematics Summer Meeting, Kaikoura, New Zealand, January 7-15, 2000.
18. C. Ho, Relatively recursive reals and real functions, Theoret. Comput. Sci. 210 (1999) 99-120.
19. K.-I. Ko, On the definition of some complexity classes of real numbers, Math. Systems Theory 16 (1983) 95-100.
20. K.-I. Ko, On the continued fraction representation of computable real numbers, Theoret. Comput. Sci. 47 (1986) 299-313.
21. A. N. Kolmogorov, Three approaches to the quantitative definition of information, Internat. J. Comput. Math. 2 (1968) 157-168.
22. A. Kučera and T. Slaman, Randomness and recursive enumerability, to appear in SIAM J. Comput.
23. A. H. Lachlan, Recursive real numbers, J. Symbolic Logic 28 (1963) 1-16.
24. L. Levin, On the notion of a random sequence, Soviet Math. Dokl. 14 (1973) 1413-1416.
25. L. Levin, The various measures of the complexity of finite objects (an axiomatic description), Soviet Math. Dokl. 17 (1976) 522-526.
26. M. Li and P. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, 2nd ed. (Springer-Verlag, New York, 1997).
27. P. Martin-Löf, The definition of random sequences, Inform. and Control 9 (1966) 602-619.
28. H. Rice, Recursive real numbers, Proc. Amer. Math. Soc. 5 (1954) 784-791.
29. C.-P. Schnorr, Process complexity and effective random tests, J. Comput. System Sci. 7 (1973) 376-388.
30. R. Soare, Cohesive sets and recursively enumerable Dedekind cuts, Pacific J. Math. 31 (1969) 215-231.
31. R. Soare, Recursion theory and Dedekind cuts, Trans. Amer. Math. Soc. 140 (1969) 271-294.
32. R. J. Solomonoff, A formal theory of inductive inference I, Inform. and Control 7 (1964) 1-22.
33. R. J. Solomonoff, A formal theory of inductive inference II, Inform. and Control 7 (1964) 224-254.
34. R. M. Solovay, Draft of a paper (or series of papers) on Chaitin’s work… done for the most part during the period of Sept.-Dec. 1974 (May 1975), unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 215 pages.
35. R. M. Solovay, On random r.e. sets, in A. Arruda, N. Da Costa, and R. Chuaqui (eds.), Non-Classical Logics, Model Theory, and Computability. Proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, July 11-17, 1976, vol. 89 of Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, 1977) 283-307.
36. M. van Lambalgen, Random Sequences, PhD Thesis, University of Amsterdam (1987).
37. D. Zambella, On sequences with simple initial segments, Tech. rep., Institute for Language, Logic and Information, University of Amsterdam (1990).