Logo

Models of Computation: Exploring the Power of Computing

Large book cover: Models of Computation: Exploring the Power of Computing

Models of Computation: Exploring the Power of Computing
by

Publisher: Addison-Wesley
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.

Home page url

Download or read it online for free here:
Download link
(4.3MB, PDF)

Similar books

Book cover: Logic and ProofLogic and Proof
by - 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.
(7855 views)
Book cover: An Introduction to the Theory of ComputationAn Introduction to the Theory of Computation
by - 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.
(22997 views)
Book cover: Introduction to Theory of ComputationIntroduction to Theory of Computation
by - Carleton University
This is a textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.
(2271 views)
Book cover: Rule-based Computation and DeductionRule-based Computation and Deduction
by - 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.
(3934 views)