When you purchase through links on our internet site , we may earn an affiliate commission . Here ’s how it works .
The 2023 Turing Award has been given toAvi Wigderson , a mathematician who discovered the unusual link between calculation and randomness .
Wigderson was announce the success of the Association for Computing Machinery ( ACM ) A.M. Turing Award , often called the " Nobel Prizeof Computing , " on April 10 , 2024 .
Avi Wigderson is the winner of the 2023 Turning Award for his studies in randomness.
The award , given with a plunder of $ 1 million , comes just three eld after Wigderson , a professor of mathematics at the Institute for Advanced Study in Princeton , New Jersey , won the 2021 Abel Award for his contribution to computer science . Wigderson ’s theoretic work has been key to the growing of numerous advances incomputing , from cloud networks to cryptography methods that underpin cryptocurrencies .
" Wigderson is a towering cerebral force play in theoretical information processing system science , an exciting discipline that appeal some of the most bright unseasoned researcher to work on the most difficult challenges,“Yannis Ioannidis , chairman of the ACM , state in a statement . " This year ’s Turing Award agnize Wigderson ’s specific study on stochasticity , as well as the collateral but substantial wallop he has had on the integral athletic field of theoretical data processor skill . "
Related : Scientists uncover hide math that governs genetic mutation
electronic computer algorithms are deterministic by nature , which enables them to make predictions but also limits their grasp of the messy randomness found in the literal world . In fact , many trouble are considered computationally “ laborious ” , and deterministic algorithms struggle to solve them efficiently .
— Newly discovered ' einstein ' tile is a 13 - sided shape that solves a decades - sure-enough maths problem
— Centuries erstwhile ' unimaginable math job crack using physics of Schrödinger ’s cat
— Two mathematicians just solved a decades - old mathematics conundrum — and possibly the substance of life
But Wigderson and his colleagueRichard Karp , a computer scientist at the University of California , Berkeley , receive a way to tame computational rigorousness . After inserting randomness into their algorithms , they found that they made some trouble much easier to solve .
Wigderson chase this observation , proving in later work that the reversal also applied : Randomness could always be stripped from probabilistic algorithmic program to translate them into deterministic ones . His finding illuminated the connexion between computational hardness and randomness in style that reshape calculator science .
" From the earliest Day of computer scientific discipline , researchers have recognized that incorporating randomness was a path to project faster algorithms for a wide range of applications,“Jeff Dean , principal scientist at Google Research and Google DeepMind , read in the statement . " sweat to better understand randomness continue to concede significant benefit to our field , and Wigderson has open up new horizons in this arena . "
