Michael Sipser

Michael Sipser, 2013

Michael Fredric Sipser (born September 17, 1954 ) is an American computer scientist .

Sipser studied mathematics at Cornell University (Bachelor 1974) and received his doctorate in computer science ( Nondeterminism and the Size of Two-Way Finite Automata ) at the University of California, Berkeley under Manuel Blum in 1980 . He is Professor of Applied Mathematics at the Massachusetts Institute of Technology , where he has been since 1980 and served on the Faculty of Applied Mathematics from 1998 to 2000 and has served on the Faculty of Mathematics since 2004. In 1980 he was in research at IBM , 1985/96 he was a visiting scholar 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, quantum informatics and efficient error-correcting codes. In 1978 he and David Lichtenstein proved that the game Go falls into the complexity class Pspace. He deals with the P-NP problem .

He has been a member of the American Academy of Arts and Sciences since 2009 . He is a fellow of the American Mathematical Society .

Lance Fortnow is one of his PhD students .

Fonts

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

Web links

• Homepage at MIT
• Michael Sipser in the Mathematics Genealogy Project (English)

Individual evidence

1. ↑ Richard Lipton on his blog
2. ↑ Proc.19.Annual Symposium Foundation Computer Science, IEEE 1978
3. ↑ for example Clay Public Lecture Beyond Computation , Harvard 2006, lecture ( Memento of the original from July 5, 2010 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice.