Manuel Blum

Manuel Blum
Manuel Blum (left) with his wife Lenore Blum and their son Avrim Blum, 1973
Born	(1938-04-26) 26 April 1938 (age 86) Caracas, Venezuela
Alma mater	Massachusetts Institute of Technology (BA, MA, PhD)
Known for	Blum complexity axioms Blum integer Blum's speedup theorem Blum Blum Shub Blum–Goldwasser cryptosystem Blum–Micali algorithm CAPTCHA reCAPTCHA Commitment scheme
Spouse	Lenore Blum
Awards	ACM's A.M. Turing Award, 1995 Distinguished Teaching Award, UC Berkeley, 1977 Sigma Xi's Monie A. Ferst Award, 1991 Herbert A.Simon Teaching award, 2007
Scientific career
Fields	Computer Science
Institutions	University of California, Berkeley Carnegie Mellon University
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 Shafi Goldwasser Mor Harchol-Balter Russell Impagliazzo Silvio Micali Gary Miller Moni Naor Ronitt Rubinfeld Steven Rudich Jeffrey Shallit Michael Sipser Umesh Vazirani Vijay Vazirani Luis von Ahn Ryan Williams[1]
Website	www.cs.cmu.edu/~mblum

Manuel Blum (born 26 April 1938) is a Venezuelan born American 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]}