Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science & Scientific Computing)

Only 1 items left in stock

Description

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.

Product details

EAN/ISBN:: 9780122063824
Edition:: Revised.
Medium:: Bound edition
Number of pages:: 609
Publication date:: 1994-02-03
Publisher:: Academic Pr Inc
Languages:: english

EAN/ISBN:: 9780122063824
Edition:: Revised.
Medium:: Bound edition
Number of pages:: 609
Publication date:: 1994-02-03
Publisher:: Academic Pr Inc
Languages:: english

Shipping

Buy on Amazon

The edition supplied may vary.

Condition

Learn more

Condition€33.49

Used - good

€33.49

available immediately

€33.49

incl. VAT, plus Shipping costs

Checked second-hand items
Free shipping from €19
With you in 2-4 working days

More from Martin Davis

From Here to There: An As…

€38.40

A Cartographic Analysis o…

€181.89

Customer Service

Hotline

+49 30 488 288 200
Monday - Friday: 09.00 - 18.00 hr

International

Order safely

medimops magazine

The new medimops magazine

About us

Newsletter

Special offers, vouchers and much more! Subscribe to the newsletter and get a one-off 10% discount on your next purchase. By subscribing to the newsletter, you consent to your data being used by advertising partners for newsletter tracking and cross-channel advertising purposes in order to provide you with personalized recommendations and advertising. You can revoke your consent at any time with future effect. You can find further information in the data protection declaration.

Do you want to find out more?

Secure payment

Shipping partner

You can also find us here