Abstract

We show that, for an arbitrary function h(n) and each recursive function ℓ(n), that are separated by a nondeterministically fully space constructible g(n), such that h(n)Ω(g(n)) but ℓ(n)Ω(g(n)), there exists a unary language in NSPACE(h(n)) that is not contained in NSPACE(ℓ(n)). The same holds for the deterministic case.

The main contribution to the well-known Space Hierarchy Theorem is that (i) the language separating the two space classes is unary (tally), (ii) the hierarchy is independent of whether h(n) or ℓ(n) are in Ω(log n) or in o(log n), (iii) the functions h(n) or ℓ(n) themselves need not be space constructible nor monotone increasing, (iv) the hierarchy is established both for strong and weak space complexity classes. This allows us to present unary languages in such complexity classes as, for example, NSPACE(loglog n · log^* n)NSPACE(loglog n), using a plain diagonalization.

Author Keywords: Computational complexity; Space complexity