Tag Archives: NPHard

Physics Is (NP-)Hard



An anonymous reader writes “New research at the boundary of physics and computer science shows that determining the dynamical equations of a system from observations of its behavior is NP-hard. From the abstract: ‘The behavior of any physical system is governed by its underlying dynamical equations. Much of physics is concerned with discovering these dynamical equations and understanding their consequences. In this work, we show that, remarkably, identifying the underlying dynamical equation from any amount of experimental data, however precise, is a provably computationally hard problem (it is NP-hard), both for classical and quantum mechanical systems.’”

Read more of this story at Slashdot.


Slashdot

Pac-Man Is NP-Hard



MrSeb writes “An Italian researcher with a penchant for retro games — or perhaps just looking for an excuse to play games in the name of science! — has used computational complexity theory to decide, once and for all, just how hard video games are. In a truly epic undertaking, Giovanni Viglietta of the University of Pisa has worked out the theoretical difficulty of 13 old games, including Pac-Man, Doom, Lemmings, Prince of Persia, and Boulder Dash. Pac-Man, with its traversal of space, is NP-hard. Doom, on the other hand, is PSPACE-hard.”

Read more of this story at Slashdot.


Slashdot

Blog – Pac-Man Proved NP-Hard By Computational Complexity Theory

The classic ’80s arcade game turns out to be equivalent to the travelling salesman problem, according a new analysis of the computational complexity of video games







Technology Review RSS Feeds