Avi Wigderson, the 2023 ACM A.M. Turing Award recipient, has made significant contributions to theoretical computer science and mathematics by exploring the role of randomness in complexity. His work on zero-knowledge proofs, which allows for proving statements without revealing additional information, has reshaped fields like privacy and network security. Wigderson’s research on derandomization showed that randomness is not necessary for efficient computation, leading to a deeper understanding of computational complexity. His recent work on non-commutative optimization has connections to algebra, analysis, and quantum information theory. Wigderson’s intellectual curiosity has led him to groundbreaking discoveries with far-reaching applications.
https://cacm.acm.org/opinion/specifying-the-power-and-limitations-of-randomness/