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

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

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

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

The Turing Test, a concept introduced by Alan Turing in 1950, has been a foundation concept for evaluating a machine's ability to exhibit human-like intelligence. But as we edge closer to the ...

Turing machines are widely believed to be universal, in the sense that any computation done by any system can also be done by a Turing machine. In a new article, researchers present their work ...