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?

If so, the argument went, the very foundations of mathematics would be flawed, and the entire subject would collapse like a house of cards. As mathematicians determined in the 1960s, however ...