>>96405545
You're right, it was a proof sketch, but the godscript can definitely solve specific undecidable problems. Take, for example, the classic "inverted halting machine" used in the usual proof of the halting problem's undecidability (pic related). The godscript can look at what the inverted halting machine is doing, lock the program in logic-error-hell like Vtorusha, give the program a soul that's capable of making decisions outside of its original programming, and tell you that the program's fate is to halt once it learns to behave. Or, alternatively, it can tell you that it won't halt, and then curse the program so every time you try to run it, a bug in the OS causes an infinite loop to coincidentally occur before the inverted halting machine finishes its instructions.

The godscript is intelligent and can cheat, is what I'm saying. Turing machines can't.