4 ms·
This is great, but can't you only show me drawings which halt? I sit there waiting and I don't know if they'll stop...
by zeckalpha 13y ago
This is great, but can't you only show me drawings which halt? I sit there waiting and I don't know if they'll stop...
- pasquinelli 13y agothat's a hard design decision.
- zeckalpha 13y agoYeah, I'm undecided.
- polemic 13y agoI'm sure someone on rentacoder can figure it out: http://blog.willbenton.com/2008/11/rent-a-coder-hilarity/ http://blog.willbenton.com/2008/11/rent-a-coder-hilarity/
- croikle 13y agoThe world is finite, so every drawing eventually loops. However, the state space is something like k * 2^18 * n^(2^18), where k is the number of states and n the number of symbols. For the default (4, 3) this is 3.125 * 10^125080, so you could be waiting for a while :)
- yakiv 13y agoWould every drawing have to loop? Pi doesn't. I personally don't actually know if there's something about this specifically that would force every drawing to loop, though.
- lsb 13y agoIf it's a limited number of states in the automaton, and a limited amount of "tape" in the canvas, it's not a Turing machine, it's a Finite-State Automaton, which is easy to analyze for loops.
- Zoepfli 13y agoHere's one that halts very late: http://wry.me/hacking/Turing-Drawings/#3,3,1,2,0,1,1,0,0,2,3,1,1,3,2,1,3,0,2,1,1,1,1,2,2,3,0,2,0 http://wry.me/hacking/Turing-Drawings/#3,3,1,2,0,1,1,0,0,2,3... And here's an amazing one: it fills the canvas, getting slower and slower. It will probably take days to complete fill it: http://wry.me/hacking/Turing-Drawings/#10,3,9,2,1,5,2,3,8,1,2,9,1,1,4,2,1,5,1,2,9,2,2,1,1,2,6,1,0,3,1,1,7,2,0,5,1,3,4,2,1,4,2,0,8,1,1,1,2,3,0,1,1,0,1,1,9,1,3,0,1,2,0,1,1,5,2,2,5,2,0,5,2,2,7,1,0,1,1,0,9,2,1,8,2,0,6,2,0,4,2,3 http://wry.me/hacking/Turing-Drawings/#10,3,9,2,1,5,2,3,8,1,...