https://en.wikipedia.org/wiki/Manuel_Blum

Manuel Blum (born 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 Blum was born to a Venezuelan Jewish family.[9] 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 2001. From 2001 to 2018, he was the Bruce Nelson Professor of Computer Science at Carnegie Mellon University, where his wife, Lenore Blum,[10] was also a professor of Computer Science. In 2002 he was elected to the United States National Academy of Sciences.

In 2018 he 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. [11]

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.[12]

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.[1]

מנואל בלום

' (ספרדית: Manuel Blum; נולד ב-26 באפריל 1938) הוא מדען מחשב יהודי אמריקאי, זוכה פרס טיורינג לשנת 1995 על תרומתו הרבה ליסודות של תורת הסיבוכיות החישובית ויישומיה לקריפטוגרפיה ובדיקת תוכניות.

קורות חיים בלום נולד בקראקס, ונצואלה להורים יהודים. בלום למד ב-MIT לקראת תואר ראשון ושני במדעי המחשב והנדסת חשמל, אותם סיים ב-1961. לאחר מכן עבר להתמקד במתמטיקה, וסיים דוקטורט בתחום תחת הנחייתו של מרווין מינסקי ב-1964.

במהלך הקריירה שלו היה שייך לסגל המחלקה למדעי המחשב באוניברסיטת קליפורניה בברקלי ואף עמד בראש המחלקה. הוא שהה בברקלי עד 1999.

לאחר מכן עבר בלום ללמד באוניברסיטת קרנגי מלון, תפקיד אותו עשה עד 2018 אשתו לנור ובנו איברים אף הם פרופסורים למדעי המחשב באותה המחלקה.

בין תלמידיו נמנו לאונרד אדלמן, שפי גולדווסר וסילביו מיקאלי, שאף הם זכו בפרס טיורינג, מוני נאור, מהמחלקה למדעי המחשב במכון ויצמן ורונית רובינפלד מהמחלקה למדעי המחשב באוניברסיטת תל אביב. אחד מתלמידיו של בלום, פרופסור לואי פון אהן (שאיתו טבע את המונח CAPTCHA), הוא ממייסדי פלטפורמת Duolingo ללימוד שפות.

קישורים חיצוניים ויקישיתוף מדיה וקבצים בנושא מנואל בלום בוויקישיתוף Green globe.svg אתר האינטרנט הרשמי

של מנואל בלום מנואל בלום , באתר פרויקט הגנאלוגיה במתמטיקה מנואל בלום , באתר dblp אתר הבית של מנואל בלום מנואל בלום

באתר פרס טיורינג (באנגלית)

https://he.wikipedia.org/wiki/%D7%9E%D7%A0%D7%95%D7%90%D7%9C_%D7%91...

------------------------------------
https://en.wikipedia.org/wiki/Manuel_Blum

Manuel Blum (born 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 Blum was born to a Venezuelan Jewish family.[9] 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 2001. From 2001 to 2018, he was the Bruce Nelson Professor of Computer Science at Carnegie Mellon University, where his wife, Lenore Blum,[10] was also a professor of Computer Science. In 2002 he was elected to the United States National Academy of Sciences.

In 2018 he 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. [11]

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.[12]

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.[1]