Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Why $PSPACE != Dtime(2^n)$? I can not see how padding argument can help here, how can it be proven?
If DTIME(2^n)=PSPACE then DTIME(2^poly)=PSPACE.
But, by the time hierarchy theorem, DTIME(2^n)⊊DTIME(2^poly)