Stephen Cook, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the creation and reception of his classic 1971 paper “The Complexity of Theorem-Proving Procedures“. This clip taken from an interview conducted with Cook by Bruce Kapron for the ACM on February 25, 2016. Video of the full interview is available as part of Cook’s ACM profile at [ Ссылка ].
