Search results
Stephen Arthur Cook OC OOnt (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.
- On the Minimum Computation Time of Functions (1966)
Stephen A. Cook. University Professor Emeritus Department of Computer Science University of Toronto Toronto, Canada M5S 3G4. Tel: (416) 978-5183 sacook [at] cs [dot] toronto [dot] edu Office: Sandford Fleming 2303C. I am a member of the Theory Group in the Computer Science Department.
Stephen Arthur Cook (born Dec. 14, 1939, Buffalo, N.Y., U.S.) American computer scientist and winner of the 1982 A.M. Turing Award, the highest honour in computer science, for his “advancement of our understanding of the complexity of computation in a significant and profound way.”
- William L. Hosch
People also ask
Who is Stephen Cook?
Who is Professor Cook?
Who is Gordon Cook?
How did James Cook influence computer science?
He has also done significant work in areas including automata theory, parallel computation, program language semantics and verification, computational algebra, and computability and complexity in higher types. Professor Cook’s work has received extensive recognition. He was awarded the ACM Turing Award in 1982.
May 27, 2020 · Stephen Cook is the foundational thinker behind this field-defining question. Cook was an undergraduate at the University of Michigan and earned his PhD in mathematics at Harvard in 1966; his dissertation, on the computational complexity of multiplication, improved an essential algorithm now known as Toom-Cook multiplication.
Cook–Levin theorem. In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. That is, it is in NP, and any problem in NP can be reduced in polynomial time by a deterministic Turing machine to the Boolean satisfiability problem.
