Introduction to the Theory of Computation

Sipser, Michael

ISBN 10: 053494728X / ISBN 13: 9780534947286

Published by PWS Pub. Co., Boston, MA, 1997

About this Item

Condition: Near Fine.

Hardback.

First Edition, First Printing.

Glossy pictorial boards show light shelf wear, including a small bump at the lower spine corner and several tiny pinprick impressions at the upper front corner. Binding remains tight and square. Pages are clean, bright, and unmarked with no highlighting, underlining, or ownership marks observed. A clean, well-preserved copy of this influential computer science text. Listing photos show the exact copy included in this sale.

Foundational computer science textbook introducing automata theory, formal languages, computability, Turing machines, decidability, NP-completeness, and computational complexity through Michael Sipser's widely adopted presentation of the mathematical foundations of computation. Used in undergraduate and graduate theory of computation courses and valued by students, software engineers, researchers, and self-learners seeking a rigorous yet accessible introduction to theoretical computer science.

Seller Inventory # W_272

Bibliographic Details

• Title: Introduction to the Theory of Computation
• Publisher: PWS Pub. Co., Boston, MA
• Publication Date: 1997
• Language: English
• ISBN 10: 053494728X
• ISBN 13: 9780534947286
• Binding: Hardcover
• Edition: 1st Edition
• Printing: 1st Printing
• Condition: Near Fine
• Dimensions: 6.75W x 9.5H x 0.8D inches 6.75 inches width by 9.5 inches height by 0.8 inches depth
• Weight: 1.601 pounds
• Seller catalogs:
  • Technology
  • Science Books
  • Mathematics

About this title

Synopsis

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.

About the Author

Dr. Sipser has been at MIT teaching and doing research in computational complexity theory for the past 24 years. He has published on a variety of areas, including circuit complexity, interactive proof systems, probabilistic computation and quantum computation. He enjoys lecturing, and has given courses ranging from freshman calculus to advanced seminars in complexity. In addition to MIT, he has held positions at the University of California/Berkeley and at IBM research.