3.Next

In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic space complexity. It states that for any space-constructable function ,
:

In other words, if a nondeterministic Turing machine

3.Next