What's up in

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.

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.

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.

Judea Pearl, a pioneering figure in artificial intelligence, argues that AI has been stuck in a decades-long rut. His prescription for progress? Teach machines to understand the question why.

Faced with a navigational challenge, neural networks spontaneously evolved units resembling the grid cells that help living animals find their way.