research area

Next Generation Secure Internet

dividing line

Current Projects:

Games & Links: Combating Web SPAM

The CAPTCHA Project

Recent Publications

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)

[email]

Use Carnegie Mellon's Directory

Manuel blum

manuel Blum is the Bruce Nelson Professor of Computer Science and a Carnegie Mellon University Professor at the School of Computer Science.

Blum is one of the founders of computational complexity theory, work that has also had applications to cryptography and program checking. He came to Carnegie Mellon as a visiting professor in 1999 after a distinguished career at the University of California at Berkeley where he received an A.M. Turing Award, the highest honor in computing, in 1995. He received Carnegie Mellon's Nelson Chair in the fall of 2001.

Education

Ph.D., Masters and Bachelors, Massachusetts Institute of Technology.

Professional Background

Starting from his early research on the inherent limitations of computing devices, Blum's work has developed around a single unifying theme—finding positive, practical consequences of living in a world where all computational resources are bounded. He showed that secure business transactions and pseudo-random number generation are possible because all computational devices have finite resources.