Computability, Complexity and Languages: Fundamentals of Theoretical Computer Sciences

Front Cover
Academic Press, 1983 - Computers - 425 pages
0 Reviews
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. Key Features * 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 inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Programs and Computable Functions
15
Primitive Recursive Functions
32
PRC Classes
34
Copyright

84 other sections not shown

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information