News for hackers. Stuff that matters.
Re:Surprisingly Turing-Complete by jamesmiller5 on Friday October 02, 2015 @01:58PM (#10320142)
If you didn't catch it in the article, it links to a proof of Braid the game's undecidability without use of it's time mechanics.

http://arxiv.org/abs/1412.0784

I'd guess Super Mario Maker could be similar if monsters can infinitely spawn, be destroyed and interact with one another, skimming the paper it looks like a requirement.

There are no comments on this comment yet.