{"product_id":"bounded-queries-in-recursion-theory-von-william-s-levine-georgia-martin","title":"Bounded Queries in Recursion Theory","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.\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9781461268482\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9781461268482","offer_id":39415342202973,"sku":"9781461268482","price":106.99,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/5ee3f68c-0542-45fe-9486-aa66733af1fc.jpg?v=1772168597","url":"https:\/\/shop.autorenwelt.de\/products\/bounded-queries-in-recursion-theory-von-william-s-levine-georgia-martin","provider":"Autorenwelt Shop","version":"1.0","type":"link"}