On Fri, 11 Feb 2022, Jose Mario Quintana wrote:
CA does not halt, unlike classic Turing machines which might halt.
I don't think that's an issue. Turing-complete languages are not required to themselves have the features of a turing machine; only to be able to simulate them. And (some) cellular automata can simulate turing machines, hence they are turing complete.
-E ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
