FRACTRAN takes a list of fractions and an integer as input. You can see
more details on this wiki page: https://esolangs.org/wiki/Fractran
78r55 5r3 1r5 11r2 5r7 and 1096135733 should give:328842888196762472689573703
On Sat, Feb 12, 2022 at 6:47 AM Raul Miller <rauldmil...@gmail.com> wrote:
> On Fri, Feb 11, 2022 at 6:43 PM Jose Mario Quintana
> <jose.mario.quint...@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
> ----------------------------------------------------------------------
> For information about J forums see http://www.jsoftware.com/forums.htm
>
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
