Bounded Queries in Recursion Theory - Georgia Martin,William Levine
-20% with code BOOKS
Shipping in 22-28 days
30-day return policy
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. 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). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there e ... Full description
You May Also Like
TOP
Determined: The Science of Life Without Free Will
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-20% with code BOOKS
In stock at our supplier
TOP
Factfulness: Ten Reasons We're Wrong About the World--and Why Things Are Better Than You Think
Ola Rosling, Anna Rosling Rönnlund, Hans Rosling
-20% with code BOOKS
In stock at our supplier
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-20% with code BOOKS
In stock at our supplier
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
The Light Eaters: How the Unseen World of Plant Intelligence Offers a New Understanding of Life on Earth
-20% with code BOOKS
In stock at our supplier
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-20% with code BOOKS
In stock at our supplier
TOP
The Secrets of our DNA: How Genetics has Changed the World
-20% with code BOOKS
In stock at our supplier
TOP
Janeway's Immunobiology
Leslie J. Berg, Kenneth Murphy, Casey Weaver
-20% with code BOOKS
In stock at our supplier
TOP
How to Solve it: A New Aspect of Mathematical Method
-20% with code BOOKS
In stock at our supplier
TOP
Behave: The Biology of Humans at Our Best and Worst
-20% with code BOOKS
In stock at our supplier
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-20% with code BOOKS
In stock
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-20% with code BOOKS
In stock at our supplier
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-20% with code BOOKS
In stock at our supplier
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-20% with code BOOKS
In stock at our supplier
TOP
The Brain That Changes Itself: Stories of Personal Triumph from the Frontiers of Brain Science
-20% with code BOOKS
In stock at our supplier
TOP
Thing Explainer: Complicated Stuff in Simple Words
-20% with code BOOKS
In stock at our supplier
Description
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. 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). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.
More Information
| Author | Georgia Martin, William Levine |
|---|---|
| Publisher | Birkhäuser Boston |
| Series | Progress in Computer Science and Applied Logic |
| Release year | 1998 |
| Cover type | Hardcover |
| EAN | 9780817639662 |