Stephen Arthur Cook, (born December 14, 1939) is an American-Canadian computer scientist and mathematician who has made major contributions to the fields of complexity theory and proof complexity.

He is a university professor at the University of Toronto, Department of Computer Science and Department of Mathematics. ==Biography== Cook received his Bachelor's degree in 1961 from the University of Michigan, and his Master's degree and Ph.D.

from Harvard University, respectively in 1962 and 1966, from the Mathematics Department.

from Harvard University, respectively in 1962 and 1966, from the Mathematics Department.

He joined the University of California, Berkeley, mathematics department in 1966 as an assistant professor, and stayed there until 1970 when he was denied reappointment.

He joined the University of California, Berkeley, mathematics department in 1966 as an assistant professor, and stayed there until 1970 when he was denied reappointment.

Cook recounted his move to the University of Toronto in 1970 and the reception of his work on NP-completeness, leading up to his A.M.

In his seminal 1971 paper "The Complexity of Theorem Proving Procedures", Cook formalized the notions of polynomial-time reduction (also known as Cook reduction) and NP-completeness, and proved the existence of an NP-complete problem by showing that the Boolean satisfiability problem (usually known as SAT) is NP-complete.

His seminal paper, The Complexity of Theorem Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness.

The ensuing exploration of the boundaries and nature of NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade. In his "Feasibly Constructive Proofs and the Propositional Calculus" paper published in 1975, he introduced the equational theory PV (standing for Polynomial-time Verifiable) to formalize the notion of proofs using only polynomial-time concepts.

Steacie Memorial Fellowship in 1977, a Killam Research Fellowship in 1982, and received the CRM-Fields-PIMS prize in 1999.

He made another major contribution to the field in his 1979 paper, joint with his student Robert A.

Yet, the conjecture remains open and is among the seven famous Millennium Prize Problems. In 1982, Cook received the Turing Award for his contributions to complexity theory.

Steacie Memorial Fellowship in 1977, a Killam Research Fellowship in 1982, and received the CRM-Fields-PIMS prize in 1999.

Cook was elected to membership in the National Academy of Sciences (United States) and the American Academy of Arts and Sciences. Cook won the ACM Turing Award in 1982. Association for Computing Machinery honored him as a Fellow of ACM in 2008 for his fundamental contributions to the theory of computational complexity. The Government of Ontario appointed him to the Order of Ontario in 2013, the highest honor in Ontario.

Steacie Memorial Fellowship in 1977, a Killam Research Fellowship in 1982, and received the CRM-Fields-PIMS prize in 1999.

Cook was elected to membership in the National Academy of Sciences (United States) and the American Academy of Arts and Sciences. Cook won the ACM Turing Award in 1982. Association for Computing Machinery honored him as a Fellow of ACM in 2008 for his fundamental contributions to the theory of computational complexity. The Government of Ontario appointed him to the Order of Ontario in 2013, the highest honor in Ontario.

He has won the 2012 Gerhard Herzberg Canada Gold Medal for Science and Engineering, the highest honor for scientists and engineers in Canada.

Cook was elected to membership in the National Academy of Sciences (United States) and the American Academy of Arts and Sciences. Cook won the ACM Turing Award in 1982. Association for Computing Machinery honored him as a Fellow of ACM in 2008 for his fundamental contributions to the theory of computational complexity. The Government of Ontario appointed him to the Order of Ontario in 2013, the highest honor in Ontario.

He was named an Officer of the Order of Canada in 2015. Cook was granted the BBVA Foundation Frontiers of Knowledge Award 2015 in the Information and Communication Technologies category "for his important role in identifying what computers can and cannot solve efficiently," in the words of the jury's citation.

All text is taken from Wikipedia. Text is available under the Creative Commons Attribution-ShareAlike License .

Page generated on 2021-08-05