Rule 110 - Wikipedia, the free encyclopedia

Rule 110 - Wikipedia, the free encyclopedia: "Around 2000, Matthew Cook verified a 1985 conjecture by Stephen Wolfram by proving that Rule 110 is Turing complete, i.e., capable of universal computation. Among the 256 possible elementary cellular automata, Rule 110 is the only one for which this has been proved, although others are suspected of having this property."