Stephen Arthur Cook (born in 1939 with Buffalo in the State of New York) is a data processing specialist who formalized the concept of Np-complétude.
Il is the author of the publication The Complexity off Theorem Proving Procedures in which it establishes the Théorème of Cook, which proves that problem SAT is Np-complete.

Distinctions

• 1982 - Turing Award
• 1984 - Member of the royal Company of Canada
• 1997 - Price Izaak-Walton-Killam
• 1999 - Price CRM-Fields-PIMS
• 2005 - Outstanding commendation award of the CRSNG