{"product_id":"limits-of-computation","title":"Limits of Computation","description":"\u003cp\u003e\u003cstrong\u003eLimits of Computation: An Introduction to the Undecidable and the Intractable\u003c\/strong\u003e offers a gentle introduction to the theory of computational complexity. It explains the difficulties of computation, addressing problems that have no algorithm at all and problems that cannot be solved efficiently. \u003c\/p\u003e\u003cp\u003eThe book enables readers to understand:\u003c\/p\u003e\u003cul\u003e\n\u003cli\u003eWhat does it mean for a problem to be unsolvable or to be NP-complete?\u003c\/li\u003e\n\u003cli\u003eWhat is meant by a computation and what is a general model of a computer?\u003c\/li\u003e\n\u003cli\u003eWhat does it mean for an algorithm to exist and what kinds of problems have no algorithm?\u003c\/li\u003e\n\u003cli\u003eWhat problems have algorithms but the algorithm may take centuries to finish?\u003c\/li\u003e\n\u003c\/ul\u003e\u003cp\u003eDeveloped from the authors’ course on computational complexity theory, the text is suitable for advanced undergraduate and beginning graduate students without a strong background in theoretical computer science. Each chapter presents the fundamentals, examples, complete proofs of theorems, and a wide range of exercises.\u003c\/p\u003e","brand":"Taylor \u0026 Francis Inc","offers":[{"title":"Default Title","offer_id":54246033686872,"sku":"9781439882061","price":117.99,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0278\/1295\/4195\/files\/9781439882061.jpg?v=1777777274","url":"https:\/\/agendabookshop.com\/products\/limits-of-computation","provider":"Agenda Bookshop","version":"1.0","type":"link"}