Cellular Automata

Rule 110

A one-dimensional cellular automaton rule proven to be Turing-complete, therefore capable of executing any algorithmic computation, establishing a fundamental link between cellular automata and computability theory.

← Indietro