Stephen Cook is University Professor Emeritus of Computer Science at the
University of Toronto. He is the 1982 Turing Award Winner and the 2012
winner of the NSERC Gerhard Herzberg Canada Gold Medal for Science and
Engineering. He has made extensive contributions to computational
complexity, including his 1971 paper introducing the theory of NP
Completeness. He is one of the founders of the field of propositional
proof complexity. Cook is an Officer of the Order of Canada,
a Fellow of the royal Society of London and the Royal Society of Canada.
He is a member of the National Academy of Sciences (USA) and
a Fellow of the American Academy of Arts and Science, and a Fellow of the
ACM. In 2016 he won a Canadian Association of Computer Science Lifetime
Achievement Award, and The BBVA Frontiers of Knowledge Award in
Information and Computer Technologies.
Thirty three students have completed their Ph.D. degrees under his