This may be the consensus nowadays but some time ago one person thought that halting (when applicable) was needed, at least to some degree, to make "Zuse's Z3 a Universal Computer"
Universal_Computer.pdf (fu-berlin.de) <http://www.inf.fu-berlin.de/inst/ag-ki/rojas_home/documents/1997/Universal_Computer.pdf> On Fri, Feb 11, 2022 at 7:02 PM Elijah Stone <elro...@elronnd.net> wrote: > > 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 ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
