Michael Sipser

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Michael Fredric Sipser is a professor of Applied Mathematics in the Theory of Computation Group at the Massachusetts Institute of Technology.

Education and career[edit]

Sipser was born and raised in Brooklyn, New York. He earned his B.A. in mathematics from Cornell University in 1974 and his Ph.D. 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 joined the faculty as a professor the following year. From 2004 until 2014, he has served as head of the MIT Mathematics department. He was appointed Dean of the MIT School of Science in 2014.[2] He is a fellow of the American Academy of Arts and Sciences.[3]

Sipser is a theoretical computer scientist specializing 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 has jointly proved the Sipser–Lautemann theorem for the BPP complexity class, he proved together with David Lichtenstein that Go is PSPACE hard, and he introduced Adiabatic quantum computing in joint work with Farhi, Goldstone, and Gutmann.

Notable books[edit]

He is the author of Introduction to the Theory of Computation,[4] a textbook for theoretical computer science.

Personal life[edit]

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.[1]

Notes[edit]

  1. ^ a b Trafton, Anne, "Michael Sipser named dean of the School of Science: Sipser has served as interim dean since Marc Kastner’s departure", MIT News Office, June 5, 2014
  2. ^ MIT Mathematics | People Directory
  3. ^ "Membership". American Academy of Arts and Sciences. Retrieved 23 September 2014. 
  4. ^ Sipser, Michael. Introduction to the Theory of Computation (3 ed.). Cengage Learning. ISBN 978-1133187790. 

External links[edit]