Cellular automata
From GenerativeArt
(Difference between revisions)
(→Example of a Basic Cellular Automaton Rule and Rule Number: improve explanation) |
Current revision (22:14, 18 September 2013) (view source) (→Christopher Langton's Lambda) |
||
(Define) and count the number that will yield a "Quiescent" result.<br /> | (Define) and count the number that will yield a "Quiescent" result.<br /> | ||
| - | λ = fraction of states that are quiescent<br /> | + | λ = fraction of states that are not quiescent, i.e. the fraction of states that "result in life"<br /> |
| - | λ = N - Nq/N<br /> | + | N = K<sup>(2R+1)</sup> <br /> |
| + | Nq = count the number of rules resulting in quiescence<br /> | ||
| + | λ = (N - Nq/N<br /> | ||
e.g. for rule number 124<br /> | e.g. for rule number 124<br /> | ||
{{SingleImage|imageWidthPlusTen=510|imageURL=http://www.viz.tamu.edu/courses/viza626/10Fall/cellAut2.gif|caption=}}<br /> | {{SingleImage|imageWidthPlusTen=510|imageURL=http://www.viz.tamu.edu/courses/viza626/10Fall/cellAut2.gif|caption=}}<br /> | ||
| - | + | N = K<sup>(2R+1)</sup> = 2<sup>((2*1)+1)</sup> = 8<br /> | |
| - | + | Nq = 2<br /> | |
| - | + | λ = ( 8-2 )/8 = .75<br /><br /> | |
| + | {{SingleImage|imageWidthPlusTen=750|imageURL=http://www.viz.tamu.edu/courses/viza626/10Fall/cellAut3.gif|caption=}}<br /> | ||
==Two Dimensional Cellular Automaton== | ==Two Dimensional Cellular Automaton== | ||
