Separation of PSPACE and EXP

TL;DR

This paper proves that PSPACE and EXP are distinct complexity classes using a novel proof technique that involves limits of Turing machine acceptance times and recursion theory, bypassing the relativization barrier.

Contribution

It introduces a new proof method to separate PSPACE and EXP, leveraging limits and recursion theory in complexity class analysis.

Findings

PSPACE is not equal to EXP.

A new proof technique for class separation.

Application of recursion theory to complexity classes.

Abstract

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.