Communications of the ACM
An edited collection of advanced computing news from Communications of the ACM, ACM TechNews, other ACM resources, and news sites around the Web.
From ACM News
Alan Turing and the Power of Negative Thinking
Mathematical proofs based on a technique called diagonalization can be relentlessly contrarian, but they help reveal the limits of algorithms.
From ACM News
New Codes Could Make Quantum Computing 10 Times More Efficient
Quantum computing is still really, really hard. But the rise of a powerful class of error-correcting codes suggests that the task might be slightly more feasible...
From ACM News
Complexity Theory's 50-Year Journey to the Limits of Knowledge
How hard is it to prove that problems are hard to solve? Meta-complexity theorists have been asking questions like this for decades. A string of recent results...
From ACM News
The Most Important Machine That Was Never Built
When he invented Turing machines in 1936, Alan Turing also invented modern computing.
From ACM News
How Randomness Improves Algorithms
Unpredictability can help computer scientists solve otherwise intractable problems.
From ACM News
Researchers Discover a More Flexible Approach to Machine Learning
"Liquid" neural nets, based on a worm's nervous system, can transform their underlying algorithms on the fly, giving them unprecedented speed and adaptability. ...
From ACM News
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.
From ACM News
Physicists Create a Wormhole Using a Quantum Computer
Exploring the possibility that space-time somehow emerges from quantum information.
From ACM News