Sources
Help build the largest human-edited directory on the web.
Submit a site - Become an editor
Wikipedia. Licensed under the GNU Free Documentation License.
Are you an expert in this subject? Join the discussion and share your knowledge at Wikipedia.org.
Stephen Cook
From Wikipedia, the free encyclopedia
| Stephen Arthur Cook | |
|---|---|
 |
|
| Born | 1939 Buffalo, New York |
| Field | Computer Science |
| Institutions | University of California, Berkeley University of Toronto |
| Alma mater | Harvard University |
| Academic advisor | Hao Wang |
| Notable students | Walter Savitch |
| Known for | NP-completeness |
| Notable prizes | Turing Award |
Stephen Arthur Cook (born 1939, Buffalo, New York) is a noted computer scientist.
Cook formalised the notion of NP-completeness in a famous 1971 paper "The Complexity of Theorem Proving Procedures", which also contained Cook's theorem, a proof that the boolean satisfiability problem is NP-complete. The paper left unsolved the greatest open question in theoretical computer science - whether complexity classes P and NP are equivalent.
Cook received the Turing Award in 1982 for his discovery. His citation reads:
For his advancement of our understanding of the complexity of computation in a significant and profound way. His seminal paper, The Complexity of Theorem Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness. The ensuing exploration of the boundaries and nature of NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade.
He received his Bachelor's degree in 1961 from the University of Michigan. At Harvard University, he received his Master's degree in 1962 and his Ph.D. in 1966. From 1966 to 1970 he was Assistant Professor at the University of California, Berkeley in the math department, which infamously denied him tenure. In a speech celebrating the 30th anniversary of the Berkeley EECS department, fellow Turing Award winner and Berkeley professor Richard Karp said that, "It is to our everlasting shame that we were unable to persuade the math department to give him tenure." [1] Cook then joined the faculty at the University of Toronto in 1970 as an Associate Professor, and was promoted to Professor in 1975 and University Professor in 1985 in the Computer Science Department and Mathematics Department.
- Home page of Stephen A. Cook
- NSERC biography of Stephen Cook
- Stephen Cook at the Mathematics Genealogy Project
|
|
|---|
|
Perlis (1966) • Wilkes (1967) • Hamming (1968) • Minsky (1969) • Wilkinson (1970) • McCarthy (1971) • Dijkstra (1972) • Bachman (1973) • Knuth (1974) • Newell / Simon (1975) • Rabin / Scott (1976) • Backus (1977) • Floyd (1978) • Iverson (1979) • Hoare (1980) • Codd (1981) • Cook (1982) • Thompson / Ritchie (1983) • Wirth (1984) • Karp (1985) • Hopcroft / Tarjan (1986) • Cocke (1987) • Sutherland (1988) • Kahan (1989) • Corbató (1990) • Milner (1991) • Lampson (1992) • Hartmanis / Stearns (1993) • Feigenbaum / Reddy (1994) • Blum (1995) • Pnueli (1996) • Engelbart (1997) • Gray (1998) • Brooks (1999) • Yao (2000) • Dahl / Nygaard (2001) • Rivest / Shamir / Adleman (2002) • Kay (2003) • Cerf / Kahn (2004) • Naur (2005) • Allen (2006) |
| Persondata | |
|---|---|
| NAME | Cook, Stephen Arthur |
| ALTERNATIVE NAMES | |
| SHORT DESCRIPTION | Computer scientist |
| DATE OF BIRTH | 1939 |
| PLACE OF BIRTH | Buffalo, New York |
| DATE OF DEATH | |
| PLACE OF DEATH | |