Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award | Quanta Magazine
The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more.
Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award | Quanta Magazine Home Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award Read Later Share Copied! Comments Read Later Read Later Turing Award Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award By Stephen Ornes April 10, 2024 The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more. Read Later Avi Wigderson won the Turing Award for his wide-ranging contributions to the theory of computation. Talia Herman for Quanta
related reading
- Computational Complexityblog.computationalcomplexity.org
- Shtetl-Optimizedscottaaronson.blog
- Random self-reducibilityen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Impagliazzo's Five Worldsblog.computationalcomplexity.org
- The Power of Noise — LessWronglesswrong.com
- aaronson-philosophy.pdfcs.princeton.edu
- Complexity Theory’s 50-Year Journey to the Limits of Knowledge | Quanta Magazinequantamagazine.org
- P versus NP problem - Wikipediaen.wikipedia.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Complexity class - Wikipediaen.wikipedia.org
- Stephen Wolfram Writingswritings.stephenwolfram.com