Turing Drawings • Hacker News Board

Re: Turing Drawings

#101

Post by to3m » Wed, May 15, 2013, 1:40 PM UTC

JimJames wrote: post #86

lelandbatey wrote: post #40

I 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…

I got something like the Sierpinski triangles too : http://wry.me/hacking/Turing-Drawings/#2,24,1,6,1,0,17,1,1,1... even closer : http://www.wry.me/hacking/Turing-Drawings/#2,23,1,2,2,0,19,3...

Here are some stable ones: http://wry.me/hacking/Turing-Drawings/#4,3,0,1,3,0,2,1,3,1,2...

Bonus animated brass rubbing: http://wry.me/hacking/Turing-Drawings/#4,3,1,1,2,2,1,1,3,1,0...

Re: Turing Drawings

#102

Post by taliesinb » Wed, May 15, 2013, 2:36 PM UTC

drx wrote: post #98

taliesinb wrote: post #67

Earlier quoted context omitted.

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…

> Do we run into the limits of undecidability? 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 turin…

Yes, I'm quite aware of this. Not to be rude or anything, but it is kinda obvious if you've thought at all finite computational systems.

Re: Turing Drawings

#103

Post by drx » Wed, May 15, 2013, 3:41 PM UTC

taliesinb wrote: post #102

drx wrote: post #98

Earlier quoted context omitted.

> Do we run into the limits of undecidability? 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 turin…

Yes, I'm quite aware of this. Not to be rude or anything, but it is kinda obvious if you've thought at all finite computational systems.

It is obvious, yeah. I wasn't implying you didn't know it was or anything, just explaining the first sentence to someone who might not have studied complexity theory.

Re: Turing Drawings

#104

Post by tachyonbeam » Wed, May 15, 2013, 4:12 PM UTC

robert00700 wrote: post #94

I wonder if one could construct a metric for how 'interesting' a drawing is- then throw it at a genetic algorithm? I'm guessing most likely the system is inherently unstable, so two 'interesting' parents don't necessarily create 'interesting' offspring

You don't have to use crossover, you can just make small mutations. That's much more likely to result in interesting offspring.

Re: Turing Drawings

#105

Post by BasDirks » Wed, May 15, 2013, 4:37 PM UTC

fascinating flows: http://wry.me/hacking/Turing-Drawings/#5,3,1,2,2,1,2,3,0,1,0...

Re: Turing Drawings

#106

Post by abecedarius » Wed, May 15, 2013, 4:47 PM UTC

JimJames wrote: post #86

lelandbatey wrote: post #40

I 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…

I got something like the Sierpinski triangles too : http://wry.me/hacking/Turing-Drawings/#2,24,1,6,1,0,17,1,1,1... even closer : http://www.wry.me/hacking/Turing-Drawings/#2,23,1,2,2,0,19,3...

The second one really looks like Rule 30 (which someone else linked to here).

Re: Turing Drawings

#107

Post by abecedarius » Wed, May 15, 2013, 5:01 PM UTC

makeramen wrote: post #89

this diagonal line repeats a few times and just "breaks" after a point. http://wry.me/hacking/Turing-Drawings/#4,3,3,2,2,1,1,3,0,2,2... I thought it was a bug at first, but it actually does it every time (speed up if you're impatient)

If you slow it way down after it 'freezes' you can get an idea how it's caught in a loop. (I wonder how many people have noticed you can slow it way down to see the head move.)

Re: Turing Drawings

#108

Post by BasDirks » Wed, May 15, 2013, 5:12 PM UTC

Re: Turing Drawings

#109

Post by Zoepfli » Wed, May 15, 2013, 6:11 PM UTC

zeckalpha wrote: post #2

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...

Here's one that halts very late: 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,...

Re: Turing Drawings

#110

Post by z0r » Wed, May 15, 2013, 7:00 PM UTC

nviennot wrote: post #68

This one really surprised me: http://wry.me/hacking/Turing-Drawings/#3,13,0,4,3,2,1,1,2,1,...

After revisiting the thread and viewing some of the other good finds, this is still the most astonishing one I've seen. The end state is very pretty, and the final evolution continues in what appears to be a perplexing nearly-stable chaotic pattern.