Separation of PSPACE and EXP

04/28/2021

∙

by   Reiner Czerwinski, et al.

∙

0

∙

share

This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this paper. Then, the limit goes to infinity. Thus, methods of the recursion theory can be applied to problems of computational complexity theory without violating the relativization barrier.