# Why $PSPACE!=Dtime(2^n)$? [closed]

Why $$PSPACE != Dtime(2^n)$$? I can not see how padding argument can help here, how can it be proven?

## closed as off-topic by Kristoffer Arnsfelt Hansen, Marzio De Biasi, Jan Johannsen, Emil Jeřábek, GamowOct 31 '18 at 10:24

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – Kristoffer Arnsfelt Hansen, Marzio De Biasi, Jan Johannsen, Emil Jeřábek, Gamow
If this question can be reworded to fit the rules in the help center, please edit the question.

• I don't understand. What is the factorial of PSPACE? – Jan Johannsen Oct 31 '18 at 9:45
• @Jan Johannsen - I assume that it represents the "not equal ≠ " sign in C programming language – Avi Tal Oct 31 '18 at 10:24