Pastāsti draugiem par šo preci:
Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic William Levine 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.
353 pages, biography
| Mediji | Grāmatas Hardcover Book (Grāmata ar cieto muguriņu un vāku) |
| Izlaists | 1998. gada 23. decembris |
| ISBN13 | 9780817639662 |
| Izdevēji | Birkhauser Boston Inc |
| Lapas | 353 |
| Izmēri | 155 × 235 × 22 mm · 703 g |
| Valoda | Angļu |