Abstract
Relativized complexity theory based on alternating Turing machines is considered. Alternating complexity classes are shown to provide natural counterexamples to the longstanding conjecture that known proofs of complexity class inclusion results relativize. In particular, there exist oracle sets separating classes APSPACE and E (of languages recognizable in alternating polynomial space and deterministic exponential time, respectively), although the classes are known to be equal in the unrelativized case. Classes APSPACE and E may even be shown to differ for almost all oracles, thus providing a counterexample also to the so called random oracle hypothesis. A complexity hierarchy built by quantifying over oracle sets for alternating machines is also defined, with its first ⌆-level coinciding with class NE (nondeterministic exponential time). This representation of NE is noted not to relativize. Problems about the structure of this second-order hierarchy are shown to be related to open problems concerning the polynomial-time hierarchy.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Angluin,D., On relativizing auxiliary pushdown machines. Math. Systems Theory 13 (1980), 283–299.
Baker,T., J.Gill and R. Solovay, Relativizations of the P=? NP question. SIAM J. Comput. 4 (1975), 431–442.
Bennett,C.H. and J.Gill, Relative to a random oracle A, PA≠NPA≠co-NPA with probability 1. SIAM J. Comput. 10 (1981), 96–113.
Book,R.V., Comparing complexity classes. J. Comput. System Sci. 9 (1974), 213–229.
Book,R.V., Bounded query machines: on NP and PSPACE. Theor. Comput. Sci. 15 (1981), 27–29.
Chandra,A.K., D.C.Kozen and L.J.Stockmeyer, Alternation. J. Assoc. Comput. Mach. 28 (1981), 114–133.
Hopcroft,J.E. and J.D.Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass. (1979).
Kurtz,S.A., On the random oracle hypothesis. Proc. 14th Ann. ACM Symp. on Theory of Computing (1982), 224–230.
Ladner,R.E. and N.A.Lynch, Relativization of questions about log space computability. Math. Systems Theory 10 (1976), 19–32.
Lynch,N.A., Log space machines with multiple oracle tapes. Theor. Comput. Sci. 6 (1978), 25–39.
Rogers,H.,Jr., Theory of Recursive Functions and Effective Computabitity. McGraw-Hill, New York (1967).
Ruzzo,W.L., J.Simon and M.Tompa, Space-bounded hierarchies and probabilistic computations. Proc. 14th Ann. ACM Symp. on Theory of Computing (1982), 215–223.
Simon,I., On Some Subrecursive Reducibilities. Ph.D. dissertation. Report STAN-CS-77-608, Dept. of Computer Science, Stanford University, Stanford, Ca. (1977).
Simon,J., On Some Central Problems in Computational Complexity. Ph.D. dissertation. Report TR 75-224, Dept. of Computer Science, Cornell University, Ithaca, N.Y. (1975)
Sipser,M., On relativizations and existence of complete sets. Proc. 9th Int. Colloq. on Automata, Languages, and Programming, Aarhus, Denmark (1982), 523–531.
Stockmeyer,L.J., The polynomial-time hierarchy. Theor. Comput. Sci. 3 (1976), 23–33.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Orponen, P. (1983). Complexity classes of alternating machines with oracles. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036938
Download citation
DOI: https://doi.org/10.1007/BFb0036938
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive