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.

翻译：本文证明了PSPACE不等于EXP。通过一种简单而新颖的证明技术，成功分离了这两个复杂性类。本文计算了当运行时间受限时任意图灵机是否接受某一输入，随后将时间限制趋于无穷。由此，递归理论的方法可被应用于计算复杂性理论的问题，且不违反相对化障碍。