On Schnorr and computable randomness, martingales, and machines

Mathematical Logic Quarterly

Volumn 50, Issue 6, 2004, Pages 613-627

  Downey, Rod ^a   Griffiths, Evan ^a   Laforte, Geoffrey ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF WEST FLORIDA   (United States)

Author keywords

Kolmogorov complexity; Martingale; Schnorr randomness

Indexed keywords

EID: 8744266320     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.200310121     Document Type: Article

References (21)

1. K. Ambos-Spies and A. Kučera, Randomness in computability theory. In: Computability Theory: Current Trends and Open Problems (P. Cholak et al., eds.), Contemporary Mathematics 257 (2000), pp. 1-14 (American Math. Society, Reading (MA) 2000).
2. G. J. Chaitin, Algorithmic Information Theory (Cambridge University Press, Cambridge 1987).
3. R. G. Downey and E. Griffiths, Schnorr randomness. I. Symbolic Logic 69, 533-554 (2004).
4. R. Downey and D. Hirschfeldt, Algorithmic Randomness and Complexity (Springer-Verlag, Berlin et al., to appear).
5. R. Downey, D. Hirschfeldt, and G. LaForte, Randomness and reducibility. J. Computer and System Sciences 68, 96-114 (2004).
6. R. Downey, D. Hirschfeldt, and A. Nies, Randomness, computability, and density. SIAM J. Comput. 31, 1169-1183 (2002). An extended abstract appeared in: Symposium for Theoretical Aspects of Computer Science, STACS'01, January, 2001 (A. Ferriera and H. Reichel, eds.), Lecture Notes in Computer Science, pp. 195-201 (Springer-Verlag, Berlin et al. 2001).
7. R. Downey, D. Hirschfeldt, and A. Nies, Randomness, computability, and density. SIAM J. Comput. 31, 1169-1183 (2002). An extended abstract appeared in: Symposium for Theoretical Aspects of Computer Science, STACS'01, January, 2001 (A. Ferriera and H. Reichel, eds.), Lecture Notes in Computer Science, pp. 195-201 (Springer-Verlag, Berlin et al. 2001).
8. R. G. Downey, D. R. Hirschfeldt, A. Nies, and F. Stephan, Trivial reals. In: Electronic Notes in Theoretical Computer Science (ENTCS), 2002. The final version appears in Proceedings Asian Logic Conferences (R. G. Downey et al., eds.), pp. 103-131 (World Scientific, 2003).
9. R. G. Downey, D. R. Hirschfeldt, A. Nies, and S. Terwijn, Calibrating randomness. In preparation.
10. L. A. Levin, On the notion of a random sequence. Soviet Math. Dokl. 14, 1413-1416 (1973).
11. M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and its Applications (Springer-Verlag, Berlin et al. 1993).
12. A. Kučera and T. Slaman, Randomness and recursive enumerability. SIAM J. Comput. 31, 199-211 (2001).
13. A. Nies, Reals which compute little. To appear.
14. A. Nies, F. Stephan, and S. Terwijn, Randomness, relativization, and Turing degrees. In preparation.
15. C.-P. Schnorr, Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics 218 (Springer-Verlag, Berlin-Heidelberg 1971).
16. R. I. Soare, Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, Omega Series (Springer-Verlag, Berlin-Heidelberg-New York-Tokyo 1987).
17. R. Solovay, Draft of a paper (or series of papers) on Chaitin's work. Unpublished manuscript (IBM Thomas J. Watson Research Center, New York, May 1975, 215 pp.).
18. L. Staiger, The Kolmogorov complexity of real numbers. Theoretical Computer Science 284, 455-466 (2002)
19. S. A. Terwijn and D. Zambella, Computational randomness and lowness. J. Symbolic Logic 66, 1199-1205 (2001).
20. Y. Wang, Randomness and Complexity. PhD Diss., University of Heidelberg 1996.
21. A. K. Zvonkin and L. A. Levin, The complexity of finite objects and the development of concepts of information and randomness by the theory of algorithms. Russian Math. Surveys 25, 83-124 (1970).