Michael Sipser

Michael Sipser

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.

His research area is complexity theory, but he is also active in other related areas. In joint work with Farhi, Goldstone, and Gutmann, he introduced Adiabatic quantum computing.

He is the author of Introduction to the Theory of Computation (ISBN 0-534-95097-3), a standard textbook in the study of theoretical computer science.

He is currently (2011) serving as head of the MIT Mathematics department.[1]

Notes

  1. ^ http://www-math.mit.edu/people/listing.php

External links



Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Michael Sipser — Michael Fredric Sipser ist ein US amerikanischer Informatiker. Sipser studierte Mathematik an der Cornell University (Bachelor 1974) und wurde 1980 an der University of California, Berkeley bei Manuel Blum in Informatik promoviert (Nondeterminism …   Deutsch Wikipedia

  • Sipser-Lautemann theorem — In computational complexity theory, the Sipser Lautemann theorem or Sipser Gács Lautemann theorem states that BPP (Bounded error Probablistic Polynomial) time, is contained in the polynomial time hierarchy, and more specifically Sigma;2 cap; Pi;2 …   Wikipedia

  • Diagrama de estados — Saltar a navegación, búsqueda si representamos una substancia en un gráfico su presión de vapor para cada temperatura(marcados en el gráfico como líneas gruesas y continuas) y añadimos la temperatura del cambio de estado (marcados como líneas más …   Wikipedia Español

  • Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… …   Wikipedia

  • Interactive proof system — In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties. The parties, the verifier and the prover, interact by exchanging messages in order to… …   Wikipedia

  • IP (complexity) — In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Goldwasser, et al. in 1985. An interactive proof system consists …   Wikipedia

  • Daniel Spielman — Naissance mars 1970 Domicile États Unis Nationalité …   Wikipédia en Français

  • Chomsky normal form — In computer science, a context free grammar is said to be in Chomsky normal form if all of its production rules are of the form: or or where A, B and C are nonterminal symbols, α is a terminal symbol (a symbol that represents a constant value), S …   Wikipedia

  • Post correspondence problem — The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946.[1] Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability. Contents 1… …   Wikipedia

  • Manuel Blum — Born April 26, 1938 (1938 04 26) (age 73) Caracas, Venezuela Residence Pittsburgh …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”