The Full Wiki

Manuel Blum: Wikis


Note: Many of our articles have direct quotes from sources you can cite, within the Wikipedia article! This article doesn't yet, but we're working on it! See more info or our list of citable articles.


From Wikipedia, the free encyclopedia

Manuel Blum
Born April 26, 1938 (1938-04-26) (age 71)
Caracas, Venezuela
Residence Pittsburgh, Pa
Fields Computer Science
Institutions University of California, Berkeley
Carnegie Mellon University
Alma mater Massachusetts Institute of Technology
Doctoral advisor Marvin Minsky
Doctoral students Leonard Adleman
Dana Angluin
C. Eric (Carl) Bach
William Evans
Peter Gemmell
John Gill, III
Shafrira Goldwasser
Mor Harchol-Balter
Diane Hernek
Nicholas Hopper
Russell Impagliazzo
Sampath Kannan
Silvio Micali
Gary Miller
Moni Naor
Ronitt Rubinfeld
Steven Rudich
Troy Shahoumian
Jeffrey Shallit
Michael Sipser
Elizabeth Sweedyk
Umesh Vazirani
Vijay Vazirani
Hal Wasserman
Luis von Ahn
Ryan Williams
Notable awards Turing Award

Manuel Blum (born 26 April 1938 in Caracas, Venezuela) is a computer scientist who received the Turing Award in 1995 "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking".



Blum attended MIT, where he received his bachelor's degree and his master's degree in EECS in 1959 and 1961 respectively, and his Ph.D. in Mathematics in 1964 under professor Marvin Minsky.

He worked as a professor of computer science at the University of California, Berkeley until 1999 [1].

He is currently the Bruce Nelson Professor of Computer Science at Carnegie Mellon University, where his wife, Lenore Blum, and son, Avrim Blum, are also professors of Computer Science.


In the 60s he developed an axiomatic complexity theory which was independent of concrete machine models. The theory is based on Gödel numberings and the Blum axioms. Even though the theory is not based on any machine model it yields concrete results like the compression theorem, the gap theorem, the honesty theorem and the celebrated Blum speedup theorem.

Some of his other work includes a protocol for flipping a coin over a telephone, a linear time Selection algorithm, the Blum Blum Shub pseudorandom number generator, the Blum-Goldwasser cryptosystem, and more recently CAPTCHAs.

His PhD Advisees, with unusual frequency, have gone on to very distinguished careers. Among them are Leonard Adleman, Shafi Goldwasser, Russell Impagliazzo, Silvio Micali, Gary Miller, Moni Naor, Steven Rudich, Michael Sipser, Umesh and Vijay Vazirani, Ronitt Rubinfeld, Luis von Ahn, Ryan Williams and Ivan da Costa Marques.

See also

External links

Blum's home pages:



Got something to say? Make a comment.
Your name
Your email address