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. He received his Ph.D. in 1980 from the University of California, Berkeley under the direction of Manuel Blum. Since 2004, he serves as head of the MIT Mathematics department.[1]

His research area is complexity theory and related fields. 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.

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

Notes[edit]

  1. ^ MIT Mathematics | People Directory
  2. ^ Sipser, Michael. Introduction to the Theory of Computation (3 ed.). Cengage Learning. ISBN 978-1133187790. 

External links[edit]