World Library  
Flag as Inappropriate
Email this Article

Manuel Blum

Article Id: WHEBN0000308357
Reproduction Date:

Title: Manuel Blum  
Author: World Heritage Encyclopedia
Language: English
Subject: List of Carnegie Mellon University people, List of Turing Award laureates by university affiliation, Marvin Minsky, Gary Miller (computer scientist), Eric Bach
Collection: 1938 Births, American Computer Scientists, Carnegie Mellon University Faculty, Iacr Fellows, Jewish American Scientists, Living People, Massachusetts Institute of Technology Alumni, Members of the United States National Academy of Engineering, Members of the United States National Academy of Sciences, Theoretical Computer Scientists, Turing Award Laureates, University of California, Berkeley Faculty, Venezuelan Emigrants to the United States, Venezuelan Jews
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Manuel Blum

Manuel Blum
Manuel Blum (left) with his wife Lenore Blum and their son Avrim Blum
Born (1938-04-26) April 26, 1938
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 Leonard Adleman
Dana Angluin
C. Eric Bach
William Evans
Peter Gemmell
John Gill, III
Shafi Goldwasser
Mor Harchol-Balter
Diane Hernek
Nicholas Hopper
Russell Impagliazzo
Sampath Kannan
Silvio Micali
Gary Miller
Moni Naor
Rene Peralta
Ronitt Rubinfeld
Steven Rudich
Troy Shahoumian
Jeffrey Shallit
Michael Sipser
Elizabeth Sweedyk
Umesh Vazirani
Vijay Vazirani
Hal Wasserman
Luis von Ahn
Ryan Williams
Ivan da Costa Marques[1]
Known for Blum complexity axioms
Blum's speedup theorem
Blum Blum Shub
Blum-Goldwasser cryptosystem
Notable awards Turing Award (1995)
Spouse Lenore Blum
Website
/~mblum.edu.cmu.cswww

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]

Contents

  • Education 1
  • Career 2
  • Research 3
  • References 4

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]

Among his PhD students are Leonard Adleman, Shafi Goldwasser, Russell Impagliazzo, Silvio Micali, Gary Miller, Moni Naor, Steven Rudich, Michael Sipser, Umesh Vazirani and Vijay Vazirani, Ronitt Rubinfeld, Luis von Ahn, Nicholas Hopper, and Ryan Williams.[1]

References

  1. ^ a b c d 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. ^ Blum, Manuel;  
  6. ^ Blum, M.;  
  7. ^ a b Blum, Manuel (1967). "A Machine-Independent Theory of the Complexity of Recursive Functions" (PDF).  
  8. ^ Blum, L.; Blum, M.; Shub, M. (1986). "A Simple Unpredictable Pseudo-Random Number Generator". SIAM Journal on Computing 15 (2): 364.  
  9. ^ Blum, L.; Blum, M. (1975). "Toward a mathematical theory of inductive inference". Information and Control 28 (2): 125.  
  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).
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.