The 1995 ACM Turing Award was presented to Manuel Blum in recognition of his fundamental contributions to the field of computational complexity theory and its applications within cryptography and program verification. Born in Caracas in 1938, this Venezuelan-American computer scientist has spent decades advancing the theoretical boundaries of machine models and algorithmic efficiency.
Academic Foundation
Blum pursued his higher education at the Massachusetts Institute of Technology. He completed his bachelor's degree and master's degree in electrical engineering in 1959 and 1961, respectively. During his time at the institute, he collaborated on neural network mathematical problems under the guidance of Warren S. McCulloch. In 1964, he earned a Ph.D. in mathematics, with his doctoral research supervised by Marvin Minsky.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Contributions to Complexity Theory
During the 1960s, Blum pioneered an axiomatic complexity theory that functioned independently of specific machine models. Utilizing Gödel numberings and the Blum axioms, his research produced significant results, including the compression theorem, the gap theorem, the honesty theorem, and the speedup theorem. Beyond these axiomatic foundations, his work includes the creation of the median of medians algorithm, the Blum Blum Shub pseudorandom number generator, and the Blum-Goldwasser cryptosystem. He is also credited for developing protocols such as coin flipping over a telephone and the modern CAPTCHA.
Career and Professional Affiliations
Blum held a long-standing position as a professor of computer science at the University of California, Berkeley, where he remained until 2001. That year, he accepted the Bruce Nelson Professor of Computer Science position at Carnegie Mellon University. In 2018, he and his wife, Lenore Blum, resigned from their roles at Carnegie Mellon University following disputes regarding management structures and the treatment of staff within Project Olympus. Throughout his career, he has mentored numerous researchers, including Leonard Adleman, Shafi Goldwasser, Silvio Micali, and Luis von Ahn.
Institutional Recognition
Blum has been elected to multiple high-level academic bodies, including the National Academy of Sciences in 2002 and the National Academy of Engineering in 2006 for his contributions to abstract complexity and cryptographic protocols. His professional memberships include the American Academy of Arts and Sciences and the Association for Computing Machinery. He is a fellow of the American Association for the Advancement of Science, the IACR, and the ACM.
Fast facts
- Born: 1938, Caracas, Venezuela
- Education: Massachusetts Institute of Technology
- Turing Award: 1995
- Employers: University of California, Berkeley; Carnegie Mellon University
- Citizenship: United States; Venezuela
- Fields of work: Computer science
- Major contribution: Blum Blum Shub generator
- Professional Fellowships: IACR (2012), ACM (2020), AAAS (1983)
Questions readers ask
What is Manuel Blum's primary field of research?
He specializes in computer science, specifically focusing on computational complexity theory, cryptography, and program checking.
Which universities employed Manuel Blum?
He served as a professor at the University of California, Berkeley, and later as the Bruce Nelson Professor of Computer Science at Carnegie Mellon University.
Achievements
- Turing Award — 1995
- Affiliated with University of California, Berkeley and Carnegie Mellon University
- Educated at Massachusetts Institute of Technology
- Worked as computer scientist and university teacher
