Introduction to the Theory of Computation – Michael Sipser – 1st Edition

Michael Sipser’s philosophy in writing this is simple: make the subject interesting and relevant, and the students will learn. His emphasis on unifying science – 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 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 provides a mathematical treatment of computation theory grounded in theorems and proofs. Proofs are presented with a “proof idea” component to reveal the 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 (now out of print) will be interested to note several new chapters on theory: Chapter 8 on space ; Chapter 9 on provable intractability, and Chapter 10 on topics, including approximation algorithms, alternation, interactive proof systems, cryptography, and parallel computing.

Introduction.

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.

Title: Introduction to the Theory of Computation
Author: Michael Sipser
Edition: 1st Edition
ISBN: 113318779X | 9781133187790
Type: Solution Manual
Language: English
Theory Of Computation
REVIEW 56%
56%

No Comments

  • Can you please leave feedback and comments here

    Your opinions and comments would be greatly appreciated. If you have comments or questions we've added this section so that we might have a dialogue with you.

Complete all fields

seven − one =