Introduction to the theory of computation 🔍
Michael (Michael Sipser) Sipser Course Technology; Thomson Course Technology, 2nd, International ed, Boston, 2006
English [en] · DJVU · 5.2MB · 2006 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/upload/zlib · Save
description
This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.
Amazon.com Review "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.
Alternative filename
lgli/Cs_Computer science/CsNp_Computability/Sipser M. Introduction to the theory of computation (2005)(600dpi)(T)(ISBN 0534950973)(453s)_CsNp_.djvu
Alternative filename
lgrsnf/Cs_Computer science/CsNp_Computability/Sipser M. Introduction to the theory of computation (2005)(600dpi)(T)(ISBN 0534950973)(453s)_CsNp_.djvu
Alternative filename
nexusstc/Introduction to the theory of computation/1d9fa59b0e4f522bf232c38e7fea4757.djvu
Alternative author
Sipser, Michael
Alternative publisher
Brooks/Cole
Alternative publisher
Wadsworth
Alternative edition
United States, United States of America
Alternative edition
2 edition, February 15, 2005
Alternative edition
Second Edition, PS, 2005
metadata comments
kolxoz -- 17
metadata comments
lg1428
metadata comments
{"edition":"2","isbns":["0534950973","9780534950972"],"last_page":453,"publisher":"Thomson"}
metadata comments
Second Edition
Alternative description
"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."--Publisher's description
Alternative description
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 II 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.
Alternative description
Dsu Title Iii 2002-2012. Pt. 1. Automata And Languages -- 1. Regular Languages -- 2. Context-free Languages -- Pt. 2. Computability Theory -- 3. 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. Michael Sipser. Includes Bibliographical References (p. 415-419) And Index.
date open sourced
2009-07-20
Read more…

🐢 Slow downloads

From trusted partners. More information in the FAQ. (might require browser verification — unlimited downloads!)

All download options have the same file, and should be safe to use. That said, always be cautious when downloading files from the internet, especially from sites external to Anna’s Archive. For example, be sure to keep your devices updated.
  • For large files, we recommend using a download manager to prevent interruptions.
    Recommended download managers: JDownloader
  • You will need an ebook or PDF reader to open the file, depending on the file format.
    Recommended ebook readers: Anna’s Archive online viewer, ReadEra, and Calibre
  • Use online tools to convert between formats.
    Recommended conversion tools: CloudConvert and PrintFriendly
  • You can send both PDF and EPUB files to your Kindle or Kobo eReader.
    Recommended tools: Amazon‘s “Send to Kindle” and djazz‘s “Send to Kobo/Kindle”
  • Support authors and libraries
    ✍️ If you like this and can afford it, consider buying the original, or supporting the authors directly.
    📚 If this is available at your local library, consider borrowing it for free there.