On the autoreducibility of random sequences

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

Volumn 1893, Issue , 2000, Pages 333-342

  Ebert, Todd ^a   Vollmer, Heribert ^b  

^a DOCOMO USA LABS   (United States)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

AUTOREDUCIBILITY; MARTIN-LOF; POLYNOMIAL-TIME; RANDOM LANGUAGES; RANDOM SEQUENCE; UPPER AND LOWER BOUNDS;

COMPUTATIONAL LINGUISTICS;

EID: 23044519762     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_29     Document Type: Conference Paper

References (21)

1. Alon N., Spencer J. The Probabilistic Method. John Wiley and Sons, New York, 1992.
2. Bennett C., Gill J. Relative to a Random Oracle A, PA = NPA = coNPA With Probability 1. SIAM Journal on Computing, 10, 96-113,1981.
3. Blahut R. Theory and Practice of Error Control Codes. Addison Wesley, Reading, Ma, 1984.
4. Book R. On Languages Reducible to Algorithmically Random Languages. SIAM Journal on Computing, Vol. 23, No. 6, 1275-1282, 1984.
5. Book R., Lutz J., Wagner K. W. An Observation on Probability Versus Randomness. Math. Systems Theory, 27,201-209, 1994.
6. Brualdi R. Introductory Combinatorics. North-Holland, NY, 1988.
7. Buhrman H., van Melkebeek D., Regan K.W., Sivakumar D., Strauss M., A generalization of resource-bounded measure, with an application to the BPP vs. EXP problem. Manuscript, 1999. Preliminary versiond appeared in Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pp. 161-171, 1998, and as University of Chicago, Department of Computer Science, Technical Report TR-97-04, May 1997.
8. Cutland N. Introduction to Computability. Cambridge Univ. Press, 1992.
9. Ebert T. Applications of Recursive Operators to Randomness and Complexity. Ph.D. Thesis, University of California at Santa Barbara, 1998.
10. Gacs P. Every Sequence is Reducible to a Random One. Information and Control, 70, 186-192, 1986.
11. Kim K.H., Roush F.W. Applied Abstract Algebra. John Wiley and Sons, New York, 1983.
12. Li M., Vitanyi P. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, New York, 1993.
13. Lutz J. Konig's Lemma, Randomness, and the Arithmetical Hierarchy. Unpublished Lecture Notes, Iowa St. Univ., 1993.
14. Lutz J. A Pseudorandom Oracle Characterization of BPP. SIAM Journal on Computing, 22(5):1075-1086, 1993.
15. Lutz J. The Quantitative Structure of Exponential Time. In: Hemaspaandra L., Selman A., editors, Complexity Theory Restropsective II, Springer Verlag, 1997, 225-260.
16. Martin-Lof P. On the Definition of Random Sequences. Information and Control, 9, 602-619, 1966.
17. Wolfgang Merkle. Personal communication, December 1999.
18. Rogers H. Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, 1992.
19. Shiryaev A.N. Probability. Springer-Verlag, New York, 1995.
20. Trakhtenbrot, B.A. On Autoreducibility. Soviet Math dokl., 11:814-817, 1970.
21. Wagner K. W., Wechsung G. Computational Complexity. Deutscher Verlag der Wissenschaften, Berlin, 1986.