Michael Sipser

Michael Fredric Sipser is an American computer scientist.

Sipser studied mathematics at Cornell University (Bachelor 1974) and in 1980 at the University of California, Berkeley with Manuel Blum in computer science doctorate ( Nondeterminism and the size of Two-Way Finite Automata ). He is a professor of Applied Mathematics at the Massachusetts Institute of Technology, where he has been since 1980 and 1998-2000 Board of the Faculty of Applied Mathematics was and is since 2004 the Executive Board of the Faculty of Mathematics. In 1980 he was in the IBM Research 1985/96 he was a visiting scientist at Berkeley and in 1988 at the Hebrew University (as Lady Davis Fellow ).

Sipser deals with complexity theory, about which he wrote a standard work, with interactive proof systems, algorithms, computer science and efficient quantum error-correcting codes. In 1978 he proved with David Lichtenstein, that the game of Go falls into the PSPACE complexity class. He is engaged in the P- NP problem.

He is a member of the American Academy of Arts and Sciences.

His doctoral counts Lance Fortnow.

Writings

• Sipser Introduction to the theory of computation, PWS Publishing, Boston, 1996, 2nd edition Thomson Course Technology, Boston 2006, ISBN 053494728X