Show Rules for Computational Systems
Plot the rules for elementary cellular automaton rule 30.
In[1]:=
![Click for copyable input](assets.en/show-rules-for-computational-systems/In_49.png)
RulePlot[CellularAutomaton[30]]
Out[1]=
![](assets.en/show-rules-for-computational-systems/O_38.png)
Show the rules for the 3-color totalistic rule with code 867.
In[2]:=
![Click for copyable input](assets.en/show-rules-for-computational-systems/In_50.png)
RulePlot[CellularAutomaton[{867, {3, 1}}]]
Out[2]=
![](assets.en/show-rules-for-computational-systems/O_39.png)
Show the rules for a cellular automaton with a fractional radius, using hexagons.
In[3]:=
![Click for copyable input](assets.en/show-rules-for-computational-systems/In_51.png)
RulePlot[CellularAutomaton[{9, 2, 1/2}], Appearance -> "Hexagons"]
Out[3]=
![](assets.en/show-rules-for-computational-systems/O_40.png)
Show the rules for the 2-state, 2-color Turing machine 2506.
In[4]:=
![Click for copyable input](assets.en/show-rules-for-computational-systems/In_52.png)
RulePlot[TuringMachine[2506]]
Out[4]=
![](assets.en/show-rules-for-computational-systems/O_41.png)
Plot the rules for a substitution system on three letters.
In[5]:=
![Click for copyable input](assets.en/show-rules-for-computational-systems/In_53.png)
RulePlot[SubstitutionSystem[{"A" -> "ABC", "BC" -> "A",
"C" -> "CAB"}]]
Out[5]=
![](assets.en/show-rules-for-computational-systems/O_42.png)
Show the rules for the 30 Boolean function of five variables, with black representing true and white representing false.
In[6]:=
![Click for copyable input](assets.en/show-rules-for-computational-systems/In_54.png)
RulePlot[BooleanFunction[30, 5]]
Out[6]=
![](assets.en/show-rules-for-computational-systems/O_43.png)