Comparing complexity classes relative to physical oracles
نویسندگان
چکیده
We develop the idea of using a physical experiment as an oracle to an algorithm. As a case study, we compare the computational power of deterministic and non-deterministic Turing machines connected to a simple physical oracle, namely, the scatter machine experiment. We prove relativisation theorems for the conjectures concerning P , NP , PSPACE relative to this physical oracle. Finally, we reflect generally on physical oracles for complexity theory.
منابع مشابه
Polynomial-Time Random Oracles and Separating Complexity Classes
Bennett and Gill (1981) showed that P 6= NP 6= coNP for a random oracle A, with probability 1. We investigate whether this result extends to individual polynomial-time random oracles. We consider two notions of random oracles: p-random oracles in the sense of martingales and resource-bounded measure (Lutz, 1992; Ambos-Spies et al., 1997), and p-betting-game random oracles using the betting game...
متن کاملAxiomatizing physical experiments as oracles to algorithms.
We developed earlier a theory of combining algorithms with physical systems, on the basis of using physical experiments as oracles to algorithms. Although our concepts and methods are general, each physical oracle requires its own analysis, on the basis of some fragment of physical theory that specifies the equipment and its behaviour. For specific examples of physical systems (mechanical, opti...
متن کاملA Tight Relationship Between Generic Oracles and Type-2 Complexity Theory
We show that any two complexity classes satisfying some general conditions are distinct relative to a generic oracle i the corresponding type-2 classes are distinct. 3
متن کاملCircuit Lower Bounds Collapse Relativized Complexity Classes
Since the publication of Furst, Saxe, and Sipser's seminal paper connecting AC 0 with the polynomial hierarchy FSS84], it has been well known that circuit lower bounds allow you to construct oracles that separate complexity classes. We will show that similar circuit lower bounds allow you to construct oracles that collapse complexity classes. For example, based on H astad's parity lower bound, ...
متن کاملComplexity Classes with Finite Acceptance Types
Complexity classes with nite acceptance types are the classes obtained by nonde-terministic machines, if the global acceptance condition is of the form: the number of accepting computation paths is in the set A, for some xed nite set A. We study the relationships between such classes, exhibiting conditions, under which one class is contained in another one relative to all oracles, or conversely...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009