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
• Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
• Random self-reducibilityen.wikipedia.org
• Impagliazzo's Five Worldsblog.computationalcomplexity.org
• Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
• The Power of Noise — LessWronglesswrong.com
• aaronson-philosophy.pdfcs.princeton.edu
• Stephen Wolfram Writingswritings.stephenwolfram.com
• What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
• P versus NP problem - Wikipediaen.wikipedia.org
• Complexity class - Wikipediaen.wikipedia.org
• Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org