What's up in
Some researchers are using a complexity framework thought to be purely theoretical to understand evolutionary dynamics in biological and computational systems.
Urmila Mahadev spent eight years in graduate school solving one of the most basic questions in quantum computation: How do you know whether a quantum computer has done anything quantum at all?
A visual prank exposes an Achilles’ heel of computer vision systems: Unlike humans, they can’t do a double take.
Machine learning techniques are commonly based on how the visual system processes information. To beat their limitations, scientists are drawing inspiration from the sense of smell.
Computer vision researchers have uncovered a world of visual signals hiding in our midst, including subtle motions that betray what’s being said and faint images of what’s around a corner.
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.
The theoretical computer scientist Constantinos Daskalakis has won the Rolf Nevanlinna Prize for explicating core questions in game theory and machine learning.
18-year-old Ewin Tang has proven that classical computers can solve the “recommendation problem” nearly as fast as quantum computers. The result eliminates one of the best examples of quantum speedup.
What’s easy for a computer to do, and what’s almost impossible? Those questions form the core of computational complexity. We present a map of the landscape.