{"product_id":"9780262048620","title":"Computability and Complexity","description":"\u003ctable\u003e\u003ctbody\u003e\n\u003ctr\u003e\n\u003ctd style=\"\"\u003e\u003cstrong\u003eAuthor\/Contributor(s):\u003c\/strong\u003e\u003c\/td\u003e\n\u003ctd style=\"\"\u003eChen, Hubie\u003cbr\u003e\n\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003ctr\u003e\n\u003ctd style=\"\"\u003e\u003cstrong\u003ePublisher:\u003c\/strong\u003e\u003c\/td\u003e\n\u003ctd\u003eThe MIT Press\u003cbr\u003e\n\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003ctr\u003e\n\u003ctd style=\"\"\u003e\u003cstrong\u003eDate:\u003c\/strong\u003e\u003c\/td\u003e\n\u003ctd\u003e8\/29\/2023\u003cbr\u003e\n\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003ctr\u003e\n\u003ctd style=\"\"\u003e\u003cstrong\u003eBinding:\u003c\/strong\u003e\u003c\/td\u003e\n\u003ctd style=\"\"\u003eHardcover\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003ctr\u003e\n\u003ctd style=\"\"\u003e\u003cstrong\u003eCondition:\u003c\/strong\u003e\u003c\/td\u003e\n\u003ctd style=\"\"\u003eNEW\u003cbr\u003e\n\u003c\/td\u003e\n\u003c\/tr\u003e\n\u003c\/tbody\u003e\u003c\/table\u003e\u003cb\u003eA clear, comprehensive, and rigorous introduction to the theory of computation.\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003eWhat is computable? What leads to efficiency in computation?  \u003ci\u003eComputability and Complexity\u003c\/i\u003e offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers the core notions, techniques, methods, and questions of the theory of computation before turning to several advanced topics. Emphasizing intuitive learning and conceptual discussion, this textbook’s accessible approach offers a robust foundation for understanding both the reach and restrictions of algorithms and computers.\u003cbr\u003e\u003cbr\u003e\u003cul\u003e\n\u003cli\u003eExtensive exercises and diagrams enhance streamlined, student-friendly presentation of mathematically rigorous material\u003c\/li\u003e\n\u003cli\u003eIncludes thorough treatment of automata theory, computability theory, and complexity theory—including the P versus NP question and the theory of NP-completeness\u003c\/li\u003e\n\u003cli\u003eSuitable for undergraduate and graduate students, researchers, and professionals\u003c\/li\u003e\n\u003c\/ul\u003e","brand":"The MIT Press","offers":[{"title":"Default Title","offer_id":44214490857727,"sku":"9780262048620","price":65.0,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0452\/0886\/2873\/files\/9780262048620_s600x595.jpg?v=1775590046","url":"https:\/\/massivebookshop.com\/de\/products\/9780262048620","provider":"MASSIVE BOOKSHOP","version":"1.0","type":"link"}