Recursion theory computational complexity (10 Ergebnisse)

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Paperback or Softback. Zustand: New. Recursion Theory and Computational Complexity: Lectures Given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) Held in Bre. Book.

Zustand: New.

Zustand: New. In English.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Kartoniert / Broschiert. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Now available with SpringerS. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the.…

Taschenbuch. Zustand: Neu. Savitch's Theorem | Computational Complexity Theory, Walter Savitch, Nondeterministic Turing machine, Deterministic Turing Machine, Recursion | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131154805 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…