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.) (9780122063824) — Readings Books

Become a Readings Member to make your shopping experience even easier. Sign in or sign up for free!

Become a Readings Member. Sign in or sign up for free!

Hello Readings Member! Go to the member centre to view your orders, change your details, or view your lists, or sign out.

Hello Readings Member! Go to the member centre or sign out.

In Victoria? Order in-stock items by Sunday 14 December to get your gifts by Christmas! Or find the deadline for your state here.

Cart ⚙️
Home / Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
Hardback

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.)
$280.99
Add to wishlist
Sign in or become a Readings Member to add this title to your wishlist.

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.

Read More
In Shop
Out of stock
Shipping & Delivery

$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout

MORE INFO

Stock availability can be subject to change without notice. We recommend calling the shop or contacting our online team to check availability of low stock items. Please see our Shopping Online page for more details.

Format
Hardback
Publisher
Elsevier Science & Technology
Country
United States
Date
18 March 1994
Pages
609
ISBN
9780122063824

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.

Read More
Format
Hardback
Publisher
Elsevier Science & Technology
Country
United States
Date
18 March 1994
Pages
609
ISBN
9780122063824

Looking for something in particular?

Search our extensive online catalogue.