Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently ...

Hands up, who remembers D-Wave? No? Well, don’t worry; it’s still around. D-Wave is a company that is pursuing the development of a scalable quantum computer. And, just in case you forgot about them, ...

NP-complete problems, including optimal routing, scheduling and network design, are foundational to essential tasks across various industries. However, they actually pose challenges for conventional ...

They have a mathematical, analog “solver” that can potentially find the best solution to NP-hard problems. NP-hardness is a theory of computational complexity, with problems that are famous for their ...

Quantum computers get a lot of people excited because they solve problems in a manner that’s fundamentally different from existing hardware. A certain class of mathematical problems, called ...

The molecules that help muscles contract could one day help drive a new kind of molecular supercomputer, researchers said. These biological computers could quickly solve complex problems that ...

Thousands of notoriously difficult problems in computer science are actually the same problem in disguise If you're enjoying this article, consider supporting our award-winning journalism by ...

Has the biggest question in computer science been solved? On 6 August, Vinay Deolalikar, a mathematician at Hewlett-Packard Labs in Palo Alto, California, sent out draft copies of a paper titled ...

IF YOU have ever struggled to complete classic Nintendo games, don’t feel bad – they are officially difficult. An analysis of the computational complexity of video games, including those in the Mario ...