This is what I found on the web, but why is this true? Can somebody explain it as simply as possible, please?
In other words, if a nondeterministic Turing machine can solve a problem using f(n) space, an ordinary deterministic Turing machine can solve the same problem in the square of that space bound.