Manuel Blum

From Infogalactic: the planetary knowledge core
Jump to: navigation, search
Manuel Blum
File:Blum manuel lenore avrim.jpg
Manuel Blum (left) with his wife Lenore Blum and their son Avrim Blum
Born (1938-04-26) April 26, 1938 (age 80)
Caracas, Venezuela
Residence Pittsburgh
Fields Computer Science
Institutions University of California, Berkeley
Carnegie Mellon University
Alma mater Massachusetts Institute of Technology
Thesis A Machine-Independent Theory of the Complexity of Recursive Functions (1964)
Doctoral advisor Marvin Minsky[1]
Doctoral students
Known for Blum complexity axioms
Blum's speedup theorem
Blum Blum Shub
Blum-Goldwasser cryptosystem
Notable awards Turing Award (1995)
Spouse Lenore Blum
Website
www.cs.cmu.edu/~mblum

Manuel Blum (Caracas, 26 April 1938) is a Venezuelan 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".[2][3][4][5][6][7][8]

Education

Blum was educated at 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 supervised by Marvin Minsky.[1][7]

Career

He worked as a professor of computer science at the University of California, Berkeley until 1999. In 2002 he was elected to the United States National Academy of Sciences.

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

Research

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 Blum speedup theorem.

Some of his other work includes a protocol for flipping a coin over a telephone, median of medians (a linear time selection algorithm), the Blum Blum Shub pseudorandom number generator, the Blum-Goldwasser cryptosystem, and more recently CAPTCHAs.[10]

References

  1. 1.0 1.1 1.2 Manuel Blum at the Mathematics Genealogy Project.
  2. ACM Turing Award Citation, retrieved 2010-01-24.
  3. Manuel Blum's publications indexed by the DBLP Bibliography Server at the University of Trier
  4. List of publications from Microsoft Academic Search
  5. Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).
  6. Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).
  7. 7.0 7.1 Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).
  8. Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).
  9. Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).
  10. Von Ahn, Luis; Blum, Manuel; Hopper, Nicholas J.; Langford, John (May 2003). "CAPTCHA: Using Hard AI Problems for Security". Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2003).