High Quality Content by WIKIPEDIA articles! In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, states that for any function (n) ? log(n). 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. Although it seems that nondeterminism may produce exponential gains in time, this theorem shows that it has a markedly more limited effect on space requirements.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.