Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Hardcover
by Martin Davis (Author), Ron Sigal (Author), Elaine J. Weyuker (Author)
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.
This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.
Made with care and unconditionally loved by our customers, this signature bestseller exceeds all expectations.
Made with care and unconditionally loved by our customers, this signature bestseller exceeds all expectations.
At the heart of every product lies a unique story, driven by our passion for quality and innovation. Each item enhances your everyday life and sparks joy.