DocumentCode
3256520
Title
The generic oracle hypothesis fails
Author
Foster, James A.
Author_Institution
Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA
fYear
1992
fDate
28-30 May 1992
Firstpage
75
Lastpage
78
Abstract
According to the generic oracle hypothesis, results relativized to generic oracles are likely to represent the unrelativized world. The paper shows that the generic oracle hypothesis is false by demonstrating that IP G≠PsPACE G for even subrecursive variants of generic oracles G
Keywords
computability; computational complexity; generic oracle hypothesis; subrecursive variants; unrelativized world; Arithmetic; Computational complexity; Computer science; Intellectual property; Lead; Polynomials; Set theory; Turing machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
Conference_Location
Toronto, Ont.
Print_ISBN
0-8186-2812-X
Type
conf
DOI
10.1109/ICCI.1992.227701
Filename
227701
Link To Document