Manuel Blum (04/26/1938--)
图 灵 奖 获 得 时 间 ：
1995年 。 第三十位 图 灵 奖 (1995年 ) 获 得 者 。
图 灵 奖 引 用 (Turing Award Citation) ：
Citation
In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking.
中 文 翻 译 ：
( 授 予Manuel Blum 图 灵 奖 以 表 彰 其 在 )计算复杂性理论的基础性研究以及在密码系统和程序检查验证方面的应用的卓越贡献。
编 者 注 ：
关于密码系统：
http://en.wikipedia.org/wiki/Cryptography
International Association for Cryptologic Research:
RSA Laboratories' Frequently Asked Questions About Today's Cryptography, Version 4.1:
http://www.rsasecurity.com/rsalabs/node.asp?id=2152
关于计算复杂性理论，可参见：
www.xtrj.org/ssm4/complexity_theory.htm
Computational Complexity of Games and Puzzles
IEEE Conference on Computational Complexity
Lecture Notes on Computational Complexity
Manuel Blum发表的代表性的研究文章：
Peekaboom: A Game for Locating Objects in Images Luis von Ahn, Ruoran Liu and Manuel Blum. To Appear in ACM CHI 2006 (pdf)
Improving Accessibility of the Web with a Computer Game Luis von Ahn, S. Ginosar, M. Kedia, R. Liu and M. Blum. To Appear in ACM CHI Notes 2006 (pdf)
Verbosity: A Game for Collecting Common-Sense Facts Luis von Ahn, Mihir Kedia and Manuel Blum. To Appear in ACM CHI Notes 2006 (pdf)
Toward a High-level Definition of Consciousness Manuel Blum, Ryan Williams Brendan Juba, Matt Humphrey. Invited Talk to the Annual IEEE Computational Complexity Conference , San Jose CA, (June 2005) (ppt)
Mathematical Foundations for Understanding and Designing Conceptualizing Strategizing Control Systems (NSF ITR proposal) (pdf)
Telling Humans and Computers Apart Automatically: How Lazy Cryptographers do AI Luis von Ahn, Manuel Blum and John Langford. In Communications of the ACM, Feb. 2004. PDF
CAPTCHA: Using Hard AI Problems for Security Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford. In Eurocrypt 2003 PDF / PS
On the complexity of MAX / MIN / AVRG Circuits (with Rachel Rue, Ke Yang). 2002. CMU SCS Technical Report, CMU-CS-02-110 PDF / abs
Telling Humans and Computers Apart (Automatically) (with Luis von Ahn, John Langford ). 2002. CMU Tech Report PDF
Secure Human Identification Protocols (with Nicholas J. Hopper). Advances in Crypotology, Proceedings of Asiacrypt 2001, December 2001: 52-66 PDF / abs
A Secure Human-Computer Authentication Scheme (with Nicholas J. Hopper).2000. CMU-CS-00-139 May 2000 PDF / abs
Software Reliability via Run-Time Result-Checking (with H. Wasserman). Journal of the ACM.
Preliminary version: Program Result-Checking: A Theory of Testing Meets a Test of Theory, Proc. 35th IEEE FOCS, 1994, pp. 382-392. PDF / PS
Reflections on the Pentium Division Bug (with H. Wasserman). IEEE Transactions on Computers, vol. 45, no. 4, April 1996, pp. 385-393.
Preliminary version: Proc. 8th Int'l Software Quality Week, 1995. PDF / PS
Self-testing/correcting with applications to numerical problems (with Michael Luby, Ronitt Rubinfeld). In Proceedings of the TwentySecond Annual ACM Symposium on Theory of Computing, pages 73-83, Baltimore, Maryland, 14-16 May 1990.
Self-Testing/Correcting with Applications to Numerical Problems (with M. Luby and R. Rubinfeld), STOC, 1990, p. 10.
Designing programs that check their work (with Sampath Kannan) In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 86-97, Seattle, Washington, 15-17 May 1989.
Non-interactive zero-knowledge and its applications (extended abstract).(with Paul Feldman, and Silvio Micali) In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 103-112, Chicago, Illinois, 2-4 May 1988.
A Simple Unpredictable Pseudo-Random Number Generator (with Lenore Blum, Mike Shub). SIAM J. Comput. 15(2): 364-383 (1986)
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. (with Silvio Micali). SIAM J. Comput. 13(4): 850-864 (1984)
How to exchange (secret) keys (extended abstract). In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 440-447, Boston, Massachusetts, 25-27 April 1983.
Coin Flipping by Telephone. CRYPTO 1981: 11-15 HTML
On the Power of the Compass (or, Why Mazes are Easier to Search Than Graphs) (with D. Kozen), Proc. IEEE FOCS Conf., 1978, pp. 132-142.
Toward a Mathematical Theory of Inductive Inference (with L. Blum), Information and Control, Vol. 28, No. 2, 1975, pp. 125-155.
Linear time bounds for median computations (with Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert E. Tarjan). In Conference Record, Fourth Annual ACM Symposium on Theory of Computing, pages 119-124, Denver, Colorado, 1-3 May 1972.
Linear Time Bounds for Median Computations (with Floyd, Pratt, Rivest, and Tarjan). Proc. 4th Annual ACM Symposium on Theory of Computing, 1972, pp. 119-124.
On effective procedures for speeding up algorithms In Conference Record of ACM Symposium on Theory of Computing, pages 43-53, Marina del Rey, California, 5-7 May 1969.
A Machine-Independent Theory of the Complexity of Recursive Functions. J. ACM, XIV, No. 2, 1967, pp. 322-336.
Blum在计算复杂性与密码系统领域的一些杰出贡献：
Turing Award Lecture(图灵奖演讲文章)：
Manuel Blum简 介 :
Manuel Blum出生于1938年4月26日于委内瑞拉。
Blum分别于1959年，1961年从MIT获得其电子工程与计算机科学(EECS)的学士和硕士学位。1964年，获得其数学博士学位。其导师是著名的人工智能之父，MIT人工智能实验室的创始人Marvin Minsky(1969年图灵奖获得者)。
Blum长期任教于Berkeley，直到2000年加入CMU。
Blum的家庭堪称世界之绝。Blum(www.cs.cmu.edu/~mblum/ )和其妻子(Lenore Blum www.cs.cmu.edu/~lblum/ )，儿子(Avrim Blum www.cs.cmu.edu/~avrim/ )也分别是CMU计算机系的教授.
Manuel Blum曾获得的荣誉：
- U.S. National Academy of Engineering, 2006
- U.S. National Academy of Science, 2002
- ACM's A. M. Turing Award, 1995
- Fellow, AmericanAcademy of Arts and Sciences, 1995
- Sigma Xi's Monie A. Ferst Award, 1991
- Fellow, American Association for the Advancement of Science, 1988
- Fellow, IEEE, 1987
- Distinguished Teaching Award, UC Berkeley, 1977
- Sloan Research Fellowship, 1968
Manuel Blum Wiki: http://en.wikipedia.org/wiki/Manuel_Blum
Manuel Blum @ Berkeley: http://www.cs.berkeley.edu/~blum/
Manuel Blum的学生谱系：http://www.genealogy.math.ndsu.nodak.edu/html/id.phtml?id=13373
Manuel Blum照片:
http://images.google.com/images?q=Manuel+Blum&hl=en&lr=&sa=N&tab=wi&sourceid=tipimg
(Blum CMU一家人)
