What's up in



Universal Method to Sort Complex Information Found

The nearest neighbor problem asks where a new point fits into an existing data set. A few researchers set out to prove that there was no universal way to solve it. Instead, they found such a way.

Photo illustration of Constantinos Daskalakis
2018 Fields Medal and Nevanlinna Prize Winners

A Poet of Computation Who Uncovers Distant Truths

The theoretical computer scientist Constantinos Daskalakis has won the Rolf Nevanlinna Prize for explicating core questions in game theory and machine learning.

Illustration for "Finally, A Problem That Only Quantum Computers Will Ever Be Able to Solve"
computational complexity

Finally, a Problem That Only Quantum Computers Will Ever Be Able to Solve

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.

Art for "A Classical Math Problem Gets Pulled Into the Modern World"

A Classical Math Problem Gets Pulled Into the Modern World

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.

Lede art for "First Big Steps Toward Proving the Unique Games Conjecture"
computational complexity

First Big Steps Toward Proving the Unique Games Conjecture

The latest in a new series of proofs brings theoretical computer scientists within striking distance of one of the great conjectures of their discipline.

520px photo of smarticles
Computer Science

Smart Swarms Seek New Ways to Cooperate

New algorithms show how swarms of very simple robots can be made to work together as a group.

520px illustration for Quantum Supremacy
The Future of Quantum Computing

Quantum Algorithms Struggle Against Old Foe: Clever Computers

The quest for “quantum supremacy” – unambiguous proof that a quantum computer does something faster than an ordinary computer – has paradoxically led to a boom in quasi-quantum classical algorithms.

A blue person made of code walks down a pink road patterned with hexagons

Best-Ever Algorithm Found for Huge Streams of Data

To efficiently analyze a firehose of data, scientists first have to break big numbers into bits.

Abstractions blog

One-Way Salesman Finds Fast Path Home

The real-world version of the famous “traveling salesman problem” finally gets a good-enough solution.