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 ...
Read More
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.
Read Less
Add this copy of Bounded Queries in Recursion Theory to cart. $19.34, good condition, Sold by ThriftBooks-Atlanta rated 5.0 out of 5 stars, ships from Austell, GA, UNITED STATES, published 1998 by Birkhauser.
Add this copy of Bounded Queries in Recursion Theory (Progress in to cart. $19.60, very good condition, Sold by Midtown Scholar Bookstore rated 5.0 out of 5 stars, ships from Harrisburg, PA, UNITED STATES, published 1998 by Birkhäuser.
Add this copy of Bounded Queries in Recursion Theory (Progress in to cart. $34.95, good condition, Sold by Orca Knowledge Systems, Inc rated 5.0 out of 5 stars, ships from Novato, CA, UNITED STATES, published 1998 by Birkhäuser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. First Edition. No DJ. Ex University of California, Berkeley library book with usual library markings. Binding is tight, text clean. From the back cover: One of the major concerns of theoretical computer science is the classification 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.
Add this copy of Bounded Queries in Recursion Theory (Progress in to cart. $50.29, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1998 by Birkhäuser.
