Esox. (![[info]](http://l-stat.livejournal.com/img/userinfo.gif){kind=small} ciranox) wrote in alexanderwait, |
Rule 110
Ok here's an even easier way to answer the question. You could probably push out a paper on the topic.
I hate Wolfram. He's egotistical and incapable of writing cogently.
Despite this, take Wolfram's Rule 110, which is known to be universal. Now find a way to obtain Rule 110 on a CA with a 3 dimensional graph topology. The easiest way to look at this is as follows: The 3D cellular automaton can still be displayed on your computer screen as a 2 dimensional set of notes. Except that the connections between the nodes are now nonlocal in some way. But if you see the same Rule 110 patterns emerge on this set of nodes as would occur on the locally connected planar set, then you've got it! This might be surprisingly easy, might take only a week to do.
Ok here's an even easier way to answer the question. You could probably push out a paper on the topic.
I hate Wolfram. He's egotistical and incapable of writing cogently.
Despite this, take Wolfram's Rule 110, which is known to be universal. Now find a way to obtain Rule 110 on a CA with a 3 dimensional graph topology. The easiest way to look at this is as follows: The 3D cellular automaton can still be displayed on your computer screen as a 2 dimensional set of notes. Except that the connections between the nodes are now nonlocal in some way. But if you see the same Rule 110 patterns emerge on this set of nodes as would occur on the locally connected planar set, then you've got it! This might be surprisingly easy, might take only a week to do.
