| Michael Sipser | |
| Birth Name: | Michael Fredric Sipser |
| Birth Date: | 17 September 1954 |
| Birth Place: | Brooklyn, New York |
| Nationality: | American |
| Work Institution: | MIT |
| Doctoral Advisor: | Manuel Blum |
| Thesis Title: | Nondeterminism and the Size of Two-Way Finite Automata |
| Thesis Year: | 1980 |
Michael Fredric Sipser (born September 17, 1954) is an American theoretical computer scientist who has made early contributions to computational complexity theory. He is a professor of applied mathematics and was the dean of science at the Massachusetts Institute of Technology.
Sipser was born and raised in Brooklyn, New York and moved to Oswego, New York when he was 12 years old. He earned his BA in mathematics from Cornell University in 1974 and his PhD in engineering from the University of California at Berkeley in 1980 under the direction of Manuel Blum.[1]
He joined MIT's Laboratory for Computer Science as a research associate in 1979 and then was a Research Staff Member at IBM Research in San Jose. In 1980, he joined the MIT faculty. He spent the 1985–1986 academic year on the faculty of the University of California at Berkeley and then returned to MIT. From 2004 until 2014, he served as head of the MIT Mathematics department. He was appointed Interim Dean of the MIT School of Science in 2013 and Dean in 2014.[2] He served as Dean until 2020, when he was followed by Nergis Mavalvala.[3] He is a fellow of the American Academy of Arts and Sciences.[4] In 2015 he was elected as a fellow of the American Mathematical Society "for contributions to complexity theory and for leadership and service to the mathematical community."[5] He was elected as an ACM Fellow in 2017.
Sipser specializes in algorithms and complexity theory, specifically efficient error correcting codes, interactive proof systems, randomness, quantum computation, and establishing the inherent computational difficulty of problems. He introduced the method of probabilistic restriction for proving super-polynomial lower bounds on circuit complexity in a paper joint with Merrick Furst and James B. Saxe.[6] Their result was later improved to be an exponential lower bound by Andrew Yao and Johan Håstad.[7]
In an early derandomization theorem, Sipser showed that BPP is contained in the polynomial hierarchy,[8] subsequently improved by Peter Gács and Clemens Lautemann to form what is now known as the Sipser-Gács-Lautemann theorem. Sipser also established a connection between expander graphs and derandomization.[9] He and his PhD student Daniel Spielman introduced expander codes, an application of expander graphs.[10] With fellow graduate student David Lichtenstein, Sipser proved that Go is PSPACE hard.[11]
In quantum computation theory, he introduced the adiabatic algorithm jointly with Edward Farhi, Jeffrey Goldstone, and Samuel Gutmann.[12]
Sipser has long been interested in the P versus NP problem. In 1975, he wagered an ounce of gold with Leonard Adleman that the problem would be solved with a proof that P≠NP by the end of the 20th century. Sipser sent Adleman an American Gold Eagle coin in 2000 because the problem remained (and remains) unsolved.[13]
Sipser is the author of Introduction to the Theory of Computation,[14] a textbook for theoretical computer science.
Sipser lives in Cambridge, Massachusetts with his wife, Ina, and has two children: a daughter, Rachel, who graduated from New York University, and a younger son, Aaron, who graduated from MIT.[1]