Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of organisms to tackle difficult and often overwhelming problems. For example, ...

Researchers have successfully used a quantum algorithm to solve a complex century-old mathematical problem long considered impossible for even the most powerful conventional supercomputers. The ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

The Post Correspondence Problem is an undecidable problem in which you’re given two lists of strings, and the goal is to find a sequence of indices such that the ...

The Post Correspondence Problem (PCP) is an undecidable problem. It asks whether a set of domino-like pairs of strings can be arranged in a sequence so that the top and bottom strings match. There's ...

The original version of this story appeared in Quanta Magazine. The world of mathematics is full of unreachable corners, where unsolvable problems live. Now, yet another has been exposed. In 1900, the ...

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal. Computer scientists often ...

Mr. Ferguson is a documentary filmmaker. As you scroll through the internet, you’ve probably noticed the same problem Kirby Ferguson has: “Everything looks the same, sounds the same, is the same.” In ...