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

by John E. Savage

**Publisher**: Addison-Wesley 1998**ISBN/ASIN**: 0201895390**ISBN-13**: 9780201895391**Number of pages**: 698

**Description**:

John Savage re-examines theoretical computer science, offering a fresh approach that gives priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint reflects a pedagogy motivated by the growing importance of computational models that are more realistic than the abstract ones studied in the 1950s, '60s and early '70s.

Download or read it online for free here:

**Download link**

(4.3MB, PDF)

## Similar books

**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.

(

**13708**views)

**Applicative Computing: Its quarks, atoms and molecules**

by

**V. E. Wolfengagen**-

**JurInfoR**

This work covers the advanced topics in main ideas of computing in general. Material is especially useful for the instructor, postgraduate and graduate students of IT-specialties and is suitable for the system of training of specialists.

(

**11368**views)

**An Introduction to the Theory of Computation**

by

**Eitan Gurari**-

**Computer Science Pr**

The book explores questions and terminologies concerning programs, computers, and computation. The exploration reduces to a study of mathematical theories, such as those of automata and formal languages, theories interesting in their own right.

(

**29114**views)

**Rule-based Computation and Deduction**

by

**Helene Kirchner, Pierre-Etienne Moreau**-

**ESSLLI**

This text first introduces the concept of rewriting which is behind rule-based systems. Then the rewriting logic and the rewriting calculus are defined and shown to be especially suited to describing concurrent and non-deterministic computations.

(

**8386**views)