Simplest Turing Machine
One of the cellular automata that were made famous by Stephen Wolfram in his fascinating book “A New Kind of Science” (or NKS for its worshipers) has proven to be a universal Turing machine. It’s the 2,3 machine (named 2,3 because it has 2 states and 3 colors for each state.)
Apparently, it had been proven [...]