# More space complexity: Savitch's Theorem

1. Jan 31, 2005

### gnome

On Sipser page 279:
If a branch of an NTM uses f(n) space, we know that f(n) is the maximum number of (input) tape cells that it scans on any branch of its computation for an input of length n. But we don't know how many times it runs back and forth over those cells before the computation branch finishes. So how does he determine that such a branch may run for $2^{O(f(n))}$ steps only? Why not, for example, $2^{O(f(n^2))}$? Or maybe some much lower limit? I don't know. Any ideas where this $2^{O(f(n))}$ comes from?

Last edited: Jan 31, 2005