filmov
tv
Stephen Cook, 1982 ACM Turing Award Recipient
![preview_player](https://i.ytimg.com/vi/Uc-F0N2hwKE/sddefault.jpg)
Показать описание
Describes his early life, education, introduction to electronics, higher education and the research that led to the Turing Award.
More information:
More information:
Stephen Cook, 1982 ACM Turing Award Recipient
Cook on his thesis work and introduction to complexity theory.
HLFF Shortcuts: Stephen Arthur Cook
Michael Rabin, 1976 ACM Turing Award Recipient
Leslie Lamport Selected as 2013 ACM A.M. Turing Award Winner
Dr. John Backus, 1977 ACM Turing Award Recipient
5th HLF – Laureate interview: Stephen A. Cook and William Morton Kahan
“Computer Science as a Major Body of Accumulated Knowledge,” at ACM Turing 50 Celebration
HLF Laureate Portraits: Stephen A. Cook
Introduction to 50 Years of the ACM Turing Award Celebration
Lecture by Turing award winner Stephen Cook at Techfest 2013, IIT Bombay
Judea Pearl, 2011 ACM Turing Award Recipient
Cook on “The Complexity of Theorem-Proving Procedures“
Cook thinks that P does not equal NP.
Berkeley ACM A.M. Turing Laureate Interviews: Richard M. Karp
A Reflection: Turing Laureates Take a Brief Look Back on Their Careers and Share Thoughts the Future
'Impact of Turing Recipients' Work,' at ACM Turing 50 Celebration
Stephen Cook on P vs NP
Stephen Cook
Turing Award Series | Stephen Cook | Episode-18
ACM A M Turing Award 2013 - Leslie Lamport
Cook explains why P=NP matters.
Tony Hoare, 1980 ACM Turing Award Recipient
Celebrating 50 Years of the ACM A.M. Turing Award and Computing's Greatest Achievements
Комментарии