On the autoreducibility of random sequences

SIAM Journal on Computing

Volumn 32, Issue 6, 2003, Pages 1542-1569

  Ebert, Todd ^a   Merkle, Wolfgang ^b   Vollmer, Hertbert ^c  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF HEIDELBERG   (Germany)

^c LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

Autoreducibility; Density of guessed bits; Hat problem; Infinitely often autoreducibility; Martin L f random sequences; P random sequences; Random sequences; Rec random sequences; Truth table autoreducibility; Turing autoreducibility

Indexed keywords

AUTOREDUCTIBILITY; DENSITY OF GUESSED BITS; ERROR CORRECTING CODES; HAT PROBLEM; INFINITELY OFTEN AUTOREDUCTIBILITY; MARTIN-LOF RANDOM SEQUENCES; P-RANDOM SEQUENCES; RANDOM SEQUENCES; REC-RANDOM SEQUENCES; TURING AUTOREDUCTIBILITY;

COMPUTATIONAL METHODS; MATHEMATICAL TECHNIQUES; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; TURING MACHINES;

BINARY SEQUENCES;

EID: 0742269491     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702415317     Document Type: Article

References (48)

1. E. ALLENDER AND M. STRAUSS, Measure on small complexity classes, with applications for BPP, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Los Alamitos, CA, 1994, TEEE Computer Science Press, Los Alamitos, CA, 1994, pp. 807-818.
2. K. AMBOS-SPIES, P-mitotic sets, in Decision Problems and Complexity, Lecture Notes in Comput. Sci. 171, E. Börger, C. Hasenjaeger, and D. Rödding, eds., Springer-Verlag, Berlin, 1984, pp. 1-23.
3. K. AMBOS-SPIES, H. FLEISCHHACK, AND H. HUWTG, Diagonalizations over polynomial time computable sets, Theoret. Comput. Sci., 51 (1987), pp. 177-204.
4. K. AMBOS-SPIES, Resource bounded genericity, in Computability, Enumerability, Unsolvability - Directions in Recursion Theory, London Math. Soc. Lecture Note Ser. 224, S. B. Cooper, T. A. Slaman, and S. S. Wainer, eds., Cambridge University Press, Cambridge, UK, 1996, pp. 1-59.
5. K. AMBOS-SPIES AND A. KUǑERA, Randomness in computability theory, in Computability Theory and Its Applications - Current Trends and Open Problems, Contemp. Math. 257, P. A. Cholak, S. Lempp, M. Lerman, and R. A. Shore, eds., AMS, Providence, RI, 2000, pp. 1-14.
6. K. AMBOS-SPIES AND E. MAYORDOMO, Resource-bounded measure and randomness, in Complexity, Logic, and Recursion Theory, A. Sorbi, ed., Dekker, New York, 1997, pp. 1-47.
7. K. AMBOS-SPIES, S. A. TERWIJN, AND X. ZHENG, Resource bounded randomness and weakly complete problems, Theoret. Comput. Sci., 172 (1997), pp. 195-207.
8. A. ARSLANOV, On the phenomenon of autocomputability, in Computing: The Australasian Theory Symposium 2000, Electron. Notes Theoret. Comput. Sci. 31, Elsevier, Amsterdam, 2000, paper 31002.
9. J. ASPNES, R. BEIGEL, M. L. FURST, AND S. RUDICH, The expressive power of voting polynomials, Combinatorica, 14 (1994), pp. 135-148.
10. R. BEIGEL, L. FORTNOW, AND F. STEPHAN, Infinitely-Often Autoreducible Sets, Research report 62, Arbeitsgruppe Mathematische Logik und Theoretische Informatik, Institut für Informatik, Universität Heidelberg, Heidelberg, Germany, 2003.
11. J. L. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ, Structural Complexity, Vol. 1, 2nd ed., Springer-Verlag, Berlin, 1995.
12. J. L. BALCÁZAR, J. DÍAZ, AND J. GABARRÓ, Structural Complexity, Vol. II, Springer-Verlag, Berlin, 1990.
13. J. L. BALCÁZAR AND E. MAYORDOMO, A note on genericity and bi-immunity, in Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, MN, 1995, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 193-196.
14. W. BLUM, Denksport für Hutträger, DIE ZEIT 19/2001, May 3, 2001 (in German).
15. H. BUHRMAN, L. FORTNOW, D. VAN MELKEBEEK, AND L. TORENVLIET, Separating complexity classes using autoreducibility, SIAM J. Comput., 29 (2000), pp. 1497-1520.
16. H. BUHRMAN, D. VAN MELKEBEEK, K. W. REGAN, D. SIVAKUMAR, AND M. STRAUSS, A generalization of resource-bounded measure, with application to the BPP vs. EXP problem, SIAM J. Comput., 30 (2000), pp. 576-601.
17. C. CALUDE, Information and Randomness: An Algorithmic Perspective, 2nd ed., Springer-Verlag, Berlin, 2002.
18. R. DALEY, On the simplicity of busy beaver sets, Z. Math. Logik Grundlag. Math., 24 (1978), pp. 207-224.
19. T. EBERT, Applications of Recursive Operators to Randomness and Complexity, Ph.D. thesis, University of California at Santa Barbara, Santa Barbara, CA, 1998.
20. T. EBERT AND W. MERKLE, Autoreducibility of random sequences: A sharp bound on the density of guessed bits, in Mathematical Foundations of Computer Science 2002, Lecture Notes in Comput. Sci. 2420, K. Diks and W. Rytter, eds., Springer-Verlag, Berlin, 2002, pp. 221-233.
21. T. EBERT AND H. VOLLMER, On the autoreducibility of random sequences, in Mathematical Foundations of Computer Science 2000, Lecture Notes in Comput. Sci. 1893, M. Nielsen and B. Rovan, edg., Springer-Verlag, Berlin, 2000, pp. 333-342.
22. K. H. KIM AND F. W. ROUSH, Applied Abstract Algebra, John Wiley and Sons, New York, 1983.
23. C. JOCKUSCH AND M. PATERSON, Completely autoreducible degrees, Z. Math. Logik Grundlagen Math., 22 (1976), pp. 571-575.
24. R. LADNER, Mitotic recursively enumerable sets, J. Symbolic Logic, 38 (1973), pp. 199-211.
25. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
26. H. W. LENSTRA AND G. SEROUSSI, On hats and other covers, in Proceedings of the IEEE International Symposium on Information Theory, Lausanne, Switzerland, 2002.
27. M. LI AND P. VITÁNYI, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed., Springer-Verlag, Berlin, 1997.
28. J. H. LUTZ, Almost everywhere high nonuniform complexity, J. Comput. System Sci., 44 (1992), pp. 220-258.
29. J. H. LUTZ, The quantitative structure of exponential time, in Complexity Theory Retrospective II, L. A. Hemaspaandra and A. L. Selman, eds., Springer-Verlag, Berlin, 1997, pp. 225-260.
30. P. MARTIN-LÖF, The definition of random sequences, Information and Control, 9 (1966), pp. 602-619.
31. E. MAYORDOMO, Contributions to the Study of Resource-Bounded Measure, Doctoral dissertation, Universitat Politècnica de Catalunya, Barcelona, Spain, 1994.
32. W. MERKLE, The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences, in International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 2380, P. Widmayer, F. T. Ruiz, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, eds., Springer-Verlag, Berlin, 2002, pp. 390-400.
33. W. MERKLE, The complexity of stochastic sequences, in Proceedings of the 18th IEEE Annual Conference on Computational Complexity, Aarhus, Denmark, 2003, IEEE Computer Society Press, Los Alamitos, CA, 2003, pp. 230-235.
34. W. MERKLE AND N. MIHAILOVIĆ, On the construction of effective random sets, in Mathematical Foundations of Computer Science 2002, Lecture Notes in Comput. Sci. 2420, K. Diks and W. Rytter, eds., Springer-Verlag. Berlin, 2002, pp. 568-580.
35. S. ROBINSON, Why mathematicians now care about their hat color, New York Times, April 10, 2001.
36. S. RUDICH, private communication, 2001.
37. D. E. SHASHA, Crowns of the Minotaur, Scientific American, 285 (2001), p. 94.
38. A. N. SHIRYAEV, Probability, Springer-Verlag, Berlin, 1995.
39. C.-P. SCHNORR, A unified approach to the definition of random sequences, Math. Systems Theory, 5 (1971), pp. 246-258.
40. C.-P. SCHNORR, Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Math. 218, Springer-Verlag, Berlin, 1971 (in German).
41. C.-P. SCHNORR, Optimal algorithms for self-reducible problems, in International Colloquium on Automata, Languages and Programming 1976, S. Michaelson and R. Milner, eds., Edinburgh University Press, Edinburgh, UK, 1976, pp. 322-337.
42. R. I. SOARE, Recursively Enumerable Sets and Degrees, Perspect. Math. Logic, Springer-Verlag, Berlin, 1987.
43. S. A. TERWIJN, Computability and Measure, Doctoral dissertation, Universiteit van Amsterdam, Amsterdam, The Netherlands, 1998.
44. B. A. TRAKHTENBROT, On autoreducibility, Soviet Math. Dokl., 11 (1970), pp. 814-817.
45. J.H. VAN LINT, Introduction to Coding Theory, 3rd ed., Springer-Verlag, Berlin, 1999.
46. D. VAN MELKEBEEK, Randomness and Completeness in Computational Complexity, Lecture Notes in Comput. Sci. 1950, Springer-Verlag, Berlin, 2000.
47. J. VILLE, Étude Critique de la Notion de Collectif, Gauthiers-Villars, Paris, 1939.
48. Y. WANG, Randomness and Complexity, Doctoral dissertation, Universität Heidelberg, Mathematische Fakultät, INF 288, Heidelberg, Germany, 1996.