Incidentally, I suspect that most of the so-called “chaotic” cellular automata are Turing complete but simply feindishly difficult to establish as such.
Maybe. It is a fun speculation—but I don’t think anyone really knows. Rule 30 is an obvious test case. If that ever gets proved to be universal, the conjecture would become quite a bit more plausible.
If so, more automata would be lively. My speculation is partly based on “most” automata exhibiting chaotic dynamics, which don’t obviously support life or universal computation—because everything explodes.
Maybe. It is a fun speculation—but I don’t think anyone really knows. Rule 30 is an obvious test case. If that ever gets proved to be universal, the conjecture would become quite a bit more plausible.
If so, more automata would be lively. My speculation is partly based on “most” automata exhibiting chaotic dynamics, which don’t obviously support life or universal computation—because everything explodes.