Avi Wigderson wins the Turing Award for foundational contributions to the theory of computation, especially in reshaping our understanding of the role of randomness in computation and for his decades of leadership in theoretical computer science.
Wigderson's research on computational complexity and randomness in computation revealed that conventional, deterministic algorithms can be as efficient as 'randomized' ones, indicating that random algorithms can be equally accurate.
Wigderson is hailed as a towering intellectual force in theoretical computer science by ACM president Yannis Ioannidis for his significant contributions in the field.
#avi-wigderson #computational-theory #a-m-turing-award #randomness-in-algorithms #computational-complexity
[
add
]
[
|
|
...
]