On the construction of effectively random sets

Journal of Symbolic Logic

Volumn 69, Issue 3, 2004, Pages 862-878

  Merkle, Wolfgang ^a   Mihailović, Nenad ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4644291058     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1096901772     Document Type: Article

References (24)

1. K. AMBOS-SPIES and A. KUČERA, Randomness in computability theory, Computability Theory and its Applications - Current Trends and Open Problems (P. A. Cholak, S. Lempp, M. Lerman, and R. A. 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), Dekker, New York, 1997, pp. 1-47.
3. T. M. APOSTOL, Mathematical Analysis, 3rd ed., Addison Wesley, 1978.
4. J. L. BALCÁZAR, J. DÍAZ, and J. GABARRÓ, Structural Complexity I, Springer, 1995.
5. C. S. CALUDE, A characterization of c.e. random reals, Theoretical Computer Science, vol. 271 (2002), pp. 3-14.
6. -, Information and Randomness, 2nd ed., Springer-Verlag, 2002.
7. T. EBERT, Applications of recursive operators to randomness and complexity, Ph.D. thesis, University of California at Santa Barbara, 1998.
8. T. EBERT, W. MERKLE, and H. VOLLMER, On the autoreducibility of random sequences, SIAM Journal on Computing, vol, 32 (2003), pp. 1542-1569.
9. P. GÁCS, Every sequence is reducible to a random one, Information and Control. vol. 70 (1986), pp. 186-192.
10. P. HERTLING, Surjective functions on computably growing Cantor sets, Journal of Universal Computer Science, vol. 3 (1996), pp. 1226-1240.
11. 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, 1985, pp. 245-259.
12. -, On the use of diagonally nonrecursive functions, Logic Colloquium'87 (H. D. Ebbinghaus et al., editors), Studies in Logic and the Foundations of Mathematics, vol. 129, North-Holland, 1989, pp. 219-239.
13. M. LI and P. VITÁNYI, An Introduction to Kolmogorov Complexity and its Applications, 2nd ed., Springer, 1997.
14. J. H. LUTZ, Almost everywhere high nonuniform complexity, Journal of Computer and System Sciences, vol. 44 (1992), pp. 220-258.
15. -, The quantitative structure of exponential time, Complexity Theory Retrospective II (L. A. Hemaspaandra and A. L. Selman, editors), Springer, 1997, pp. 225-260.
16. P. MARTIN-LÖF, The definition of random sequences, Information and Control, vol. 9 (1966), no. 6, pp. 602-619.
17. E. MAYORDOMO, Contributions to the study of resource-bounded measure, Ph.D. thesis, Universitat Politècnica de Catalunya, Barcelona, Spain, 1994.
18. W. MERKLE. The complexity of stochastic sequences, Proceedings of the IEEE Conference on Computational Complexity, IEEE Computer Society Press, 2003, pp. 230-235.
19. P. ODIFREDDI, Classical Recursion Theory, North-Holland, Amsterdam, 1989.
20. C.-P. SCHNORR, A unified approach to the definition of random sequences, Mathematical Systems Theory, vol. 5 (1971), pp. 246-258.
21. -, Zuffälligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, vol. 218, Springer, 1971, in German.
22. R. I. SOARE, Recursively Enumerable Sets and Degrees, Springer, 1987.
23. S. A. TERWIJN, Computability and measure, Ph.D. thesis, Universiteit van Amsterdam, Amsterdam, Netherlands, 1998.
24. B. A. TRAKHTENBROT, On autoreducibility, Soviet Mathematics Doklady, vol. 11 (1970), pp. 814-817.