Fortæl dine venner om denne vare:
Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic 1999 edition
William Levine
Pris
₪ 465
Bestilles fra fjernlager
Forventes klar til forsendelse 4. - 10. jul.
Tilføj til din iMusic ønskeseddel
Eller
Findes også som:
Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic 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.
353 pages, biography
| Medie | Bøger Hardcover bog (Bog med hård ryg og stift omslag) |
| Udgivet | 23. december 1998 |
| ISBN13 | 9780817639662 |
| Forlag | Birkhauser Boston Inc |
| Antal sider | 353 |
| Mål | 155 × 235 × 22 mm · 703 g |
| Sprog | Engelsk |
Se alt med William Levine ( f.eks. Hardcover bog og Paperback Bog )