Results 1 
2 of
2
An oracle builder’s toolkit
, 2002
"... We show how to use various notions of genericity as tools in oracle creation. In particular, 1. we give an abstract definition of genericity that encompasses a large collection of different generic notions; 2. we consider a new complexity class AWPP, which contains BQP (quantum polynomial time), and ..."
Abstract

Cited by 47 (10 self)
 Add to MetaCart
We show how to use various notions of genericity as tools in oracle creation. In particular, 1. we give an abstract definition of genericity that encompasses a large collection of different generic notions; 2. we consider a new complexity class AWPP, which contains BQP (quantum polynomial time), and infer several strong collapses relative to SPgenerics; 3. we show that under additional assumptions these collapses also occur relative to Cohen generics; 4. we show that relative to SPgenerics, ULIN ∩ coULIN ̸ ⊆ DTIME(n k) for any k, where ULIN is unambiguous linear time, despite the fact that UP ∪ (NP ∩ coNP) ⊆ P relative to these generics; 5. we show that there is an oracle relative to which NP/1∩coNP/1 ̸ ⊆ (NP∩coNP)/poly; and 6. we use a specialized notion of genericity to create an oracle relative to which NP BPP ̸ ⊇ MA.
Interpreting N in the computably enumerable weak truth table degrees
"... We give a firstorder coding without parameters of a copy of (N;+; \Theta) in the computably enumerable weak truth table degrees. As a tool,we develop a theory of parameter definable subsets. Given a degree structure from computability theory, once the undecidability of its theory is known, an im ..."
Abstract
 Add to MetaCart
We give a firstorder coding without parameters of a copy of (N;+; \Theta) in the computably enumerable weak truth table degrees. As a tool,we develop a theory of parameter definable subsets. Given a degree structure from computability theory, once the undecidability of its theory is known, an important further problem is the question of the actual complexity of the theory. If the structure is arithmetical, then its theory can be interpreted in true arithmetic, i.e. Th(N; +; \Theta). Thus an upper bound is ; (!) , the complexity of Th(N; +; \Theta). Here an interpretation of theories is a manyone reduction based on a computable map defined on sentences in some natural way. An example of an arithmetical structure is D T ( ; 0 ), the Turing degrees of \Delta 0 2 sets. Shore [16] proved that true arithmetic can be interpreted in Th(D T ( ; 0 )). A stronger result is interpretability without parameters of a copy of (N; +; \Theta) in the structure (interpretability of struc...