Show Rules for Computational Systems

Plot the rules for elementary cellular automaton rule 30.

In[1]:=

RulePlot[CellularAutomaton[30]]

Out[1]=

Show the rules for the 3-color totalistic rule with code 867.

In[2]:=

RulePlot[CellularAutomaton[{867, {3, 1}}]]

Out[2]=

Show the rules for a cellular automaton with a fractional radius, using hexagons.

In[3]:=

RulePlot[CellularAutomaton[{9, 2, 1/2}], Appearance -> "Hexagons"]

Out[3]=

Show the rules for the 2-state, 2-color Turing machine 2506.

In[4]:=

RulePlot[TuringMachine[2506]]

Out[4]=

Plot the rules for a substitution system on three letters.

In[5]:=

RulePlot[SubstitutionSystem[{"A" -> "ABC", "BC" -> "A", "C" -> "CAB"}]]

Out[5]=

Show the rules for the 30 Boolean function of five variables, with black representing true and white representing false.

In[6]:=

RulePlot[BooleanFunction[30, 5]]

Out[6]=