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.
"synopsis" may belong to another edition of this title.
"Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory--including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.
Michael Sipser has taught theoretical computer science and mathematics at the Massachusetts Institute of Technology for the past 32 years. He is a Professor of Applied Mathematics, a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL), and the current head of the mathematics department. He enjoys teaching and pondering the many mysteries of complexity theory.
"About this title" may belong to another edition of this title.
Shipping:
US$ 3.99
Within U.S.A.
Shipping:
FREE
Within U.S.A.
Seller: Seattle Goodwill, Seattle, WA, U.S.A.
hardcover. Condition: Good. 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 Goodwill's nonprofit mission!. Seller Inventory # 0KVOTW001MW5
Quantity: 2 available
Seller: SecondSale, Montgomery, IL, U.S.A.
Condition: Good. Very Good. Seller Inventory # 00080219683
Quantity: 1 available
Seller: Books Unplugged, Amherst, NY, U.S.A.
Condition: Good. Buy with confidence! Book is in good condition with minor wear to the pages, binding, and minor marks within 1.65. Seller Inventory # bk053494728Xxvz189zvxgdd
Quantity: 1 available
Seller: Book Deals, Tucson, AZ, U.S.A.
Condition: Fair. Acceptable/Fair condition. Book is worn, but the pages are complete, and the text is legible. Has wear to binding and pages, may be ex-library. 1.65. Seller Inventory # 353-053494728X-acp
Quantity: 1 available
Seller: Ergodebooks, Houston, TX, U.S.A.
Hardcover. Condition: Good. 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. Seller Inventory # SONG053494728X
Quantity: 1 available
Seller: HPB Inc., Dallas, TX, U.S.A.
Hardcover. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority!. Seller Inventory # S_422411709
Quantity: 1 available
Seller: Goodwill of Greater Milwaukee and Chicago, Racine, WI, U.S.A.
Condition: acceptable. Book is considered to be in acceptable condition. The actual cover image may not match the stock photo. Book may have one or more of the following defects: noticeable wear on the cover dust jacket or spine; curved, dog eared or creased page s ; writing or highlighting inside or on the edges; sticker s or other adhesive on cover; CD DVD may not be included; and book may be a former library copy. Seller Inventory # SEWV.053494728X.A
Quantity: 1 available
Seller: Book Reading, Artesia, CA, U.S.A.
Condition: Fair. IMP: Acceptable- Do not include ACCESS CODE, CD-ROM or companion materials even if stated in item title. It may contain highlighting/markings throughout, and the covers and corners may show shelf wear. Corners, pages may be dent. All text is legible. Seller Inventory # A053494728X
Quantity: 1 available
Seller: Book Reading, Artesia, CA, U.S.A.
Condition: Good. IMP: Used Good- Used items do not include CD-ROM, ACCESS CODE or companion materials, regardless of what is stated in item title. We ship from multiple locations. Prompt customer service. Seller Inventory # G053494728X
Quantity: 1 available
Seller: a2zbooks, Burgin, KY, U.S.A.
Hardcover. Condition: Good. Edition Unstated. Some minor marks most pages crisp and clean. Some shelf and corner wear, Binding is in good condition. Good study copy. Quantity Available: 1. Category: Computers & Internet; ISBN: 053494728X. ISBN/EAN: 9780534947286. Pictures of this item not already displayed here available upon request. Inventory No: 1560716376. Seller Inventory # 1560716376
Quantity: 1 available