Welcome To Our Store.
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
0 $0.00 USD
1 2

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Hardcover
$131.31 USD
$131.31 USD
Sale Sold out
Shipping calculated at checkout.
In stock (100 units), ready to be shipped

Available Offers

Fast delivery available on most orders

Multiple secure payment options accepted
Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

 View Product Details
Product Product subtotal Quantity Price Product subtotal
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Hardcover
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Hardcover
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Hardcover
$131.31/ea		 $0.00
$131.31/ea $0.00

Product Description

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.

Back Jacket

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.

Number of Pages: 609
Dimensions: 1.87 x 9.26 x 6.44 IN
Illustrated: Yes
Publication Date: February 03, 1994
you might like