- If a language $A\in DSPACE(n^c)$, then $EXP^A\neq EXP$
- If a language $A\in DTIME(n^c)$, then $EXP^A= EXP$
What I tried:
Since it's impossible to show that $EXP \subseteq EXP^A$ because:
- We know that $DSPACE(n^c)\subseteq DTIME(2^{n^c})$
- exponential functions aren't closed to composition
- so from the above two, suppose we have a TM $M\in EXP$, such that M will simulate $A$ to compensate for not having a an oracle for A, this will yield a $O(2^{2^{n^c}})$ runtime.
It's true since simulating $A$ even an exponential amount will still be exponential since polynomials are closed to composition.