World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
51
Citations
26127
World Ranking
5196
National Ranking
2385

Research.com Recognitions

  • 2020 - ACM Fellow For contributions to the foundations of computational complexity theory and its application to cryptography and program checking
  • 2006 - 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.
  • 2002 - Member of the National Academy of Sciences
  • 1995 - Fellow of the American Academy of Arts and Sciences
  • 1995 - A. M. Turing Award In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking.
  • 1991 - Monie A. Ferst Award, Sigma Xi
  • 1982 - Fellow of the American Association for the Advancement of Science (AAAS)
  • 1971 - Fellow of Alfred P. Sloan Foundation

Overview

Manuel Blum is affiliated with Carnegie Mellon University in the United States. The research focus centers predominantly on computer science, with substantial contributions in computational theory and mathematics, cognitive neuroscience, and artificial intelligence. Their work also touches on general health professions and information systems to a lesser extent.

The scientist's research topics include:

  • Computability, Logic, AI Algorithms
  • Cognitive Computing and Networks
  • Embodied and Extended Cognition
  • Neural dynamics and brain function
  • Cognitive Science and Education Research
  • User Authentication and Security Systems
  • Biometric Identification and Security

Recent publications authored by Manuel Blum demonstrate a focus on theoretical computer science perspectives applied to consciousness and artificial intelligence, as well as human computation models. Notable papers include:

  • "The complexity of human computation via a concrete model with an application to passwords," 2020, Proceedings of the National Academy of Sciences
  • "A Theoretical Computer Science Perspective on Consciousness," 2021, Journal of Artificial Intelligence and Consciousness

Frequent co-authors in Manuel Blum's research include:

  • Lenore Blum
  • Santosh Vempala
  • Zsofia Rozsnai
  • Béatrice Diallo
  • Carmen Florian

The scientist has published frequently in the following venues:

  • arXiv (Cornell University)
  • Proceedings of the National Academy of Sciences
  • Engineering
  • Journal of Artificial Intelligence and Consciousness
  • Primary and Hospital Care Allgemeine Innere Medizin

Manuel Blum has been recognized with multiple awards and honors over their career. These include:

  • ACM Fellow (2020) for contributions to foundations of computational complexity theory and its applications
  • Member of the National Academy of Engineering (2006) for work in abstract complexity theory, cryptographic protocols, and program checkers
  • Member of the National Academy of Sciences (2002)
  • Fellow of the American Academy of Arts and Sciences (1995)
  • A. M. Turing Award (1995) for contributions to computational complexity theory and cryptography
  • Monie A. Ferst Award, Sigma Xi (1991)
  • Fellow of the American Association for the Advancement of Science (1982)
  • Fellow of Alfred P. Sloan Foundation (1971)

Best Publications

  • How to generate cryptographically strong sequences of pseudo-random bits

    Manuel Blum;Silvio Micali

  • CAPTCHA: using hard AI problems for security

    Luis Von Ahn;Manuel Blum;Nicholas J. Hopper;John Langford

  • Time bounds for selection

    Manuel Blum;Robert W. Floyd;Vaughan Pratt;Ronald L. Rivest

  • reCAPTCHA: Human-Based Character Recognition via Web Security Measures

    Luis von Ahn;Benjamin Maurer;Colin McMillen;David Abraham

  • A simple unpredictable pseudo random number generator

    L Blum;M Blum;M Shub

  • Telling humans and computers apart automatically

    Luis von Ahn;Manuel Blum;John Langford

  • Non-interactive zero-knowledge and its applications

    Manuel Blum;Paul Feldman;Silvio Micali

  • A Machine-Independent Theory of the Complexity of Recursive Functions

    Manuel Blum

  • Designing programs that check their work

    Manuel Blum;Sampath Kannan

  • Toward a mathematical theory of inductive inference

    Lenore Blum;Lenore Blum;Manuel Blum

  • Peekaboom: a game for locating objects in images

    Luis von Ahn;Ruoran Liu;Manuel Blum

  • Secure Human Identification Protocols

    Nicholas J. Hopper;Manuel Blum

  • Coin flipping by telephone a protocol for solving impossible problems

    Manuel Blum

  • Noninteractive zero-knowledge

    Manuel Blum;Alfredo De Santis;Silvio Micali;Giuseppe Persiano

  • Checking the correctness of memories

    M. Blum;W. Evans;P. Gemmell;S. Kannan

  • Verbosity: a game for collecting common-sense facts

    Luis von Ahn;Mihir Kedia;Manuel Blum

  • Self-testing/correcting with applications to numerical problems

    M. Blum;M. Luby;R. Rubinfeld

  • Checking the correctness of memories

    M. Blum;W. Evans;P. Gemmell;S. Kannan

  • Designing programs that check their work

    M. Blum;S. Kanna

  • Coin Flipping by Telephone.

    Manuel Blum

  • Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract)

    Manuel Blum;Paul Feldman;Silvio Micali

  • Telling Humans and Computers Apart Automatically or How Lazy Cryptographers do AI

    Louis von Ahn;Manuel Blum;John Langford

Frequent Co-Authors

Anupam Datta
Anupam Datta Carnegie Mellon University
John Langford
John Langford Microsoft (United States)
Nicholas Hopper
Nicholas Hopper University of Minnesota
Santosh Vempala
Santosh Vempala Georgia Institute of Technology
Sampath Kannan
Sampath Kannan University of Pennsylvania
Moni Naor
Moni Naor Weizmann Institute of Science
Manuela Veloso
Manuela Veloso Carnegie Mellon University
Robert E. Tarjan
Robert E. Tarjan Princeton University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees and certifications can be a smart strategy for those interested in Computer Science careers. If you’re seeking cost-effective options, understanding what is the cheapest data science course in the US? can help you compare programs that fit your budget.

For those ready to specialize further, an online master’s in electrical engineering degree offers flexibility alongside in-demand technical training—opening doors to advanced roles in tech and engineering.

Not everyone has the time or resources to pursue a full-length degree. Fortunately, there are easy certifications to get online that can boost your resume and earning potential in less time.

Likewise, if you’re looking to advance quickly, it’s worth considering the shortest masters degree programs available online. These accelerated paths let you upskill and enter the job market faster.

Consider all these options to find the right learning path—whether your goal is affordability, speed, specialization, or quick certification.

Best Scientists Citing Manuel Blum

Trending Scientists