Stephen Cook
1939– — USA
Era: Modern
Brilliance: 10/10 | Stewardship: 8/10 | Composite Index: 80
The architect of computational complexity theory
"The P versus NP question is really asking whether creativity is as easy as verification."
Biography
Stephen Cook revolutionized computer science by formalizing the P versus NP problem, one of the seven Millennium Prize Problems. His 1971 seminal paper on NPcompleteness established the theoretical foundations for understanding computational limits and has shaped decades of algorithm research. Cook's work fundamentally changed how scientists think about what computers can and cannot efficiently solve.
Key Facts
- Formulated the Cook-Levin theorem, proving that the satisfiability problem is NP-complete
- Won the Turing Award in 1982 for his contributions to the theory of computational complexity
- His P vs NP problem remains unsolved, with a $1 million prize for its solution
- Spent most of his career at the University of Toronto, training generations of computer scientists
- Developed the concept of NP-completeness, unifying diverse computational problems
He proved some problems are harder than they look—worth a million dollars.
Total BrainCoins: 0
Cast BrainCoins for Stephen Cook