Proofs

Three researchers have figured out how to craft a proof that spreads out information while keeping it perfectly secret.

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

How are scientists able to crack fundamental questions about nature and life? How does math make the complex cosmos understandable? In this episode, the physicist Nigel Goldenfeld and co-host Steven Strogatz explore the deep foundations of the scientific process.

Terence Tao, who has been called the “Mozart of Mathematics,” wrote an essay in 2007 about the common ingredients in “good” mathematical research. In this episode, the Fields Medalist joins Steven Strogatz to revisit the topic.

A team of four prominent mathematicians, including two Fields medalists, proved a conjecture described as a “holy grail of additive combinatorics.”

Mathematical logic and the code of computer programs are, in an exact way, mirror images of each other.

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

Number theorist Andrew Granville on what mathematics really is — and why objectivity is never quite within reach.

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.