[Jprogramming] Is j turing-complete without parentheses?

[Raul Miller]

On Fri, Feb 11, 2022 at 6:43 PM Jose Mario Quintana
<jose.mario.quintana at gmail.com> wrote:
> Regarding the Turing completeness of a parentheses free J, the best I can
> do so far is to reduce it to a single pair of parentheses,
>
> Fractan=. ([ {~ 1 i.~ [ = <.)@:* ::]^:_

What might relevant arguments to this verb look like?

Thanks,

-- 
Raul