Banishing Robust Turing Completeness

This paper shows that “promise classes” are so fragilely structured that they do not robustly possess Turing-hard sets even in classes far larger than themselves. We show that FewP does not robustly possess Turing-hard sets for UP ∩ coUP and IP ∩ coIP does not robustly possess Turing-hard sets for ZPP. It follows that ZPP, R, coR, UP ∩ coUP, UP, FewP ∩ coFewP, FewP, and IP ∩ coIP do not robustly possess Turing complete sets. This both resolves open questions of whether promise classes lacking robust downward closure under Turing reductions (e.g., R, UP, FewP) might robustly have Turing complete sets, and extends the range of classes known not to robustly contain many-one complete sets.

[1]  José L. Balcázar,et al.  Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes , 1988, RAIRO Theor. Informatics Appl..

[2]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[3]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[4]  Uwe Schöning,et al.  Robust Algorithms: A Different Approach to Oracles , 1985, Theor. Comput. Sci..

[5]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[6]  Eric Allender,et al.  The Complexity of Sparse Sets in P , 1986, SCT.

[7]  Neil Immerman,et al.  On Complete Problems for NP$\cap$CoNP , 1985, ICALP.

[8]  Lance Fortnow,et al.  Are There Interactive Protocols for CO-NP Languages? , 1988, Inf. Process. Lett..

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Stuart A. Kurtz,et al.  Collapsing degrees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[11]  Stuart A. Kurtz.  A relativized failure of the Berman-Hartmanis conjecture , 1983 .

[12]  Stathis Zachos,et al.  Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview , 1986, SCT.

[13]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[14]  Osamu Watanabe,et al.  On polynomial time Turing and many-one completeness in PSPACE , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[15]  Juris Hartmanis,et al.  One-Way Functions and the Nonisomorphism of NP-Complete Sets , 1991, Theor. Comput. Sci..

[16]  Nancy A. Lynch,et al.  Comparison of polynomial-time reducibilities , 1974, STOC '74.

[17]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[18]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[19]  Lane A. Hemaspaandra,et al.  Separating Complexity Classes With Tally Oracles , 1992, Theor. Comput. Sci..

[20]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[21]  Juris Hartmanis,et al.  Complexity Classes without Machines: On Complete Languages for UP , 1986, Theor. Comput. Sci..

[22]  Kenneth W. Regan.  Minimum-Complexity Pairing Functions , 1992, J. Comput. Syst. Sci..

[23]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[24]  José L. Balcázar,et al.  Some results about Logspace complexity measures , 1984, Bull. EATCS.

[25]  Joachim Grollmann,et al.  Relativizations of Unambiguous and Random Polynomial Time Classes , 1986, SIAM J. Comput..

[26]  Jin-Yi Cai,et al.  On the Power of Parity Polynomial Time , 1989, STACS.

[27]  Yuri Gurevich,et al.  Algebras of feasible functions , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[28]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[29]  LundCarsten,et al.  Algebraic methods for interactive proof systems , 1992 .

[30]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[31]  Judy Goldsmith,et al.  Three results on the polynomial isomorphism of complete sets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[32]  Klaus Ambos-Spies.  A Note on the Complete Problems for Complexity Classes , 1986, Inf. Process. Lett..

[33]  Eric Allender,et al.  P-Printable Sets , 1988, SIAM J. Comput..

[34]  Michael Sipser,et al.  On Relativization and the Existence of Complete Sets , 1982, International Colloquium on Automata, Languages and Programming.

[35]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[36]  Lance Fortnow,et al.  Probabilistic computation and linear time , 1989, STOC '89.

[37]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[38]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[39]  Journal of the Association for Computing Machinery , 1961, Nature.

[40]  John Gill,et al.  Relativizations of the P =? NP Question , 1975, SIAM J. Comput..

[41]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[42]  Ker-I Ko,et al.  On Some Natural Complete Operators , 1985, Theor. Comput. Sci..