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.
(8881 views)
Book cover: Languages and MachinesLanguages and Machines
by - Macquarie University
This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.
(13279 views)
Book cover: Bayesian Computational MethodsBayesian Computational Methods
by - arXiv
We will first present the most standard computational challenges met in Bayesian Statistics, focusing primarily on mixture estimation and on model choice issues, and then relate these problems with computational solutions.
(4188 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.
(2535 views)