Also, since Vyxal uses transpilation, it can get messy. I personally think Vyxal should be interpreted, but lyxal apparently used that before and found compilation easier. Porting Python stuff to JS will be hard
That yes, although I'm not sure how big the difference is given that it's transpiled back into python
So I can't imagine it's a meaningful difference. Only thing is you only have to lookup each builtin only once if you transpile, rather than every time you run into it in a loop
Also, most of the time is spent in the pure Python builtins, not in the Vyxal stuff, so it's kinda like when you call a C library using Python (except it's slower)
since it sits in between golfing languages and practical languages in terms of design philosophy and features, tokenization is not independent of context
But if you trans/compile it to Haskell, which doesn't do mutable state... or to Unary... it could be even slower than interpeting, but then again it depends what lang you're doing the interpreting in
I know one thing about the Pip interpreter: if it were a transpiler, it wouldn't hit the recursion limit so quickly. Each level of function call in Pip causes about four levels in Python.
CMC: Prove Gilbreath's conjecture. Starting with the prime numbers, repeatedly take the unsigned consecutive differences of the sequence, output the first then repeat if that is 1
Summer Klerance turned in her term assignment for this challenge. Her professor was miffed (but also amused) when he overheard a disgruntled classmate of Summer's saying she got her answers by simulation rather than by the probabilistic methods covered in the course. Summer received a note to see...
@user I like overloading too--I just wasn't expecting map to take a function with multiple arguments. Even though I used two-argument map myself (intentionally) within the past month.
@user Turns out that the characters are there, they just aren't displayed. Copy and paste into TIO and you'll see them.
That means you can do String.fromCharCode(...[65, 33])
(or String.fromCodePoint if you can spare the bytes for a better option :p)
In the case of charCode, it actually makes sense that it can take multiple arguments, since you might want to pass both UTF-16 codes corresponding to something like an emoji
@cairdcoinheringaahing Also, thanks for the tip about pointing my skis down the mountain. I've been pointing them up and I keep floating into the sky :P
@AviFS It is the bound that allows for at least two (relatively well-known graph-theoretic) algorithms with different bounds. The faster one has time complexity of O(w^1.5 h^1.5), which looks kinda weird and can be a spoiler to a specific algorithm :P
@Bubbler Ooh, neat. I think it'd be interesting if you added that, or at least clarified that the time complexity was chosen to fit the algorithms. I read it as having found algorithms that fit a predetermined complexity, rather than the other way around!
