Unformatted text preview: R L n-1 . When the computation of R L n-1 is complete, this value is returned as the result of the “oracle” call. There are no strings of negative length, so calls to the oracle L-1 may safely be rejected. R L n ∈ P ⊂ PSPACE , so the total memory usage is ≤ ( n + 1) * n c = O ( n c +1 ) ⊂ PSPACE . M decides L n and M ∈ PSPACE , therefore L n ∈ PSPACE . ± 1...
View Full Document
- Spring '08
- Computational complexity theory, Stefan Nelson-Lindall