Computer science

Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields.

By harnessing randomness, a new algorithm achieves a fundamentally novel — and faster — way of performing one of the most basic computations in math and computer science.

In a second season of enlightened conversations, Steven Strogatz and leading researchers nourish our pandemic-starved minds.

To the surprise of experts in the field, a postdoctoral statistician has solved one of the most important problems in high-dimensional convex geometry.

The learning algorithm that enables the runaway success of deep neural networks doesn’t work in biological brains, but researchers are finding alternatives that could.

Two teams found different ways for quantum computers to process nonlinear systems by first disguising them as linear ones.

Even as mathematicians and computer scientists proved big results in computational complexity, number theory and geometry, computers proved themselves increasingly indispensable in mathematics.

Today’s information age is only possible thanks to the groundbreaking work of a lone genius.

The goal of the “busy beaver” game is to find the longest-running computer program. Its pursuit has surprising connections to some of the most profound questions and concepts in mathematics.