Feasible reductions to Kolmogorov-Loveland stochastic sequences

Theoretical Computer Science

Volumn 225, Issue 1-2, 1999, Pages 185-194

  Lutz, Jack H ^a   Schweizer, David L ^b  

^a Iowa State University   (United States)

^b Federal Service for Surveillance on Consumer Rights Protection and Human Well Being   (United States)

Author keywords

Algorithmically random sequences; Foundations of randomness; Kolmogorov Loveland stochasticity; Polynomial time reductions

Indexed keywords

EID: 0008961734     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00041-9     Document Type: Article

References (32)

1. C.H. Bennett, Logical Depth and Physical Complexity, in: R. Herken (Ed.), The Universal Turing Machine: A Half-Century Survey, Oxford University Press, Oxford, 1988, pp. 227-257.
2. R.V. Book, On languages reducible to algorithmically random languages, SIAM J. Comput. 23 (1994) 1275-1282.
3. R.V. Book, J.H. Lutz, K.W. Wagner, An observation on probability versus randomness with applications to complexity classes, Math. Systems Theory 27 (1994) 201-209.
4. R.V. Book, H. Vollmer, K.W. Wagner, On type-2 probabilistic quantifiers, in: Proc. 23rd Internat. Coll. Automata, Languages, and Programming, Springer, Berlin, 1996, pp. 369-380.
5. J.M. Breutzmann, J.H. Lutz, Equivalence of measures of complexity classes, SIAM J. Comput., to appear.
6. G.J. Chaitin, A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22 (1975) 329-340.
7. G.J. Chaitin, Algorithmic Information Theory, Cambridge University Press, New York, 1987.
8. G.J. Chaitin, Incompleteness theorems for random reals, Adv. Appl. Math. 8 (1987) 119-146.
9. A. Church, On the concept of a random sequence, Bull. Amer. Math. Soc. 46 (1940) 130-135.
10. P. Gács, Every sequence is reducible to a random one, Inform. Control 70 (1986) 186-192.
11. T. Hagerup, C. Rüb, A guided tour of Chernoff bounds, Inform. Processing Lett. 33 (1990) 305-308.
12. D.W. Juedes, J.I. Lathrop, J.H. Lutz, Computational depth and reducibility, Theoret. Comp. Sci. 132 (1994) 37-70.
13. A.N. Kolmogorov, On tables of random numbers, Sankhyā, Ser. A 25 (1963) 369-376.
14. A.N. Kolmogorov, Combinatorial foundations of information theory and calculus of probabilities, Russian Math. Surveys 38 (1983) 29-40.
15. A.N. Kolmogorov, V.A. Uspenskii, Algorithms and randomness, translated in Theory Probab. Appl. 32 (1987) 389-412.
16. 1-classes, and complete extensions of PA, in: Recursion Theory Week, vol. 1141 of Lecture Notes in Mathematics, Springer, Berlin, 1985, pp. 245-259.
17. L.A. Levin, On the notion of a random sequence, Sov. Math. Doklady 14 (1973) 1413-1416.
18. M. Li, P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Springer, Berlin, 1993.
19. D.W. Loveland, The Kleene hierarchy classification of recursively random sequences, Trans. Amer. Math. Soc. 125 (1966) 497-510.
20. D.W. Loveland, A new interpretation of von Mises' concept of a random sequence, Z. Math. Logik Grundlagen Math. 12 (1966) 279-294.
21. J.H. Lutz, Almost everywhere high nonuniform complexity, J. Comput. System Sci. 44 (1992) 220-258.
22. J.H. Lutz, On independent random oracles, Theoret. Comput. Sci. 92 (1992) 301-307.
23. P. Martin-Löf, On the definition of random sequences, Inform. Control 9 (1966) 602-619.
24. C.P. Schnorr, A unified approach to the definition of random sequences, Math. Systems Theory 5 (1971) 246-258.
25. C.P. Schnorr, Process complexity and effective random tests, J. Comput. System Sci. 7 (1973) 376-388.
26. A.Kh. Shen', The frequency approach to the definition of a random sequence, Semiotika Inform. 18 (1982) 14-42. (In Russian).
27. A.Kh. Shen', On relations between different algorithmic definitions of randomness, Sov. Math. Doklady 38 (1989) 316-319.
28. R.M. Solovay, 1975, reported in [8].
29. V.A. Uspenskii, A.L. Semenov, A.Kh. Shen', Can an individual sequence of zeros and ones be random?, Russian Math. Surveys 45 (1990) 121-189.
30. M. van Lambalgen, Random Sequences, Ph.D. Thesis, Department of Mathematics, University of Amsterdam, 1987.
31. R. von Mises, Grundlagen der Wahrscheinlichkeitsrechnung, Math. Z. 5 (1919) 52-99.
32. A. Wald, Die Widerspruchsfreiheit des Kollectivbegriffs in der Wahrscheinlichkeitsrechnung, Ergebnisse eines Math. Koll. 8 (1938) 38-72.