PSPACE and DTIME $2^{cn}$ This is a HW question that I'm stuck on and was hoping for some help.
we're supposed to prove that:


  PSPACE not equals DTIME($2^{cn}$) for every $c&gt;0$ (or actually for the union of all $c&gt;0$)
This can be proved by contradiction. You can use the fact that $PSPACE$ language remains $PSPACE$ if we remove polynomial length padding, where as $DTIME$ does not.