b. 1954
Michael Sipser is an American theoretical computer scientist and mathematician at MIT, best known for his foundational contributions to computational complexity theory and his influential textbook on the theory of computation. His work spans circuit complexity, probabilistic computation, and the P versus NP problem, and he has shaped how generations of students understand the mathematical limits of computation.
Authored the widely used textbook 'Introduction to the Theory of Computation'
Proved foundational results in circuit complexity, including parity lower bounds
Contributed to the theory of interactive proofs and probabilistic computation
Served as Dean of Science and head of the Mathematics Department at MIT
Advanced understanding of the relationship between randomness and computation