Stephen Cook Alive
Defined NP-completeness with the Cook–Levin theorem (1971) — the question the P vs NP problem is about.
19251950197520002025
Defined NP-completeness (1971) — the Cook–Levin theorem, SAT is NP-complete — and created the question that defines theoretical CS.\n\nTuring Award 1982; the P vs NP problem is his formulation.