It is not the case that NPSPACE ⊆ DSPACE(f(n)²) proves non-determinism is ultimately eliminable for space—the bound, however quadratic, is still polynomial and computable.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.