Fortæl dine venner om denne vare:
Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 1999 edition
William Levine
Pris
DKK 861
Bestilles fra fjernlager
Forventes klar til forsendelse 3. - 9. jul.
Tilføj til din iMusic ønskeseddel
Eller
Findes også som:
Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 1999 edition
William Levine
The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.
366 pages, biography
| Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
| Udgivet | 13. juli 2013 |
| ISBN13 | 9781461268482 |
| Forlag | Springer-Verlag New York Inc. |
| Antal sider | 353 |
| Mål | 155 × 235 × 20 mm · 521 g |
| Sprog | Engelsk |
Se alt med William Levine ( f.eks. Hardcover bog og Paperback Bog )