What's up in


An abstract illustration showing broken tools, cubes, numbers and other abstract representations of impossible math
Quantized Columns

When Math Gets Impossibly Hard

September 14, 2020

Mathematicians have long grappled with the reality that some problems just don’t have solutions.


Conducting the Mathematical Orchestra From the Middle

September 2, 2020

Emily Riehl is rewriting the foundations of higher category theory while also working to make mathematics more inclusive.

Illustration of a robot and a human furiously doing math next to each other
artificial intelligence

How Close Are Computers to Automating Mathematical Reasoning?

August 27, 2020

AI tools are shaping next-generation theorem provers, and with them the relationship between math and machine.

Gödel’s incompleteness theorems.
Abstractions blog

How Gödel’s Proof Works

July 14, 2020

His incompleteness theorems destroyed the search for a mathematical theory of everything. Nearly a century later, we’re still coming to grips with the consequences.


The Map of Mathematics

February 13, 2020

Explore our surprisingly simple, absurdly ambitious and necessarily incomplete guide to the boundless mathematical universe.

foundations of mathematics

With Category Theory, Mathematics Escapes From Equality

October 10, 2019

Two monumental works have led many mathematicians to avoid the equal sign. The process has not always gone smoothly.

Art for "The Subtle Art of the Mathematical Conjecture"
Quantized Columns

The Subtle Art of the Mathematical Conjecture

May 7, 2019

It’s an educated guess, not a proof. But a good conjecture will guide math forward, pointing the way into the mathematical unknown.


A Fight to Fix Geometry’s Foundations

February 9, 2017

When two mathematicians raised pointed questions about a classic proof that no one really understood, they ignited a years-long debate about how much could be trusted in a new kind of geometry.

computer security

Hacker-Proof Code Confirmed

September 20, 2016

Computer scientists can prove certain programs to be error-free with the same certainty that mathematicians prove theorems.