Fortell venner om denne varen:
Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 1999 edition
William Levine
Pris
S$ 136,50
Bestillingsvarer
Forventes levert 7. - 15. jul
Legg til iMusic ønskeliste
Eller
Finnes 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
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 13. juli 2013 |
| ISBN13 | 9781461268482 |
| Utgivere | Springer-Verlag New York Inc. |
| Antall sider | 353 |
| Mål | 155 × 235 × 20 mm · 521 g |
| Språk | Engelsk |
Se alt med William Levine ( f.eks. Pocketbok og Innbunden bok )