In 2012 I, along with a group of like-minded colleagues, signed up to take on an audacious goal: we helped open New York City’s first public high school focused on computing. We didn’t know it at the ...

When scientists struggle with a problem for over a decade, few of them think, “I know! I’ll ask computer gamers to help.” That, however, is exactly what Firas Khatib from the University of Washington ...

Quantum computing has entered a bit of an awkward period. There have been clear demonstrations that we can successfully run quantum algorithms, but the qubit counts ...

A powerful technique called SAT solving could work on the notorious Collatz conjecture. But it’s a long shot. But Heule, a computer scientist at Carnegie Mellon University, has set his sights on an ...

Researchers from the Department of Electrical Engineering at Tokyo University of Science in Japan have developed what “a novel approach” to combinatorial optimisation problems (COPs). COPs are ...

Many important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem ...

Quantum computers have already managed to surpass ordinary computers in solving certain tasks - unfortunately, totally useless ones. The next milestone is to get them to do useful things. Researchers ...

Fifty-odd atoms buzz through a pocket of empty space. Invisible lines of force — quantum magnetism — chain them together. Jiggle one, the others jiggle in sympathy. Ring another like a bell and the ...