
Vertel uw vrienden over dit artikel:
Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic 1999 edition
William Levine
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
Media | Boeken Hardcover Book (Boek met harde rug en kaft) |
Vrijgegeven | 23 december 1998 |
ISBN13 | 9780817639662 |
Uitgevers | Birkhauser Boston Inc |
Pagina's | 353 |
Afmetingen | 155 × 235 × 22 mm · 703 g |
Taal en grammatica | Engels |
Bekijk alles van William Levine ( bijv. Hardcover Book en Paperback Book )