Autoreducibility of random sets: A sharp bound on the density of guessed bits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2420, Issue , 2002, Pages 221-233

  Ebert, Todd ^a   Merkle, Wolfgang ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINERY; SET THEORY;

AUTOREDUCIBILITY; COMPUTABLE FUNCTIONS; CURRENT INPUT; POSITIVE CONSTANT; RANDOM SET; SHARP BOUNDS; TRUTH TABLES;

TURING MACHINES;

EID: 84956998472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_18     Document Type: Conference Paper

References (23)

1. K. Ambos-Spies and A. Kučera. Randomness in computability theory. In P. A. Cholak et al. (eds.), Computability theory and its applications. Current trends and open problems. Proceedings of a 1999 AMS-IMS-SIAM joint summer research conference, Boulder, USA, AMS Contemporary Mathematics 257:1-14, 2000.
2. K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In A. Sorbi (ed.), Complexity, logic, and recursion theory, p. 1-47. Dekker, New York, 1997.
3. J. Aspnes, R. Beigel, M. Furst, and S. Rudich. The expressive power of voting polynomials, Combinatorica 14(2), p. 135-148, 1994.
4. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity, volumes I and II. Springer, 1995 and 1990.
5. H. Buhrman, L. Fortnow, D. van Melkebeek, and L. Torenvliet, Separating complexity classes using autoreducibility. SIAM Journal on Computing 29:1497-1520, 2000.
6. H. Buhrman, D. van Melkebeek, K. W. Regan, D. Sivakumar, M. Strauss, A generalization of resource-bounded measure, with application to the BPPvs. EXPpr oblem. SIAM Journal on Computing 30(2):576-601, 2000.
7. T. Ebert. Applications of Recursive Operators to Randomness and Complexity. Ph.D. Thesis, University of California at Santa Barbara, 1998.
8. T. Ebert, H. Vollmer. On the Autoreducibility of Random Sequences. In: M. Nielsen and B. Rovan (eds.), Mathematical Foundations of Computer Science 2000, Lecture Notes in Computer Science 1893: 333-342, Springer, 2000.
9. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications, second edition. Springer, 1997.
10. J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44:220-258, 1992.
11. J. H. Lutz. The quantitative structure of exponential time. In L. A. Hemaspaandra and A. L. Selman (eds.), Complexity Theory Retrospective II, p. 225-260, Springer, 1997.
12. P. Martin-Löf. The definition of random sequences. Inform. and Control 9(6):602-619, 1966.
13. E. Mayordomo. Contributions to the Study of Resource-Bounded Measure. Doctoral dissertation, Universitat Polit`ecnica de Catalunya, Barcelona, Spain, 1994.
14. W. Merkle and N. Mihailović. On the construction of effective random sets. In: Mathematical Foundations of Computer Science 2002, this volume.
15. P. Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989.
16. S. Robinson. Why mathematicians now care about their hat color. NY Times, April 10, 2001.
17. C.-P. Schnorr. A unified approach to the definition of random sequences. Mathematical Systems Theory, 5:246-258, 1971.
18. R. I. Soare. Recursively Enumerable Sets and Degrees. Springer, 1987.
19. S. A. Terwijn. Computability and Measure. Doctoral dissertation, Universiteit van Amsterdam, Amsterdam, Netherlands, 1998.
20. B. A. Trakhtenbrot, On Autoreducibility. Soviet Math. Doklady, 11:814-817, 1970.
21. J.H. van Lint. Introduction to coding theory, third edition. Springer, 1999.
22. K. Wagner and G. Wechsung. Computational Complexity. Deutscher Verlag der Wissenschaften, Berlin, 1986.
23. Y. Wang. Randomness and Complexity. Doctoral dissertation, Universität Heidelberg, Mathematische Fakultät, INF 288, Heidelberg, Germany, 1996.