Maya

@Dudecoinheringaahing Retina, 11 bytes

@Dudecoinheringaahing thanks, I applied your suggestions. I think I'll be posting the challenge tomorrow morning, then: codegolf.meta.stackexchange.com/a/23793/55934

CMC: Given a positive integer, output whether or not its square and cube together use each digit exactly once.

Hmm, do there exist strings whose suffix trees with suffix links are non-planar graphs?

Achievement get: make a joke too nerdy for the nerd chatroom

@user I'm saying I don't know APL, which makes your sentence true when viewed as a material implication.

@user True. Because the antecedent is false >.<

What is a good way to learn Jelly? I've read the tutorial and am very confused. Is there maybe a list of challenges that are simple to solve in Jelly, or perhaps categorized by what features of Jelly one must know?

Did anybody here have a chance to look at codegolf.meta.stackexchange.com/a/23793/55934

68 bytes: |l:&[&str]|(0..).zip(l).find_map(|(i,s)|s.find('∪').map(|k|(i,k)))

@Adám Rust, 76 bytes: |l:&[&str]|l.iter().enumerate().find_map(|(i,s)|s.find('∪').map(|k|(i,k)))

looks like it's some long-standing issue with mono (github.com/mono/mono/issues/10374), and I have no idea how to even begin working around that

Did anybody ever figure out how to compile Esoteric IDE on linux? I'm getting a XOR data length expected error...

I think I'll go with Whitespace, BTW

@ngn I just want to ;) You're expecting a solid justification on CGCC?

@thedefault. Hmm, you're probably right. That's still a lot, though

Hmm, 05AB1E has ǝ

Befunge is actively hostile to compilation. Hexagony requires executing O(n) instructions to get to a specific place in memory.

Seriously exposes Python's eval, which is not ideal. In general, the large "standard library" is not something I'm keen on here. I couldn't find anything that would let me mutate a list.

I've considered Shakespeare Programming Language, random access requires shuffling data between stacks. Mornington Crescent is only turing complete because of bignums and string munching. Chef allows you to access elements deep into its stacks, but the ROLL requires a large memcpy, and restoring the state is also not trivial, so one would probably end up simply copying entire stacks.

I'm looking for an esoteric programming language I could write a compiler for. I'd want the language to be able to randomly access and mutate an array-like data structure in O(log n) or better, preferably without any significant trickery in the implementation. I'd guess that there are many people more knowledgeable in esoteric languages than me in here, so - any ideas on the top of your mind?

Time travel is real

although considering translations are constantly being improved...

bonus points: no network use

Can somebody take a look at my sandbox post in a free moment? codegolf.meta.stackexchange.com/a/18113/55934

D:

@Adám that screams "quine" to me

I'd write O(nm(n+m))

I thought Retina would work but you need a newline

is it really used so often to warrant assigning a single character?

wait, . is eval in K?

TIL Ruby is remarkably similar to Haskell

Z80golf (5,7) cd 03 80 ef 76 (untested)

how does (1,2) compare to (2,3)?

@Adám solution: outlaw 1-byte solutions :)

Or you could take the shuffling one and make the score be the amount of permutations that work

@Adám this one is definitely interesting, though

more as a hypothetical really

yeah, at this point I'm just trying to make the challenge work when it's clear it won't be fun

hmm, you could specify some minimum length, but... ehh

@Adám Unless you shuffle the source code lines

two-byters would be practical here

Ah, I suppose that works if you're allowed to take the arguments in a different order.

Yeah, that's how I understand it. Though, having browsed the quicks page again, I don't see what the other solution would be.

3 bytes, but I think that's not the solution you hinted at...

I feel like pairing a dyad with a monad like this should be doable with just one extra byte...

So, I'm trying to do the Nth root exercise, and I managed to do it in 4 bytes. Am I simply missing some atom, or do I need to use the chaining rules better?

@Dennis thanks

@Dennis Hi, could you update Emojicode?