> parenthesis-free implementation of rule 30. One caveat: it only works
> given an infinite input.
Another one is that a CA does not halt, unlike classic Turing machines which
might halt.
On Tue, Feb 8, 2022 at 4:30 AM Elijah Stone <elro...@elronnd.net> wrote:
>
> A little game I thought of: imagine a version of j with no parentheses
> (nor intermediate definitions); is it still turing-complete?
>
> Turns out the answer is yes, sort of: {&0 1 1 1 1 0 0 0@#.\~&3^:_ is a
> parenthesis-free implementation of rule 30. One caveat: it only works
> given an infinite input.
>
> Can anyone come up with something which does not require infinite arrays?
>
> Further stipulations: no control structures; no ".; ^:_ and $:@.v are both
> ok; direct definition is ok, and may even be named, but it has to be
> completely self-contained.
>
> -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
