6 ms·
I love the whimsy of this. I'm not familiar with Magic, but now I wonder - is Magic Turing complete? And of course the answer appears to be yes! [0] [0] https:
by anitil 2y ago
I love the whimsy of this. I'm not familiar with Magic, but now I wonder - is Magic Turing complete? And of course the answer appears to be yes! [0]
[0] https://arxiv.org/abs/1904.09828 https://arxiv.org/abs/1904.09828
- flobosg 2y agoHere’s a live demo: https://youtu.be/pdmODVYPDLA https://youtu.be/pdmODVYPDLA
- ThePowerOfFuet 2y agoHere's your link without the creepy Google tracking: https://youtu.be/pdmODVYPDLA https://youtu.be/pdmODVYPDLA
- threePointFive 2y agoI might be misunderstanding the ruling, but I believe if your play involves an infinite loop that cannot resolve, you tie the game. Combine that with the fact the game is Turing complete, and this makes it such that you could force a game state where you must solve the halting problem in order to determine if you draw or not.
- c22 2y agoIf the game state is "meaningfully changed" each iteration then it is considered a non-deterministic loop and it cannot be shortcut.