Manuel Blum

from Wikipedia, the free encyclopedia
Manuel Blum (left), Lenore Blum , Avrim Blum, 1973

Manuel Blum (born April 26, 1938 in Caracas , Venezuela ) is an American computer scientist who received the Turing Award in 1995 "in recognition of his contributions to the fundamentals of algorithmic complexity theory and its application in cryptography and program error checking" .

Life

Blum studied at MIT , earned his bachelor's degree in 1959 and his master's degree in electrical engineering in 1961, and obtained a Ph.D. in mathematics under Marvin Minsky 1964. Subsequently, he was active until 2000 as a professor of computer science at the University of California, Berkeley . In 1971 he became a Sloan Research Fellow .

Most recently, Manuel Blum was Bruce Nelson Professor of Computer Science at Carnegie Mellon University , where his wife, Lenore Blum , and son, Avrim Blum , also taught computer science professors. In 2018, the Blums resigned from all positions in protest over alleged sexism at Carnegie Mellon.

job

In the 1960s he developed an axiomatic complexity theory that was independent of specific machine models and based on Gödel numbering and Blum's axioms . This theory delivered concrete results such as the compression theorem , Borodin's gap theorem and the famous Blum's Speedup theorem .

His other works include a time-linear selection algorithm, the Blum-Blum-Shub-Generator , the Blum-Goldwasser cryptosystem and, more recently, CAPTCHAs .

His PhD students have made significant academic careers with an unusual frequency, including Leonard Adleman , Shafrira Goldwasser , Russell Impagliazzo , Silvio Micali , Gary L. Miller , Moni Naor , Steven Rudich , Michael Sipser , Ryan Williams , and Umesh and Vijay Vazirani .

Awards (selection)

Web links

Individual evidence

  1. ^ Lenore Blum shocked the community with her sudden resignation from CMU. Here she tells us why . September 6, 2018.