Computability

You don’t need 0s and 1s to perform computations, and in some cases it’s better to avoid them.

After decades of uncertainty, a motley team of programmers has proved precisely how complicated simple computer programs can get.

Two mathematicians have shown that origami can, in principle, be used to perform any possible computation.

Researchers prove that navigating certain systems of vectors is among the most complex computational problems.

Mathematical proofs based on a technique called diagonalization can be relentlessly contrarian, but they help reveal the limits of algorithms.

How hard is it to prove that problems are hard to solve? Meta-complexity theorists have been asking questions like this for decades. A string of recent results has started to deliver answers.

When he invented Turing machines in 1936, Alan Turing also invented modern computing.

The goal of the “busy beaver” game is to find the longest-running computer program. Its pursuit has surprising connections to some of the most profound questions and concepts in mathematics.

Computer scientists established a new boundary on computationally verifiable knowledge. In doing so, they solved major open problems in quantum mechanics and pure mathematics.