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 ...

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 ...

Completing a game of 'Super Mario Brothers' can be hard -- very, very hard. That's the conclusion of a new paper that shows that the problem of solving a level in 'Super Mario Brothers' is as hard as ...

Completing a game of "Super Mario Brothers" can be hard -- very, very hard. That's the conclusion of a new paper from researchers at MIT, the University of Ottawa, and Bard College at Simon's Rock.