Rule 110
Elementary cellular automaton
Rule 110
The Rule 110 cellular automaton (often called simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect, it is similar to Conway's Game of Life: like the Game of Life, Rule 110 with a particular repeating background pattern is known to be Turing complete. This implies that, in principle, any calculation or computer program can be simulated using this automaton.
Read on Wikipedia · Image LucasVB, CC0
Open boosters, collect cards and trade them. Free to play.
Play for free