Comment by smiljo

Easy one for me: Stephen A. Cook. Proved that SAT was NP-complete and formulated the P vs. NP problem.

IMO, even among Turing Award winners there are tiers, and he's in the top one in my book.