**An Introduction to the Theory of Computation**

by Eitan Gurari

**Publisher**: Computer Science Pr 1989**ISBN/ASIN**: 0716781824**ISBN-13**: 9780716781820**Number of pages**: 600

**Description**:

This book explores some of the more important terminologies and questions concerning programs, computers, problems, and computation. The exploration reduces in many cases to a study of mathematical theories, such as those of automata and formal languages; theories that are interesting also in their own right. These theories provide abstract models that are easier to explore, because their formalisms avoid irrelevant details.

Download or read it online for free here:

**Download link**

(6.4MB, PDF)

## Similar books

**Introduction to Computing: Explorations in Language, Logic, and Machines**

by

**David Evans**-

**University of Virginia**

An introduction to the most important ideas in computing. It focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the limits of what can be computed mechanically.

(

**9250**views)

**Models of Computation: Exploring the Power of Computing**

by

**John E. Savage**-

**Addison-Wesley**

The book re-examines computer science, giving priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint is motivated by more realistic computational models.

(

**4422**views)

**Logic and Proof**

by

**Lawrence C Paulson**-

**University of Cambridge**

These lecture notes give a brief introduction to logic, with including the resolution method of theorem-proving and its relation to the programming language Prolog. Formal logic is used for specifying and verifying computer systems.

(

**8682**views)

**Galois Connections and Fixed Point Calculus**

by

**Roland Backhouse**

The book on the fundamental algebraic structures in the mathematics of program construction focusing the algebraic properties of recursion and how these are applied to the generic solution of programming problems. The tutorial covers fixed point calculus.

(

**8219**views)