Computability theory establishes which problems can in principle be solved by mechanical procedures, formalised by the Turing machine model and its equivalents. It draws a firm boundary between ...

The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more. For more than 40 years, Avi Wigderson ...