Kolmogorov-Loveland randomness and stochasticity

Annals of Pure and Applied Logic

Volumn 138, Issue 1-3, 2006, Pages 183-210

  Merkle, Wolfgang ^a   Miller, Joseph S ^b   Nies, André ^c   Reimann, Jan ^a   Stephan, Frank ^d  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c UNIVERSITY OF AUCKLAND   (New Zealand)

^d NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Algorithmic randomness; Effective Hausdorff dimension; Kolmogorov complexity; Kolmogorov Loveland stochastic sequences

Indexed keywords

EID: 33644802778     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2005.06.011     Document Type: Article

References (33)

1. K. Ambos-Spies A. Kučera Randomness in computability theory Computability Theory and its Applications (Boulder, CO, 1999) Contemp. Math. vol. 257 2000 Amer. Math. Soc. 1-14
2. K. Ambos-Spies E. Mayordomo Y. Wang X. Zheng Resource-bounded balanced genericity, stochasticity and weak randomness C. Puech R. Reischuk Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science STACS'96, Grenoble, France Lecture Notes in Computer Science vol. 1046 1996 Springer-Verlag Berlin 63-74
3. K. Ambos-Spies W. Merkle J. Reimann F. Stephan Hausdorff dimension in exponential time Proceedings of the 16th Annual IEEE Conference on Computational Complexity 2000 IEEE Computer Society, IEEE Computer Society Press Chicago, IL, USA 210-217
4. H. Buhrman D. van Melkebeek K.W. Regan D. Sivakumar M. Strauss A generalization of resource-bounded measure, with application to the BPP vs. EXP problem SIAM J. Comput. 30 2 2000 576-601
5. J.-Y. Cai J. Hartmanis On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line J. Comput. System Sci. 49 3 1994 605-619
6. C.S. Calude A characterization of c.e. random reals Theoret. Comput. Sci. 271 2002 3-14
7. R. Downey, D. Hirschfeldt, A. Nies, S. Terwijn, Calibrating randomness. Bull. Symbolic Logic (in press)
8. A.N. Kolmogorov On tables of random numbers Sankhyā, Ser. A 25 1963 369-376 (Reprinted as [9])
9. A.N. Kolmogorov On tables of random numbers Theoret. Comput. Sci. 207 2 1998 387-395 (Reprint of [8])
10. J.I. Lathrop J.H. Lutz Recursive Computational Depth Inform. and Comput. 153 1 1999 139-172
11. M. Li P. Vitányi An Introduction to Kolmogorov Complexity and its Applications second ed. Graduate Texts in Computer Science 1997 Springer New York
12. D. Loveland A new interpretation of the von Mises' concept of random sequence Z. Math. Logik Grundlagen Math. 12 1966 279-294
13. J.H. Lutz Gales and the constructive dimension of individual sequences Automata, Languages and Programming ICALP 2000, Geneva, Switzerland, 2000 Lecture Notes in Comput. Sci. vol. 1853 2000 Springer Berlin 902-913
14. J.H. Lutz D.L. Schweizer Feasible reductions to Kolmogorov-Loveland stochastic sequences Theoret. Comput. Sci. 225 1999 185-194
15. P. Martin-Löf The definition of random sequences Inf. Control 9 1966 602-619
16. E. Mayordomo A Kolmogorov complexity characterization of constructive Hausdorff dimension Inform. Process. Lett. 84 1 2002 1-3
17. W. Merkle The complexity of stochastic sequences Conference on Computational Complexity 2003 2003 IEEE Computer Society, IEEE Computer Society Press Aarhus, Denmark 230-235
18. W. Merkle The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences J. Symbolic Logic 68 2003 1362-1376
19. J.S. Miller, L. Yu, On initial segment complexity and degrees of randomness (in preparation)
20. A.A. Muchnik A.L. Semenov V.A. Uspensky Mathematical metaphysics of randomness Theoret. Comput. Sci. 207 2 1998 263-317
21. P. Odifreddi Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers Studies in Logic and the Foundations of Mathematics vol. 125 1989 North-Holland Amsterdam
22. J. Reimann, Computability and fractal dimension, Doctoral Dissertation, Universität Heidelberg, 2004
23. B.Y. Ryabko Coding of combinatorial sources and Hausdorff dimension Dokl. Akad. Nauk SSSR 277 5 1984 1066-1070
24. B.Y. Ryabko Noise-free coding of combinatorial sources, Hausdorff dimension and Kolmogorov complexity Problemy Peredachi Informatsii 22 3 1986 16-26
25. B.Y. Ryabko, Private communication, April 2003
26. C.P. Schnorr A unified approach to the definition of random sequences Math. Systems Theory 5 1971 246-258
27. C.P. Schnorr Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie (Randomness and Probability. An Algorithmic Foundation of Probability Theory) Lecture Notes in Mathematics vol. 218 1971 Springer-Verlag Berlin-Heidelberg-New York
28. A. Shen' On relations between different algorithmic definitions of randomness Soviet Math. Dokl. 38 1989 316-319
29. L. Staiger Kolmogorov complexity and Hausdorff dimension Inform. and Comput. 103 2 1993 159-194
30. L. Staiger A tight upper bound on Kolmogorov complexity and uniformly optimal prediction Theory Comput. Syst. 31 3 1998 215-229
31. V. Uspensky A. Semenov A. Shen' Can an individual sequence of zeros and ones be random? Russ. Math. Surv. 45 1 1990 121-189
32. M. van Lambalgen, Random sequences, Doctoral Dissertation, University of Amsterdam, 1987
33. A.K. Zvonkin L.A. Levin The complexity of finite objects and the basing of the concepts of information and randomness on the theory of algorithms Uspehi Mat. Nauk 25 6(156) 1970 85-127