 |
Stephen Arthur CookAmerican computer scientist
Date of Birth: 14.12.1939
Country:  USA |
Content:
Biography of Stephen Arthur Cook
Early Life and EducationStephen Arthur Cook, an American scientist in the field of computational theory, was born on December 14, 1939. He obtained his Bachelor's degree from the University of Michigan in 1961. The following year, he completed his Master's degree at Harvard University, and in 1966, he earned his Doctor of Philosophy (PhD) degree from the same institution.
Academic Career
From 1966 to 1970, Cook worked as an assistant professor of mathematics at the University of California, Berkeley. However, he was not granted tenure during his time there, which was later acknowledged as a mistake by Richard Karp, the Turing Award laureate in 1985. Karp expressed regret, stating, "It is to our everlasting shame that we were unable to persuade the math department to give him tenure."
In 1975, Cook was honored by the University of Toronto, which appointed him as a professor. He continued his academic career at the university, making significant contributions to the field of computational theory.
Contributions and Achievements
Stephen Cook is famous for his work on the theory of computational complexity. In his groundbreaking paper, "The Complexity of Theorem Proving Procedures," published in 1971, Cook proved that the satisfiability problem for Boolean formulas is NP-complete. This significant result raised the question of the equality of complexity classes P and NP, which remains one of the most challenging open problems in computational theory.
For his exceptional contributions, Cook was awarded the Turing Award in 1982. This prestigious recognition is considered the highest honor in the field of computer science.
Legacy and Influence
Stephen Arthur Cook's work continues to shape the field of computational theory. His insights into the complexity of computational problems and the relationship between P and NP have had a profound impact on the development of algorithms and the understanding of computational limitations.
Today, Cook's findings serve as the foundation for ongoing research and exploration in the field of computational complexity theory. His work remains highly influential, and his contributions continue to inspire and guide future generations of scientists and researchers.
