Computability, Complexity and Languages - Fundamentals of Theoretical Computer Science (Hardcover, 2nd edition)

This introductory text 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.

General

Imprint:	Academic Press Inc.(London) Ltd
Country of origin:	United States
Series:	Computer Science & Scientific Computing Series
Release date:	March 1994
First published:	February 1994
Authors:	Martin Davis • Ron Sigal • Elaine J. Weyuker
Dimensions:	232 x 157 x 42mm (L x W x T)
Format:	Hardcover
Pages:	609
Edition:	2nd edition
ISBN-13:	978-0-12-206382-4
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > Computer programming > Programming languages > General
LSN:	0-12-206382-1
Barcode:	9780122063824

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!