Share
Bounded Queries in Recursion Theory (in English)
William Levine
(Author)
·
Georgia Martin
(Author)
·
Birkhauser
· Paperback
Bounded Queries in Recursion Theory (in English) - Levine, William ; Martin, Georgia
$ 104.20
$ 109.99
You save: $ 5.79
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Monday, June 03 and
Tuesday, June 04.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Bounded Queries in Recursion Theory (in English)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
