Pastāsti draugiem par šo preci:
Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic William Levine Softcover reprint of the original 1st ed. 1999 edition
Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2013. gada 13. jūlijs |
| ISBN13 | 9781461268482 |
| Izdevēji | Springer-Verlag New York Inc. |
| Lapas | 353 |
| Izmēri | 155 × 235 × 20 mm · 521 g |
| Valoda | Angļu |