Savitch's Theorem: Computational Complexity Theory, Walter Savitch, Nondeterministic Turing machine, Deterministic Turing Machine, Recursion - Couverture souple

 
9786131154805: Savitch's Theorem: Computational Complexity Theory, Walter Savitch, Nondeterministic Turing machine, Deterministic Turing Machine, Recursion

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.