McGill and Queen's University researchers have built an improved version of a computer that uses light to solve extremely hard problems more quickly ...

Lance Fortnow on the current status and future outlook of solving the P-NP problem.

Richard Stursberg has some ideas. In his new book, “Lament for a Literature,” the former CBC executive and long-time CanCon ...

Source: Darren Edwards What if one of the biggest unsolved problems in mathematics is not just about numbers or computers, but about observers like you and me? This isn’t a proposed solution to P vs ...

The original version of this story appeared in Quanta Magazine. Hard problems are usually not a welcome sight. But cryptographers love them. That’s because certain hard math problems underpin 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 ...

Right now, quantum computers are small and error-prone compared to where they’ll likely be in a few years. Even within those limitations, however, there have been regular claims that the hardware can ...