Bounded Queries in Recursion Theory - William Levine,Georgia Martin
-40% ar kodu BOOKS
Piegāde 12-18 darba dienu laikā
30 dienu atgriešanas politika
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 ... Pilns apraksts
Jums varētu patikt arī
TOP
Determined: The Science of Life Without Free Will
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Light Eaters: How the Unseen World of Plant Intelligence Offers a New Understanding of Life on Earth
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-40% ar kodu BOOKS
Noliktavā
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Explaining AuDHD: The expert-led guide to Autism and ADHD Co-concurrence
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Secrets of our DNA: How Genetics has Changed the World
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How to Solve it: A New Aspect of Mathematical Method
-40% ar kodu BOOKS
Piegādātāja noliktavā
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
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Entangled Life: How Fungi Make Our Worlds, Change Our Minds and Shape Our Futures
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Life As No One Knows It: The Physics of Life's Emergence
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Janeway's Immunobiology
Leslie J. Berg, Kenneth Murphy, Casey Weaver
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Road to Reality: A Complete Guide to the Laws of the Universe
-40% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
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.
Vairāk informācijas
| Autors | William Levine, Georgia Martin |
|---|---|
| Izdevējs | Birkhäuser Boston |
| Series | Progress in Computer Science and Applied Logic |
| Izlaides gads | 2013 |
| Vāka tips | Mīkstais vāks |
| EAN | 9781461268482 |