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 ...

Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

Theory of Computation offers a rigorous mathematical framework that underpins our understanding of what can be computed and how efficiently these computations may be performed. It encompasses ...

Though as with so many independent inventors the origins of computing can be said to have been arrived at through the work of many people, Alan Turing is certainly one of the foundational figures in ...

The Journal of Symbolic Logic (JSL) was founded in 1936 and it has become the leading research journal in the field. It is issued quarterly. Volume 71, being published during 2006, will consist of ...

Researchers have used metamathematical techniques to show that certain theorems that look superficially distinct are in fact ...

As a practising computer scientist, I thought I had a fairly good grasp of Alan Turing’s many contributions to the field. But The Turing Guide, by Jack Copeland, Jonathan Bowen, Mark Sprevak and Robin ...

The Church-Turing limit restricts all current computation, including quantum computers, to rational number computation. This is because quantum computer designs (still not scalable even with high ...

On Saturday, British mathematician Alan Turing would have turned 100 years old. It is barely fathomable to think that none of the computing power surrounding us today was around when he was born. But ...