Anonymous user
Rule30: Difference between revisions
Algebraic recurrence relation for rule 30,
Thundergnat (talk | contribs) m (Duplicate task) |
(Algebraic recurrence relation for rule 30,) |
||
| (One intermediate revision by one other user not shown) | |||
Line 3:
[[Category:Cellular Automata]]
This rule is of particular interest because it produces complex, seemingly random patterns from simple, well-defined rules. Because of this, Wolfram believes that Rule 30, and cellular automata in general, are the key to understanding how simple rules produce complex structures and behaviour in nature.
Line 76:
return 0;
}</lang>
=={{header|Octave}}==
<lang OCTAVE>
clear all
E=256;
idx=round(E/2);
z(1:1:E^2)=0; % init lattice
z(idx)=1; % seed apex of triangle with a single cell
A=2; % Number of bits rule30 uses 3
for n=1:1:E^2/2-E-2; % lines
theta=0; % theta
for a=0:1:A;
theta=theta+2^a*z(n+A-a);
endfor
delta=(asin(sin (pi/4*(theta-3/4))));
z(n+E+1)=round( (4*delta + pi) / (2*pi) );
endfor
imagesc(reshape(z,E,E)');
</lang>
| |||