Some results on effective randomness

Theory of Computing Systems

Volumn 39, Issue 5, 2006, Pages 707-721

  Merkle, Wolfgang ^a   Mihailović, Nenad ^a   Slaman, Theodore A ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CANTOR SPACES; COMPUTABLY ENUMERABLE; MARTIN-LOF; RANDOM MEASURES; RANDOM SEQUENCE;

CHARACTERIZATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

TESTING;

EID: 33748546643     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-005-1212-8     Document Type: Article

References (32)

1. K. Ambos-Spies and A. Kučera. Randomness in computability theory. In P. A. Cholak et al. (eds.), Camputability Theory and Its Applications.Current Trends and Open Problems, pp. 1-14. Contemporary Mathematics 257. American Mathematical Society, Providence, RI, 2000.
2. K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In A. Sorbi (ed.), Complexity, Logic, and Recursion Theory, pp. 1-47. Marcel Dekker, New York, 1997.
3. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer, New York, 1995.
4. C. S. Calude, Information and Randomness. Springer, New York, 1994.
5. C. S. Calude. A characterization of c.e. random reals. Theoretical Computer Science 271:3-14, 2002.
6. C. S. Calude, P. H. Hertling, B. Khoussainov, and Y. Wang. Recursively enumerable reals and Chaitin Ω numbers. Theoretical Computer Science 255:125-149, 2001.
7. A preliminary version appeared in M. Morvan et al. (eds.), Proc. 15th Symposium on Theoietical Aspects of Computer Science, pp. 596-606. Lecture Notes in Computer Science 1373. Springer, Berlin, 1998.
8. R. Downey, E. Griffiths, and G. LaForte. On Schnorr and computable randomness, martingales, and machines. Mathematical Logic Quarterly 50(6):613-627, 2004.
9. R. Downey and D. Hirschfeldt. Algorithmic randomness and complexity. Manuscript, 2005.
10. R. Durrett. Essentials of Stochastic Process. Springer, New York, 1999.
11. J. M. Hitchcock. Small spans in scaled dimension. SIAM Journal on Computing 34(1): 170-194, 2004.
12. A preliminary version appeared in Proc. 19th Annual IEEE Conference on Computational Complexity, pp. 104-112. IEEE Computer Society Press, Los Alamitos, CA, 2004.
13. J. M. Hitchcock and J. H. Lutz. Why computational complexity requires stricter martingales. Theory of computing systems, to appear.
14. A preliminary version appeared in P. Widmayer et al. (eds.), Proc. 29th International Colloquium on Automata, Languages and Programming, pp. 549-560. Lecture Notes in Computer Science 2380. Springer, Berlin, 2002.
15. 0-classes and complete extensions of PA. In H.-D. Ebbinghaus et al. (eds.), Recursion Theory Week, pp. 245-259. Lecture Notes in Mathematics 1141. Springer, Berlin, 1985.
16. A. Kučera. Randomness and generalizations of fixed point free functions. In K. Ambos-Spies et al. (eds.), Recursion Theory Week, pp. 245-254. Lecture Notes in Mathematics 1432. Springer, Berlin, 1990.
17. A. Kučera and T. A. Slaman. Randomness and recursive enumerability. SIAM Journal on Computing 31(1):199-211, 2001.
18. M. Li and P. Vitányi. An Introduction to Kolmogomv Complexity and Its Applications, second edition. Springer, New York, 1997.
19. J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences 44:220-258, 1992.
20. J. H. Lutz. The quantitative structure of exponential time. In L. A. Hemaspaandra and A. L. Selman (eds.), Complexity Theory Retrospective II, pp. 225-260. Springer, New York, 1997.
21. P. Martin-Löf. The definition of random sequences. Information and Control 9(6):602-619, 1966.
22. E. Mayordomo. Contributions to the Study of Resource-Bounded Measure. Doctoral dissertation, Universitat Politècnica de Catalunya, Barcelona, 1994.
23. An. A. Muchnik, A. L. Semenov, and V. A. Uspensky. Mathematical metaphysics of randomness. Theoretical Computer Science. 207:263-317, 1990.
24. C.-P. Schnorr. A unified approach to the definition of random sequences. Mathematical Systems Theory 5:246-258, 1971.
25. C.-P. Schnorr. Zufälligkeit und Wahrscheinlichkeit (Randomness and Probability). Lecture Notes in Mathematics 218. Springer, Berlin, 1971.
26. A. N. Shiryaev. Probability. Springer, New York, 1995.
27. R. I. Soare. Recursively Enumerable Sets and Degrees. Springer, New York, 1987.
28. R. M. Solovay. Draft of a paper (or series of papers) on Chaitin's Work.... Manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974.
29. S. A. Terwijn. Computability and Measure. Doctoral dissertation, Universiteit van Amsterdam, Amsterdam, 1998.
30. S. A. Terwijn. Unpublished notes, 1998.
31. J. Ville. Étude Critique de la Notion de Collectif. Gauthiers-Villars, Paris, 1939.
32. Y. Wang. A Separation of two randomness concepts. Information Processing Letters 69:115-118, 1999.