3 Review(s)

Salient Features Covers the foundations of theoretical computing designed around theorems and proofs. Provides both formal and informal definitions and descriptions of methods to increase student retention. Includes Worked Out Examples throughout the text that make topics conducive to students' learning. Uses a student-friendly approach to teach computer theory.Revised for currency with updated examples and end-of-chapter exercises that review definitions, concepts, and problems to challenge and extend students understanding. About the Author 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. Introduction