The Mystery of the Simplest Universal Cellular Automaton
Do somebody know something about the “simplest universal cellular automaton” at 4′ 25″??
Is the illustration of the ‘simplest universal cellular automaton’ at 4′ 25″ proved to be universal & uniquely the simplest?? We know that the simplest universal Turing machine is proven (2007), cf. http://blog.wolfram.com/?year=2007&monthnum=10&name=the-prize-is-won-the-simplest-universal-turing-machine-is-proved
But I never heard about the simplest universal CA.
What is more surprising, Google is at a loss as well (2010.04.27 10PM GMT):
If you find this exceptionally:) simple universal cellular automaton I’ll owe you a beer.
mazsa is discussing. 
mazsa 23:16 on April 27, 2010 Permalink |
Cf. “[...] even one-dimensional cellular automata can be universal. Wolfram (2002, pp. 644-656) gave an example of a 19-color universal one-dimensional next-nearest neighbor cellular automaton in which a block of 20 cells is used to represent each single cell in the cellular automaton being emulated. The examples above show the first few steps of the 19-color universal automaton emulating rule 90 and rule 30, respectively (Wolfram 2002, pp. 646-647).” http://mathworld.wolfram.com/UniversalCellularAutomaton.html and http://www.wolframscience.com/nksonline/page-645