Povedzte o tejto položke priateľom:
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
| Médium | Knihy Paperback Book (Kniha s mäkkou väzbou a lepeným chrbtom) |
| Vydané | 13. júla 2013 |
| ISBN13 | 9781461268482 |
| Vydavatelia | Springer-Verlag New York Inc. |
| Strany | 353 |
| Rozmery | 155 × 235 × 20 mm · 521 g |
| Jazyk | Angličtina |
Viac od toho istého vydavateľa
Pozrieť všetko od William Levine ( napr. Hardcover Book a Paperback Book )