Computability, complexity, and languages: Fundamentals of theoretical computer science (Computer science and applied mathematics)

Davis, Martin

ISBN 10: 0122063805 / ISBN 13: 9780122063800

Published by Academic Press, 1983

About this Item

1983; Florida; black cloth covered boards with gilt titles; light wear; interior clean and unmarked; 8vo - over 7 3/4" to 9 3/4" tall; previous owner's name on ffep; 425 pages.

Seller Inventory # SKU1114296

Bibliographic Details

• Title: Computability, complexity, and languages: Fundamentals of theoretical computer science (Computer science and applied mathematics)
• Publisher: Academic Press
• Publication Date: 1983
• Language: English
• ISBN 10: 0122063805
• ISBN 13: 9780122063800
• Binding: Hardcover
• Condition: Fair

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.