#
Stephen Cook

Stephen Arthur Cook was born on December 14, 1939 in Buffalo, New
York. As an undergraduate, he attended the University of Michigan.
Later, he attended Harvard University where he received his Ph.D.
in mathematics in 1966.
From 1966 to 1970 he taught at the University of California, Berkeley.
Since 1970 he has taught at the University of Toronto.

Cook is best known for his formulation of the notion of NP-completeness
and his proof that satisfiability is NP-complete.
He has published about one hundred
papers in theoretical computer science, including
fundamental results in parallel complexity.

Cook won the ACM Turing award (computer science's highest award) in
1982. He is a fellow of the Royal Society of Canada (1984) and a
member of the US National Academy of Science (1985). In his spare
time, Cook enjoyes sailing and playing the violin.

## Sources

- S. A. Cook, The complexity of theorem-proving procedures,
* Proc. Third Annual ACM Symposium on the Theory of Computing*,
1971, pp. 151-158.
- Dennis Shasha and Cathy Lazere,
*Out of Their Minds: The Lives and
Discoveries of 15 Great Computer Scientists*, Copernicus, 1995.

Back to Theory of Computing Hall of Fame Main Page

Back to CS 462 home page

*cs462@descartes*

September 10 1997