18-year-old Ewin Tang has proven that classical computers can solve the “recommendation problem” nearly as fast as quantum computers. The result eliminates one of the best examples of quantum speedup.

What’s easy for a computer to do, and what’s almost impossible? Those questions form the core of computational complexity. We present a map of the landscape.

Computer scientists have been searching for years for a type of problem that a quantum computer can solve but that any possible future classical computer cannot. Now they’ve found one.

A century ago, the great mathematician David Hilbert posed a probing question in pure mathematics. A recent advance in optimization theory is bringing Hilbert’s work into a world of self-driving cars.

Mathematicians have disproved the strong cosmic censorship conjecture. Their work answers one of the most important questions in the study of general relativity and changes the way we think about space-time.

Judea Pearl, a pioneering figure in artificial intelligence, argues that AI has been stuck in a decades-long rut. His prescription for progress? Teach machines to understand the question why.

Zeta values seem to connect distant geometric worlds. In a new proof, mathematicians finally explain why.

Decades after physicists happened upon a stunning mathematical coincidence, researchers are getting close to understanding the link between two seemingly unrelated geometric universes.

Generations of researchers have pursued his “Langlands program,” which seeks to create a grand unified theory of mathematics.