Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science

Martin Davis (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.),Ron Sigal (Consultant, New Haven, Connecticut, U.S.A.),Elaine J. Weyuker (AT&T Labs Research, Florham Park, New Jersey, U.S.A.)

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
Format
Hardback
Publisher
Elsevier Science & Technology
Country
United States
Published
18 March 1994
Pages
609
ISBN
9780122063824

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science

Martin Davis (Courant Institute of Mathematical Sciences of New York University, New York, U.S.A.),Ron Sigal (Consultant, New Haven, Connecticut, U.S.A.),Elaine J. Weyuker (AT&T Labs Research, Florham Park, New Jersey, U.S.A.)

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.

This item is not currently in-stock. It can be ordered online and is expected to ship in approx 2 weeks

Our stock data is updated periodically, and availability may change throughout the day for in-demand items. Please call the relevant shop for the most current stock information. Prices are subject to change without notice.

Sign in or become a Readings Member to add this title to a wishlist.