William Levine

(Author)

Bounded Queries in Recursion Theory (1999)Hardcover - 1999, 23 December 1998

Bounded Queries in Recursion Theory (1999)
Qty
1
Turbo
Ships in 2 - 3 days
In Stock
Free Delivery
Cash on Delivery
15 Days
Free Returns
Secure Checkout
Buy More, Save More
Part of Series
Progress in Computer Science and Applied Logic
Part of Series
Progress in Gene Expression
Part of Series
Progress in Computer Science and Applied Logic (PCs)
Print Length
353 pages
Language
English
Publisher
Birkhauser
Date Published
23 Dec 1998
ISBN-10
0817639667
ISBN-13
9780817639662

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.

Product Details

Authors:
William LevineGeorgia Martin
Book Edition:
1999
Book Format:
Hardcover
Country of Origin:
US
Date Published:
23 December 1998
Dimensions:
23.39 x 15.6 x 2.24 cm
ISBN-10:
0817639667
ISBN-13:
9780817639662
Language:
English
Location:
Boston, MA
Pages:
353
Publisher:
Weight:
703.07 gm

Related Categories


Need Help?
+971 6 731 0280
support@gzb.ae

About UsContact UsPayment MethodsFAQsShipping PolicyRefund and ReturnTerms of UsePrivacy PolicyCookie Notice

VisaMastercardCash on Delivery

© 2024 White Lion General Trading LLC. All rights reserved.