b. 1954
Michael Sipser is an American theoretical computer scientist at MIT known for foundational contributions to computational complexity theory. His work on interactive proofs, randomized computation, and circuit complexity has shaped the field, and his textbook 'Introduction to the Theory of Computation' is widely used in computer science education.
Authored 'Introduction to the Theory of Computation', a standard textbook in the field
Proved the Sipser–Lautemann theorem placing BPP in the polynomial hierarchy
Contributed foundational results on interactive proof systems and circuit lower bounds
Served as Dean of Science at MIT
Advanced understanding of the P vs NP problem and complexity class relationships