No products in the cart.
$33.25
“Introduction to the Theory of Computation” (3rd Edition) by Michael Sipser is a well-regarded textbook for students of computer science and mathematics. It covers essential topics in computational theory, including automata theory, formal languages, Turing machines, and complexity theory. The book explains these complex concepts with clarity and includes numerous examples, exercises, and proofs to help students develop a solid understanding. The 3rd edition incorporates updates in the theory of computation and explores more advanced topics, making it suitable for undergraduate and graduate courses. It also offers a blend of theoretical rigor and practical application, helping students understand the limits of what can be computed. This edition is a valuable resource for anyone pursuing studies in computer science, artificial intelligence, or theoretical computing.
37 people are viewing this product right now
🔥 3 items sold in last 3 hours
Michael Sipser is a prominent computer scientist and professor at the Massachusetts Institute of Technology (MIT). He is well-known for his contributions to theoretical computer science, particularly in the areas of computational complexity theory and automata theory. Sipser has written several influential books, with his work on theory of computation widely used in academia. His teaching and research have earned him recognition in both the academic and professional computer science communities. He is highly regarded for his ability to simplify complex topics for students. Sipser's research has shaped much of the modern study in computational theory.
ntroduction. PART 1: AUTOMATA AND LANGUAGES. 1. Regular Languages. 2. Context-Free Languages. PART 2: COMPUTABILITY THEORY. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory. PART 3: COMPLEXITY THEORY. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced Topics in Complexity Theory. Selected Bibliography.
About The Book
“Introduction to the Theory of Computation” (3rd Edition) by Michael Sipser is a well-regarded textbook for students of computer science and mathematics. It covers essential topics in computational theory, including automata theory, formal languages, Turing machines, and complexity theory. The book explains these complex concepts with clarity and includes numerous examples, exercises, and proofs to help students develop a solid understanding. The 3rd edition incorporates updates in the theory of computation and explores more advanced topics, making it suitable for undergraduate and graduate courses. It also offers a blend of theoretical rigor and practical application, helping students understand the limits of what can be computed. This edition is a valuable resource for anyone pursuing studies in computer science, artificial intelligence, or theoretical computing.
Reviews
There are no reviews yet.