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

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.

• Computability and Unsolvability
• The Universal Computer: The Road from Leibniz to Turing
• The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Second Edition (Springer Series in Statistics)
• Mathematical Logic (Dover Books on Mathematics)
• An Introduction to Mathematical Logic (Dover Books on Mathematics)
• Clean Architecture: A Craftsman's Guide to Software Structure and Design (Robert C. Martin Series)
• Theory of Recursive Functions and Effective Computability (The MIT Press)
• Computational Complexity: A Modern Approach
• The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions (Dover Books on Mathematics)
• The Nature of Computation