Schnorr randomness

Journal of Symbolic Logic

Volumn 69, Issue 2, 2004, Pages 533-554

  Downey, Rodney G ^a   Griffiths, Evan J ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2942657717     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1082418542     Document Type: Article

References (21)

1. K. AMBOS-SPIES and A. KUČERA, Randomness in computability theory, Computabitity theory and its applications (Cholak, Lempp, Lerman, and Shore, editors), Contemporary Mathematics, vol. 257, American Mathematical Society, 2000, pp. 1-14.
2. K. AMBOS-SPIES and E. MAYORDOMO, Resource bounded measure and randomness, Complexity, logic and recursion theory (A. Sorbi, editor), Marcel-Decker, New York, 1997, pp. 1-48.
3. G. CHAITIN, A theory of program size formally identical to information theory, Journal of the ACM, vol. 22 (1975), pp. 329-340.
4. R. DOWNEY, E. GRIFFITHS, and G. LAFORTE, On Schnorr and computable randomness, martingales, and machines, Mathematical Logic Quarterly, to appear.
5. R. DOWNEY, D. HIRSCHFELDT, A. NIES, and F. STEPHAN, Trivial reals, extended abstract in Computability and Complexity in Analysis, Malaga, Electronic Notes in Theoretical Computer Science, and proceedings, edited by Brattka, Schröder, Weihrauch, FernUniversität Hagen, 294-6/2002, pp. 37-55, July, 2002. Final version appears in Proceedings of the 7th and 8th Asian Logic Conferences (Rod Downey, Ding Decheng, Tung Shi Ping, Qiu Yu Hui, Mariko Yasugi, and Wu Guohua, editors) World Scientific, 2003, pp. 103-131.
6. R. DOWNEY, D. HIRSCHFELDT, A. NIES, and F. STEPHAN, Trivial reals, extended abstract in Computability and Complexity in Analysis, Malaga, Electronic Notes in Theoretical Computer Science, and proceedings, edited by Brattka, Schröder, Weihrauch, FernUniversität Hagen, 294-6/2002, pp. 37-55, July, 2002. Final version appears in Proceedings of the 7th and 8th Asian Logic Conferences (Rod Downey, Ding Decheng, Tung Shi Ping, Qiu Yu Hui, Mariko Yasugi, and Wu Guohua, editors) World Scientific, 2003, pp. 103-131.
7. A. N. KOLMOGOROV, Three approaches to the quantitative definition of information, Problems of Information Transmission (Problemy Peredachi Informatsii), vol. 1 (1965), pp. 1-7.
8. 0-classes and complete extensions of PA, Recursion theory week (H.-D. Ebbinghaus, G. H. Müller, and G. E. Sacks, editors), Lecture Notes in Mathematics, vol. 1141, Springer-Verlag, Berlin, Heidelberg, New York, 1985, pp. 245-259.
9. A. KUČERA and T. SLAMAN, Randomness and recursive enumerability, SIAM Journal on Computing, vol. 31 (2001), pp. 199-211.
10. M. VAN LAMBALGEN, Random sequences, Ph.D. thesis, University of Amsterdam, 1987.
11. L. LEVIN, Measures of complexity of finite objects (axiomatic description), Soviet Mathematics Doklady, vol. 17 (1976), pp. 522-526.
12. M. Li and P. VITANYI, An introduction to Kolmogorov complexity and its applications, 2nd ed., Springer-Verlag, New York, 1997.
13. J. H. LUTZ, Almost everywhere high nonuniform complexity, Journal of Computer and System Sciences, vol. 44 (1992), pp. 220-258.
14. P. MARTIN-LÖF, The definition of random sequences, Information and Control, vol. 9 (1966), pp. 602-619.
15. A. NIES, Lowness properties and randomness, to appear.
16. C. P. SCHNORR, Zufalligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, vol. 218, Springer-Verlag, Berlin, New York, 1971.
17. _, Process complexity and effective random tests, Journal of Computer and System Sciences, vol. 7 (1973), pp. 376-388.
18. R. SOLOMONOF, A formal theory of inductive inference, Part I, Information and Control, vol. 7 (1964), pp. 1-22.
19. R. SOLOVAY, Draft of paper (or series of papers) on Chaitin's work, Unpublished, 215 pages, May 1975.
20. A. TERWIJN and D. ZAMBELLA, Computational randomness and lowness, this JOURNAL, vol. 66 (2001), pp. 1199-1205.
21. Y. WANG, Randomness and complexity, Ph.D. thesis, University of Heidelberg, 1996.