It is not the case that The claim that NSPACE(f(n)) ⊆ TIME(2^O(f(n))) relies on f(n) being space-constructible, a condition that smuggles in a non-trivial computability assumption.
?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.