# Tag Info

The answer depends on the coding of $n$. The set $\{(M,x,1^n) | \text{ TM } M \text{ accepts }x \text{ within } n \text{ tape space } \}$ is $PSPACE$-complete. But the set $\{(M,x,n) | \text{ TM } M \text{ accepts }x \text{ within } n \text{ tape space } \}$ where $n$ is binary coded is $EXPSPACE$-complete.