Computability, Complexity, and Languages:; fundamentals of theoretical computer science

Davis, Martin; Weyuker, Elaine J.

ISBN 10: 0122063805 / ISBN 13: 9780122063800

Published by Academic Press, New York, 1983

About this Item

Black octavo; xix, 425 p: b&w ill.; 24 cm. Computer; Mathematics. Few faint marks to boards, ownership signature to front free endpaper crossed out in black ink, bright pages; tight binding. Near fine(-).

Seller Inventory # 78677

Bibliographic Details

• Title: Computability, Complexity, and Languages:; fundamentals of theoretical computer science
• Publisher: Academic Press, New York
• Publication Date: 1983
• Language: English
• ISBN 10: 0122063805
• ISBN 13: 9780122063800
• Binding: Hardcover
• Edition: Second printing.
• Condition: Near fine(-)

About this title

Synopsis

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.

From the Back Cover

This book is a rigorous but readable introduction to some of the central topics in theoretical computer science. The main subjects are computability theory, formal languages, logic and automated deduction, computational complexity (including NP-completeness), and programming language semantics.