@Dennis Off-topic for this room, but what did you mean by this comment?

(I'm pretty sure it's \x18...)

@Dennis Thanks, updated

@Lynn I agree there - the number of times I've done a full CJam golf purely on my phone can't be counted on one hand

:P

@Sp3000 It sounds like Dennis is suspecting that, since the output is 18 (not 0x18) characters long, ...

...

Hex, riiight.

@Dennis Fixed

That was silly of me :P

Ah-hah! I knew sleeping would help me figure it out: jelly.tryitonline.net/…

@Dennis You might want to do what Pyth did a while ago and increase the default recursion depth, the code I linked above dies for 3,3 due to recursion depth.

Yeah, that wouldn't hurt.

Hmm, after golfing a bit I got this. I then tried to golf ṛ¬¥ to be a or x but it seems to change how it gets parsed. I'm not sure why, is it getting confused about if it should by a dyadic link?

Oh uh, s/link/chain :P

@FryAmTheEggman ṛ<monad>¥ can be shortened to <monad>}.

Ah, thanks :)

Guess a hypers page would be good too :P

Hypers are quicks that haven't been reimplemented yet. :P

Oh, well maybe not then :P

I was also pretty lost on trying to get a 1 as one of the options to a dyadic ?. I thought it might be a similar problem, but I'm not as sure now.

Currently trying to figure out what your code does. :P

Oh, it's the ackermann function :P

basically: A(m,n) = {n+1 if m==0, A(m-1, 1) if n==0, A(m-1, A(m, n-1) otherwise }

And I want to combine the last two cases so I don't do m-1 twice by doing: A(m-1, 1 if n==0 else n-1)

Yeah, I know. Jelly written by someone else isn't precisely readable though. :P

Ah, makes sense XD

I tried :d

Multiline messages don't mark down.

Yeah... darn

Is the main link supposed to test m for something? Because I think is evaluates to return -1 if n == -1 else ....

No, that can't be true.

If m is 0 it should be picking n+1 otherwise the other ternary.

But ¬ applies to the previous return value, which is n + 1.

OK, I clearly don't get how dyadic conditionals are parsed...

Oh, I thought each one was parsed as a separate dyadic chain? So each starts with m and n fresh?

Ah, I think I get it now. ¥ binds three links to its left, which is hella confusing since ß isn't a constant (but treated as one, since its arity is unknown to the parser).

Oh, yeah I guess I just assumed the 1 was the thing not being counted? That's probably more confusing if you actually understand how the parser works lol.

How how it's supposed to. Arities that are unknown at parse time are a bit of a problem.

@Dennis Funny story, I actually got confused between tabs, and thought I hadn't posted that on the J answer.

I later realised that I was wrong on that one for a different reason :P

SE is hard, man.

hahaha

Just gonna throw this TIO link here so I don't forget about it: jelly.tryitonline.net/…

Aha, actually I got the constant to work, not so bad jelly.tryitonline.net/…

Only 1 longer than modern Pyth now I think.

> only

Well compared to like the 6 from my initial version :P

@Dennis this is pretty Jelly-like :P