Posts tagged cellular-automaton
Sandbox
Implement Rule 110 [FINALIZED]
[Rule 110] is a Turing complete cellular automaton. It is defined as follows: Take as initial value a sequence of symbols that's infinite to both sides, which consists only of two different symbol...