Proper noun
Rule 110
(cellular automata) A simple cellular automaton, unusual in being Turing-complete, where each cell's value changes depending on its current value and those of two neighbouring cells.
This has been proven for Rule 110 and Conway's game of Life. Source: Internet
Rule 110 Rule 110 cellular automaton Rule 110, like the Game of Life, exhibits what Wolfram calls class 4 behavior, which is neither completely random nor completely repetitive. Source: Internet