Quote


Voting: - 32 +
It turns out Cook later won the Turing award for this proof. Goes to show that you don't really have to do anything deep to get recognized in computer science.
— John Hopcroft, on the proof that SAT is NP-Complete · Nov. 6, 2017