Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) / Davis, Martin


Computability, 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.

Now you can buy Books online in USA,UK, India and more than 100 countries.
*Terms and Conditions apply
Disclaimer: All product data on this page belongs to buy amazon.
No guarantees are made as to accuracy of prices and information.

Contact Us

Create a Bookshelf of your Favorite books
Get it on Google Play        Get it on Google Play
For Any Queries please don't hesitate to contact us at
USA +1(760)3380762
+1(650) 9808080
India +91 9023011224
India +91 9023011224 (Whatsapp)
Donate
Buy Books online because as an Amazon Associate we earn from qualifying purchases.