Stephen Cook

Stephen Cook
OC OOnt
Stephen Cook OC OOnt
	Cook in 2008
Born	Stephen Arthur Cook; December 14, 1939; Buffalo, New York
Education	University of Michigan (BA); Harvard University (MA, PhD)
Known for	NP-completeness ; Propositional proof complexity ; Cook–Levin theorem
Awards	Turing Award (1982); Gödel Lecture (1999); CRM-Fields-PIMS prize (1999); John L. Synge Award (2006); Bernard Bolzano Medal (2008); Gerhard Herzberg Canada Gold Medal for Science and Engineering (2012); Officer of Order of Canada (2015); BBVA Foundation Frontiers of Knowledge Award (2015);
	Scientific career
Fields	Computer Science
Institutions	University of Toronto; University of California, Berkeley
Thesis	On the Minimum Computation Time of Functions (1966)
Doctoral advisor	Hao Wang
Doctoral students	Mark Braverman; Toniann Pitassi ; Walter Savitch ; Arvind Gupta ; Anna Lubiw

Stephen Arthur Cook (born December 14, 1939) is an American-Canadian computer scientist and mathematician who has made significant contributions to the fields of complexity theory and proof complexity. He is a university professor emeritus at the University of Toronto, Department of Computer Science and Department of Mathematics.

Cook is considered one of the forefathers of computational complexity theory. He won the 1982 ACM Turing Award.