Turing Drawings
91–100 of 123 posts
Re: Turing Drawings
#92Warpspeed http://wry.me/hacking/Turing-Drawings/#2,11,1,5,1,0,1,1,1,5,...
City Corner http://wry.me/hacking/Turing-Drawings/#2,11,1,10,0,1,5,2,0,8...
Coloring Inside the Lines http://wry.me/hacking/Turing-Drawings/#2,11,0,10,2,0,4,3,0,2...
Sewing Machine http://wry.me/hacking/Turing-Drawings/#2,11,1,7,3,0,2,0,0,3,... Seems semi-stable?
Folding Paper Trick http://wry.me/hacking/Turing-Drawings/#2,11,1,4,1,0,5,3,0,10...
Stable http://wry.me/hacking/Turing-Drawings/#5,3,3,1,0,3,1,0,3,1,0...
Counter: http://wry.me/hacking/Turing-Drawings/#5,3,1,1,0,3,1,3,2,1,2... This one seems to behave like some kind of adder. Even at the highest speed setting it takes a long time to see much change, but the black lines seem to grow and move similar to how a binary adder operates.
Spilled Drink http://wry.me/hacking/Turing-Drawings/#13,21,10,11,1,0,7,0,4...
Donkey Kong http://wry.me/hacking/Turing-Drawings/#13,21,0,17,3,11,4,0,0...
Re: Turing Drawings
#93Re: Turing Drawings
#94Re: Turing Drawings
#95Re: Turing Drawings
#96Re: Turing Drawings
#97Re: Turing Drawings
#98I quite like this one, it's as though the environment deteriorates. Don't watch it to fast: http://wry.me/hacking/Turing-Drawings/#4,3,0,1,1,0,2,1,0,2,1... At one point, right before it goes over the "entropy cliff" it creates what looks like a lot of Sierpinski triangles: http://wry.me/hacking/Turing-Drawings/#4,3,2,1,0,1,2,3,2,2,2... I found it quite interesting that one as complex as this could stabilize: http://w…
Many of these are quite beautiful. The NKS-style question to ask here is: what computations are these doing? Totally unique-unto-themselves computations? Potentially useful computations? Computations analogous to familiar human ones? How would we know? Can we know? Do we run into the limits of undecidability? The cyclic boundary conditions somewhat 'spoil' things, though. Maybe a particular rule was "destined to mult…
For this particular canvas, no, as the canvas is finite.
Given enough time or space we can exhaust all states of the canvas and catch cycles. This applies to any finite canvas.
I would guess these are equivalent to regular languages because of the finite state. You can treat the different canvas states as states of a finite automaton. A finite automaton is a canvas turing machine by ignoring the canvas.
Re: Turing Drawings
#99This is amazing. My favourites seem to always have only 2 states. "sunset and nightfall": http://wry.me/hacking/Turing-Drawings/#2,15,0,3,1,1,1,3,1,10... "shoreline EQ" http://wry.me/hacking/Turing-Drawings/#2,22,1,6,2,0,6,0,0,21...
http://wry.me/hacking/Turing-Drawings/#4,3,2,2,3,0,1,1,2,1,0...
Re: Turing Drawings
#100I found a glider! http://www.wry.me/hacking/Turing-Drawings/#4,3,2,2,1,3,2,2,3... The glider appears after a few seconds of high speed. Very nice implementation!
Not exactly a glider, but it looks like this does at the start, but reversed...sort of... (maybe)