[FOM] relativised complexity classes

[Martin Davis]

The well known Gill,Baker,Solovay theorem states that relative to a
computable oracle, the classes P and NP can be either equal or unequal,
depending on the specific oracle. What is known concerning similar results
for other complexity classes? In particular what about P and PSPACE?

Martin
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20151110/de366cce/attachment.html>