Kevin Hartnett

The legendary mathematician, who died on April 11, 2020 was curious, colorful and one of the greatest problem-solvers of his generation.

A landmark proof in computer science has also solved an important problem called the Connes embedding conjecture. Mathematicians are working to understand it.

“Rainbow colorings” recently led to a new proof. It’s not the first time they’ve come in handy.

A startling experimental discovery about how fluids behave started a wave of important mathematical proofs.

Today Google announced that it achieved “quantum supremacy.” Its chief quantum computing rival, IBM, said it hasn’t. The disagreement hinges on what the term really means.

A major advance toward solving the 60-year-old sunflower conjecture is shedding light on how order begins to appear as random systems grow in size.

In some ways, machine vision is superior to human vision. In other ways, it may never catch up.

Researchers are getting close to building a quantum computer that can perform tasks a classical computer can’t. Here’s what the milestone will mean.

Neven’s law states that quantum computers are improving at a “doubly exponential” rate. If it holds, quantum supremacy is around the corner.

Randomness would seem to make a mathematical statement harder to prove. In fact, it often does the opposite.

In practice, quantum computers can’t run many programs that classical computers can, because they’re not allowed to selectively forget information. A new algorithm for multiplication shows a way around that problem.

Recent progress on the “sum product” problem recalls a celebrated mathematical result that revealed the power of miniature number systems.