What does the Space Hierarchy Theorem establish, and how does it differ from the Time Hierarchy Theorem?
Correct! Well done.
Incorrect.
The correct answer is D) For space-constructible f(n), it proves DSPACE(o(f(n))) ⊊ DSPACE(f(n)) — a strictly tighter separation than the Time Hierarchy Theorem because space can be reused, removing the log-factor overhead needed for diagonalization in time
Correct Answer
For space-constructible f(n), it proves DSPACE(o(f(n))) ⊊ DSPACE(f(n)) — a strictly tighter separation than the Time Hierarchy Theorem because space can be reused, removing the log-factor overhead needed for diagonalization in time
The Space Hierarchy Theorem gives DSPACE(o(f(n))) ⊊ DSPACE(f(n)) for space-constructible f, a cleaner separation than the Time Hierarchy Theorem's DTIME(o(f(n)/log f(n))) ⊊ DTIME(f(n)). The gap is tighter because a diagonalizing machine can reuse space when simulating other machines, avoiding the bookkeeping overhead that costs a log factor in the time-based argument.