{"product_id":"computability-complexity-and-languages-fundamentals-of-theoretical-computer-science-computer-science-and-scientific-computing-0122063821","title":"Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)","description":"\u003cp\u003e\u003cstrong\u003eISBN:\u003c\/strong\u003e 0122063821\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eAuthor:\u003c\/strong\u003e Davis, Martin\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eCondition:\u003c\/strong\u003e New\u003c\/p\u003e\u003cp\u003eComputability, Complexity, and Languages is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a \"universal\" program that takes up less than a page. The number of exercises included has more than tripled. Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.\u003c\/p\u003e","brand":"Mia Karts","offers":[{"title":"Default Title","offer_id":51531152294176,"sku":"NEW0122063821","price":82.17,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0980\/7426\/3840\/files\/61Yn4hFvh0L.jpg?v=1777274343","url":"https:\/\/miakarts.com\/products\/computability-complexity-and-languages-fundamentals-of-theoretical-computer-science-computer-science-and-scientific-computing-0122063821","provider":"Miakarts Books","version":"1.0","type":"link"}