Non-Fiction Books:

Bounded Queries in Recursion Theory

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!
$294.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $73.50 with Afterpay Learn more

6 weekly interest-free payments of $49.00 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 13-25 June using International Courier

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.
Release date NZ
July 13th, 2013
Audience
  • Professional & Vocational
Illustrations
XIII, 353 p.
Pages
353
Dimensions
155x235x20
ISBN-13
9781461268482
Product ID
21839767

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...