{"product_id":"9780817639662","title":"Progress in Computer Science and Applied Logic","description":"\u003ch1\u003eProgress in Computer Science and Applied Logic\u003c\/h1\u003e \u003ch2\u003eLevine, William; Martin, Georgia\u003c\/h2\u003e \u003cp\u003eOne 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Birkhäuser\u003c\/p\u003e \u003cp\u003ePublication Date: 1998-12-23\u003c\/p\u003e \u003cp\u003eFormat: Hardcover\u003c\/p\u003e \u003cp\u003eISBN-13: 9780817639662\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4612-0635-4\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 353\u003c\/p\u003e ","brand":"Birkhäuser Boston","offers":[{"title":"Default Title","offer_id":45578540318860,"sku":"9780817639662","price":98.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9780817639662.jpg?v=1771520050","url":"https:\/\/lateknightbooks.com\/products\/9780817639662","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}