Complexity of the r-query Tautologies in the Presence of a Generic Oracle

Extending techniques in Dowd (Information and Computation vol. 96 (1992)) and those in Poizat (J. Symbolic Logic vol. 51 (1986)), we study computational complexity of rTAUT [A] in the case when A is a generic oracle, where r is a positive integer and rTAUT [A] denotes the collection of all r-query tautologies with respect to an oracle A. We introduce the notion of ceiling-generic oracles, as a generalization of Dowd’s notion of t-generic oracles to arbitrary finitely testable arithmetical predicates. We study how existence of ceiling-generic oracles aects behavior of a generic oracle, by which we show that {X : coNP [X] is not a subset of NP [rTAUT [X]]} is comeager in the Cantor space. Moreover, using ceiling-generic oracles, we present an alternative proof of the fact (Dowd) that the class of all t-generic oracles has Lebesgue measure zero.

[1]  Kurt Mehlhorn.  On the Size of Sets of Computable Functions , 1973, SWAT.

[2]  Klaus Ambos-Spies.  P-Generic Sets , 1984, ICALP.

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

[4]  José L. Balcázar,et al.  On Bounded Query Machines , 1985, Theor. Comput. Sci..

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

[6]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[7]  Manuel Blum,et al.  Generic oracles and oracle classes , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  P. J. Cohen,et al.  THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[9]  P. J. Cohen,et al.  THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS, II. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Ronald V. Book,et al.  Bounded Query Machines: On NP and PSPACE , 1981, Theor. Comput. Sci..

[11]  Peter G. Hinman.  Some applications of forcing to hierarchy problems in arithmetic , 1969 .

[12]  Piergiorgio Odifreddi,et al.  Forcing and reducibilities , 1983, Journal of Symbolic Logic.

[13]  C. Jockusch.  Degrees of generic sets , 1980 .

[14]  Hisao Tanaka,et al.  On relativized probabilistic polynomial time algorithms , 1997 .

[15]  S. Feferman.  Some applications of the notions of forcing and generic sets , 1964 .

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

[17]  Toshio Suzuki,et al.  Recognizing tautology by a deterministic algorithm whose while-loop's execution time is bounded by forcing , 1998 .

[18]  Martin Dowd,et al.  Generic Oracles, Uniform Machines, and Codes , 1992, Inf. Comput..