|
![](/i/fill.gif) |
Invisible wrote:
> In other words, I suspect that rule 110 *is* Turing complete, it's just
> that the proof provided is a bit weak.
I suspect you can build a linear CA that's turing complete. I'm not
convinced that 110 without the infinite initialization can do that.
--
Darren New, San Diego CA, USA (PST)
Serving Suggestion:
"Don't serve this any more. It's awful."
Post a reply to this message
|
![](/i/fill.gif) |