Normal view
MARC view
Introduction to the theory of computation / Michael Sipser.
Publication details: Boston, MA : Thomson Course Technology, c2006.Edition: 2nd edDescription: xix, 431 p. : ill. ; 25 cmISBN:- 0534950973 (hbk.):
- 9780534950972 (hbk.)
- QA267 .S56 2006
Contents:
Summary: This highly anticipated revision of Michael Sipser's popular text builds upon the strengths of the previous edition. It tells the fascinating story of the theory of computation-a subject with beautiful results and exciting unsolved questions at the crossroads of mathematics and computer science. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections reveal the intuition underpinning the formal proofs of theorems by explaining profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years and offers completely updated, classroom-tested problem sets with sample solutions at the end of each chapter. Book jacket.
Pt. 1. Automata and Languages -- 1. Regular Languages -- 2. Context-Free Languages -- Pt. 2. Computability Theory -- 3. The Church-Turing Thesis -- 4. Decidability -- 5. Reducibility -- 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory -- 7. Time Complexity -- 8. Space Complexity -- 9. Intractability -- 10. Advanced topics in complexity theory.
| Item type | Current library | Home library | Shelving location | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
Books
|
American University in Dubai | American University in Dubai | Main Collection | QA 267 .S56 2006 (Browse shelf(Opens below)) | Available | 600926 |
Includes bibliographical references (p. 415-419) and index.
Pt. 1. Automata and Languages -- 1. Regular Languages -- 2. Context-Free Languages -- Pt. 2. Computability Theory -- 3. The Church-Turing Thesis -- 4. Decidability -- 5. Reducibility -- 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory -- 7. Time Complexity -- 8. Space Complexity -- 9. Intractability -- 10. Advanced topics in complexity theory.
This highly anticipated revision of Michael Sipser's popular text builds upon the strengths of the previous edition. It tells the fascinating story of the theory of computation-a subject with beautiful results and exciting unsolved questions at the crossroads of mathematics and computer science. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections reveal the intuition underpinning the formal proofs of theorems by explaining profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years and offers completely updated, classroom-tested problem sets with sample solutions at the end of each chapter. Book jacket.
There are no comments on this title.
Log in to your account to post a comment.