{"product_id":"9780080502465","title":"Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science","description":"\u003ci\u003eComputability, Complexity, and Languages\u003c\/i\u003e 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.\u003cul\u003e\n\u003cli\u003eComputability 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.\u003c\/li\u003e\n\u003cli\u003eThe number of exercises included has more than tripled.\u003c\/li\u003e\n\u003cli\u003eAutomata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.\u003c\/li\u003e\n\u003c\/ul\u003e","brand":"Elsevier Science","offers":[{"title":"Default Title","offer_id":47079399653616,"sku":"9780080502465","price":72.95,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9780080502465_p0.jpg?v=1763638068","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9780080502465","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}