analysis shows super mario brothers is harder than np hard /

Published at 2016-05-31 21:03:33

Home / Categories / Computer sciences / analysis shows super mario brothers is harder than np hard
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. They indicate that the problem of solving a level in "Super Mario Brothers" is as hard as the hardest problems in the "complexity lesson" PSPACE,meaning that it's even more complex than the traveling-salesman problem, or the problem of factoring large numbers, or any of the other hard problems belonging to the better-known complexity lesson NP.

Source: phys.org

Warning: Unknown: write failed: No space left on device (28) in Unknown on line 0 Warning: Unknown: Failed to write session data (files). Please verify that the current setting of session.save_path is correct (/tmp) in Unknown on line 0