Stephen Ornes in Quanta:
For more than 40 years, Avi Wigderson has studied problems. But as a computational complexity theorist, he doesn’t necessarily care about the answers to these problems. He often just wants to know if they’re solvable or not, and how to tell. “The situation is ridiculous,” said Wigderson, a computer scientist at the Institute for Advanced Study in Princeton, New Jersey. No matter how hard a question seems, an efficient way to answer it could be hiding just out of reach. “As far as we know, for every problem that we face and try to solve, we can’t rule out that it has an algorithm that can solve it. This is the single most interesting problem for me.”
Today Wigderson was named the winner of the A.M. Turing Award, widely considered one of the top honors in computer science, for his foundational contributions to the theory of computation.
More here.