MIT researchers proved certain Super Mario levels are mathematically "undecidable" — no algorithm can reliably determine if they're beatable. Using level gadgets that simulate theoretical computers, they placed Mario in computing's hardest complexity class, with implications for robotics and AI.

Get hand-picked daily summaries of the best, most informative programming articles from around the web.

Programming

Certain Super Mario levels are mathematically "undecidable" — no algorithm can reliably determine if they're completable. MIT researchers demonstrated this by embedding theoretical computer simulations into level design, placing Mario in computing's hardest known complexity class.

Super Mario is mathier than you think

Get the next batch of curated summaries in your inbox.