## Latest Articles

### How Randomness Improves Algorithms

Unpredictability can help computer scientists solve otherwise intractable problems.

### Bob Metcalfe, Ethernet Pioneer, Wins Turing Award

The American researcher was recognized for his central role in inventing, standardizing and commercializing the ubiquitous networking technology.

### In Neural Networks, Unbreakable Locks Can Hide Invisible Doors

Cryptographers have shown how perfect security can undermine machine learning models.

### The Computer Scientist Who Finds Life Lessons in Games

In Shang-Hua Teng’s work, theoretical and practical questions have long been intertwined. Now he’s turning his focus to the impractical.

### Finally, a Fast Algorithm for Shortest Paths on Negative Graphs

Researchers can now find the shortest route through a network nearly as fast as theoretically possible, even when some steps can cancel out others.

### New Algorithm Closes Quantum Supremacy Window

Random circuit sampling, a popular technique for showing the power of quantum computers, doesn’t scale up if errors go unchecked.

### AI Reveals New Possibilities in Matrix Multiplication

Inspired by the results of a game-playing neural network, mathematicians have been making unexpected advances on an age-old math problem.

### Chaos Researchers Can Now Predict Perilous Points of No Return

A custom-built machine learning algorithm can predict when a complex system is about to switch to a wildly different mode of behavior.

### Wheel Made of ‘Odd Matter’ Spontaneously Rolls Uphill

Physicists have solved a key problem of robotic locomotion by revising the usual rules of interaction between simple component parts.