Introduction to the Theory of Computation

Sipser, Michael

ISBN 10: 053494728X / ISBN 13: 9780534947286

Verlag: PWS Pub. Co., 1996

Beschreibung

May have some shelf-wear due to normal use. Your purchase funds free job training and education in the greater Seattle area. Thank you for supporting Goodwills nonprofit mission! Bestandsnummer des Verkäufers 0KVOTW001MW5

Bibliografische Details

Titel: Introduction to the Theory of Computation

Verlag: PWS Pub. Co.

Erscheinungsdatum: 1996

Einband: Hardcover

Zustand: Good

Über diesen Titel

Inhaltsangabe:

Provides an overview of computational theory grounded in mathematical theorems and proofs. The author aims to increase students' knowledge of conceptual tools used in computer engineering, as well as the aesthetic sense required to build elegant systems.

Reseña del editor:

Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and the students will learn. His emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser - a noted authority on the theory of computation - builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own. INTRODUCTION TO THE THEORY OF COMPUTATION provides a mathematical treatment of computation theory grounded in theorems and proofs. Proofs are presented with a "proof idea" component to reveal the concepts underpinning the formalism. Algorithms are presented using prose instead of pseudocode to focus attention on the algorithms themselves, rather than on specific computational models. Topic coverage, terminology, and order of presentation are traditional for an upper-level course in computer science theory. Users of the Preliminary Edition (now out of print) will be interested to note several new chapters on complexity theory: Chapter 8 on space complexity; Chapter 9 on provable intractability, and Chapter 10 on advanced topics, including approximation algorithms, alternation, interactive proof systems, cryptography, and parallel computing.