Manuel Blum

Template:Short description Template:Use dmy dates Template:Infobox scientist 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".<ref>ACM Turing Award Citation, retrieved 2010-01-24.</ref><ref name="dblp">Template:DBLP</ref><ref name="microsoft">Template:AcademicSearch</ref><ref>Template:Cite journal</ref><ref>Template:Cite journal</ref><ref name="doi10.1145/321386.321395">Template:Cite journal</ref><ref>Template:Cite journal</ref>

Education

Blum was born to a Jewish family in Venezuela.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> Blum was educated at MIT, where he received his bachelor's degree and his master's degree in electrical engineering in 1959 and 1961 respectively. In MIT, he was recommended to Warren S. McCulloch, and they collaborated on some mathematical problems in neural networks.<ref>Blum, Manuel. "Properties of a neuron with many inputs." Bionics Symposium: Living Prototypes--the Key to New Technology, 13-14-15 September 1960. WADD technical report, 60-600. (1961)</ref><ref name="number">Template:Cite journal</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> He obtained a Ph.D. in mathematics in 1964 supervised by Marvin Minsky.<ref name="mathgene">Template:Mathgenealogy.</ref><ref name="doi10.1145/321386.321395"/>

Career

Blum worked as a professor of computer science at the University of California, Berkeley until 2001. From 2001 to 2018, he was the Bruce Nelson Professor of Computer Science at Carnegie Mellon University, where his wife, Lenore Blum,<ref>Template:Cite journal</ref> was also a professor of computer science.

In 2002, he was elected to the United States National Academy of Sciences. In 2006, he was elected a member of the National Academy of Engineering for contributions to abstract complexity theory, inductive inference, cryptographic protocols, and the theory and applications of program checkers.

In 2018, Blum and his wife Lenore resigned from Carnegie Mellon University to protest against sexism after a change in management structure of Project Olympus led to sexist treatment of her as director and the exclusion of other women from project activities.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

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.<ref name="captcha">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).</ref>

Blum is also known as the advisor of many prominent researchers. Among his Ph.D. students are Leonard Adleman, Dana Angluin, Shafi Goldwasser, Mor Harchol-Balter, Russell Impagliazzo, Silvio Micali, Gary Miller, Moni Naor, Steven Rudich, Michael Sipser, Ronitt Rubinfeld, Umesh Vazirani, Vijay Vazirani, Luis von Ahn, and Ryan Williams.<ref name="mathgene"/>

See also

• List of Venezuelans
• Graph isomorphism problem
• Non-interactive zero-knowledge proof
• Quantum coin flipping
• Pancake sorting