acm-header
Sign In

Communications of the ACM

News


bg-corner

An edited collection of advanced computing news from Communications of the ACM, ACM TechNews, other ACM resources, and news sites around the Web.


Alan Turing and the Power of Negative Thinking
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.

New Codes Could Make Quantum Computing 10 Times More Efficient
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...

Complexity Theory's 50-Year Journey to the Limits of Knowledge
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...

The Most Important Machine That Was Never Built
From ACM News

The Most Important Machine That Was Never Built

When he invented Turing machines in 1936, Alan Turing also invented modern computing.

How Randomness Improves Algorithms
From ACM News

How Randomness Improves Algorithms

Unpredictability can help computer scientists solve otherwise intractable problems.

Researchers Discover a More Flexible Approach to Machine Learning
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. ...

Finally, a Fast Algorithm for Shortest Paths on Negative Graphs
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.

Physicists Create a Wormhole Using a Quantum Computer
From ACM News

Physicists Create a Wormhole Using a Quantum Computer

Exploring the possibility that space-time somehow emerges from quantum information.

Cryptography's Future Will Be Quantum-Safe. Here’s How It Will Work
From ACM News

Cryptography's Future Will Be Quantum-Safe. Here’s How It Will Work

Lattice cryptography promises to protect secrets from the attacks of far-future quantum computers.

Self-Taught AI Shows Similarities to How the Brain Works
From ACM News

Self-Taught AI Shows Similarities to How the Brain Works

Self-supervised learning allows a neural network to figure out for itself what matters. The process might be what makes our own brains so successful.

Computer Science Proof Unveils Unexpected Form of Entanglement
From ACM News

Computer Science Proof Unveils Unexpected Form of Entanglement

Three computer scientists have solved the NLTS conjecture, proving that systems of entangled particles can remain difficult to analyze even away from extremes. ...

The Scientist Who Developed a New Way to Understand Communication
From ACM News

The Scientist Who Developed a New Way to Understand Communication

Mark Braverman has spent his career translating thorny problems into the language of information complexity.

By Exploring Virtual Worlds, AI Learns in New Ways
From ACM News

By Exploring Virtual Worlds, AI Learns in New Ways

Intelligent beings learn by interacting with the world. Artificial intelligence researchers have adopted a similar strategy to teach their virtual agents new skills...

Researchers Achieve 'Absurdly Fast' Algorithm for Network Flow
From ACM News

Researchers Achieve 'Absurdly Fast' Algorithm for Network Flow

Computer scientists can now solve a decades-old problem in practically the time it takes to write it down.

Researchers Identify 'Master Problem' Underlying All Cryptography
From ACM News

Researchers Identify 'Master Problem' Underlying All Cryptography

The existence of secure cryptography depends on one of the oldest questions in computational complexity.

AI Overcomes Stumbling Block on Brain-Inspired Hardware
From ACM News

AI Overcomes Stumbling Block on Brain-Inspired Hardware

Algorithms that use the brain's communication signal can now work on analog neuromorphic chips, which closely mimic our energy-efficient brains.

Computer Scientists Eliminate Pesky Quantum Computations
From ACM News

Computer Scientists Eliminate Pesky Quantum Computations

For years, intermediate measurements made it hard to quantify the complexity of quantum algorithms. New work establishes that those measurements aren't necessary...

What Does It Mean for AI to Understand?
From ACM News

What Does It Mean for AI to Understand?

It's simple enough for AI to seem to comprehend data, but devising a true test of a machine's knowledge has proved difficult.

A New Link to an Old Model Could Crack the Mystery of Deep Learning
From ACM News

A New Link to an Old Model Could Crack the Mystery of Deep Learning

To help them explain the shocking success of deep neural networks, researchers are turning to older but better-understood models of machine learning.

Matrix Multiplication Inches Closer to Mythic Goal
From ACM News

Matrix Multiplication Inches Closer to Mythic Goal

A recent paper set the fastest record for multiplying two matrices. But it also marks the end of the line for a method researchers have relied on for decades to...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account