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: Introduction to Computing: Explorations in Language, Logic, and MachinesIntroduction to Computing: Explorations in Language, Logic, and Machines
by - 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.
(9544 views)
Book cover: Cellular Automata And Complexity: Collected PapersCellular Automata And Complexity: Collected Papers
by - Westview Press
These original papers on cellular automata and complexity provide a highly readable account of what has become a major new field of science, with important implications for computer science, physics, economics, biology, and many other areas.
(8523 views)
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.
(9013 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.
(3423 views)