Background
Sipser was born and raised in Brooklyn, New York and moved to Oswego, New York when he was 12 years old.
mathematician teacher computer scientist
Sipser was born and raised in Brooklyn, New York and moved to Oswego, New York when he was 12 years old.
He earned his Bachelor in mathematics from Cornell University in 1974 and his Doctor of Philosophy in engineering from the University of California at Berkeley in 1980 under the direction of Manuel Blum.
He is a professor of Applied Mathematics and Dean of Science at the Massachusetts Institute of Technology. He joined Massachusetts Institute of Technology"s Laboratory for Computer Science as a research associate in 1979 and became an Massachusetts Institute of Technology professor the following year. From 2004 until 2014, he served as head of the Massachusetts Institute of Technology Mathematics department.
He was appointed Dean of the Massachusetts Institute of Technology School of Science in 2014.
He is a fellow of the American Academy of Arts and Sciences. 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." 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 Saxe. Their result was later improved to be an exponential lower bound by Andrew Yao and Johan Håstad.
In an early derandomization theorem, Sipser showed that BPP is contained in the polynomial hierarchy, 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. He and his Doctor of Philosophy student Daniel Spielman introduced expander codes, an application of expander graphs. With fellow graduate student David Lichtenstein, Sipser proved that Go is PSPACE hard.
In quantum computation theory, he introduced the adiabatic algorithm jointly with Edward Farhi, Jeffrey Goldstone, and Samuel Gutmann.
Sipser has long been interested in the P versus Natural Philosophy problem. In 1975, he wagered an ounce of gold with Leonard Adleman that the problem would be solved with a proof that P≠Natural Philosophy by the end of the 20th century.
Sipser sent Adleman an American gold eagle coin in 2000 because the problem remained (and remains) unsolved.