The universe of problems that a computer can check has grown. The researchers’ secret ingredient? Quantum entanglement.

Mathematicians have found that materials conduct electricity when electrons follow a universal mathematical pattern.

Quantum computers can’t selectively forget information. A new algorithm for multiplication shows a way around that problem.

By chopping up large numbers into smaller ones, researchers have rewritten a fundamental mathematical speed limit.

Researchers have just released hacker-proof cryptographic code — programs with the same level of invincibility as a mathematical proof.

These games combine quantum entanglement, infinity and impossible-to-calculate winning probabilities. But if researchers can crack them, they’ll reveal deep mathematical secrets.

All descriptions of change are a unique blend of chance and determinism, according to the sweeping mathematical proof of the “weak Pinsker conjecture.”

A two-player game can reveal whether the universe has an infinite amount of complexity.

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

Previous