The kolmogorov-loveland stochastic sequences are not closed under selecting subsequences

Journal of Symbolic Logic

Volumn 68, Issue 4, 2003, Pages 1362-1376

  Merkle, Wolfgang ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348222318     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1067620192     Document Type: Article

References (28)

1. K. Ambos-Spies, Algorithmic randomness revisited, Language, Logic and Formalization of Knowledge. Coimbra Lecture and Proceedings of a Symposium held in Siena in September 1997 (B. McGuinness, editor), Bibliotheca, 1998, pp. 33-52.
2. K. Ambos-Spies and A. Kučera, Randomness in computability theory, Computability theory: Current Trends and Open Problems (P. Cholak et al., editors), Contemporary Mathematics, vol. 257, American Mathematical Society, 2000, pp. 1-14.
3. K. Ambos-Spies and E. Mayordomo, Resource-bounded measure and randomness, Complexity, logic, and recursion theory (A. Sorbi, editor), Lecture Notes in Pure and Applied Mathematics, vol. 187, Marcel Dekker Inc., NewYork, 1997, pp. 1-47.
4. K. Ambos-Spies, E. Mayordomo, Y Wang, and X. Zheng, Resource-bounded balancedgenericity, stochasticity and weak randomness, 13th Annual Symposium on Theoretical Aspects of Computer Science, STACS’96 (C. Puech and R. Reischuk, editors), Lecture Notes in Computer Science, vol. 1046, Springer, 1997, pp. 63-74.
5. J. L. Balcázar, J. DIaz, and J. Gabarró, Structural complexity. Vol. I and II, Springer-Verlag, 1995 and 1990.
6. A. Church, On the concept of a random sequence, Bulletin of the American Mathematical Society, vol. 46 (1940), pp. 130-135.
7. R. P. Daley, Minimal-program complexity of pseudo-recursive and pseudo-random sequences, Mathematical Systems Theory, vol. 9 (1975), pp. 83-94.
8. W Feller, An introduction to probability theory and its applications. Vol. I, third ed., revised printing, John Wiley & Sons Inc., 1968.
9. A. N. Kolmogorov, On tables of random numbers, Sankhya, Ser. A, vol. 25 (1963), pp. 369-376, Reprinted in Theoretical Computer Science, vol. 207 (1998), pp. 387-395.
10. A. N. Kolmogorov and V. A. Uspensky, Algorithms and randomness, Theory of Probability and its Applications, vol. 32 (1987), pp. 389-412.
11. M. Van lambalgen, Random sequences, Ph.D. thesis, University of Amsterdam, Amsterdam, 1987.
12. M. Li and P Vtanyl, An Introduction to Kolmogorov Complexity and Its Applications, second ed., Springer, 1997.
13. D. W. Loveland, The Kleene hierarchy classification of recursively random sequences, Transactions of the American Mathematical Society, vol. 125 (1966), pp. 497-510.
14. D. W. Loveland, A new interpretation of the von Mises’ concept of random sequence, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 279-294.
15. J. H. Lutz, Private communication, March 2002.
16. J. H. Lutz and D. L. Schweizer, Feasible reductions to Kolmogorov-Loveland stochastic sequences, Theoretical Computer Science, vol. 225 (1999), pp. 185-194.
17. P. Martin-Lof, The definition of random sequences, Information and Control, vol. 9 (1966), pp. 602-619.
18. W. Merkle, The complexity of stochastic sequences, Conference on computational complexity, IEEE Computer Society Press, 2003, pp. 230-235.
19. An. A. Muchnik, A. L. Semenov, and V A. Uspensky, Mathematical metaphysics of randomness, Theoretical Computer Science, vol. 207 (1998), pp. 263-317.
20. P. Odifreddi, Classical recursion theory. Vol. I, North-Holland Publishing Company, Amsterdam, 1989.
21. C. H. Papadimitriou, Computational complexity, Addison-Wesley Publishing Company, 1994.
22. C. P. Schnorr, Zufalligkeit und Wahrscheinlichkeit, in German, Lecture Notes in Mathematics, vol. 218, Springer-Verlag, 1971.
23. A. Kh. Shen’, The frequency approach to the definition of the notion of a random sequence (in Russian), Semiotika iInformatika, vol. 18 (1982), pp. 14-41.
24. A. Kh. Shen’, On relations between different algorithmic definitions of randomness, Soviet Mathematics Doklady, vol. 38 (1988), pp. 316-319.
25. A. Kh. Shen’, Private communication, November 2001.
26. A. Kh. Shen’, Private communication, March 2002.
27. V A. Uspensky, A. L. Semenov, and A. Kh. Shen’, Can an individual sequence of zeros and ones be random?, Russian Mathematical Surveys, vol. 45 (1990), pp. 121-189.
28. J. Ville, Etude critique de la notion de collectif, in French, Gauthiers-Villars, Paris, 1939.