If you want to filter the infinite list of positive integers (which is known-infinite) for primes, then the language has to prove whether or not there are infinitely many primes
and proving arbitrary properties like that is undecideable
The main use case for infinite lists in golfing languages, as far as I can tell, is mostly just as a shorthand for "iterate over the positive integers/primes/... until you find something matching this condition"
@thejonymyster idk, just couldn't think of anything lol
@PyGamer0 I would make binomial c, but that's a digraph char. I don't think concat should be ,, I'll probably use that for either print or something else
I might change pair to be , instead of ; and concat be ;, though.
In this challenge, you play chess without seeing any of your opponent's pieces or moves. Or your own pieces. Or whether your own moves succeeded. You send only a stream of moves, with no feedback. If your move is legal (when it is your turn) it will be played, otherwise it is silently discarded.
...
also what do yall think of what i call composite types: types that are fundamentally a mix of the lang types but have operations on them. e.x. a vector being a list of 2 nums, but having vector operations in the lang
one thing about some of mathematica's string operations that annoys me is that they treat length 1 strings differently, since they're used to represent characters
@emanresuA The only time where not grouping it could be a downside is if you have "quicks" that have different behaviour for dyads vs monads. E.g. in Jelly, +4$¡ is different to +¡4
Jelly just got a new type of modifier: the quick. Quicks are different from all previous types, since they can combine a variable number of links into a single link. I will gradually replace all other modifiers with quicks.
First time Dennis uses the word "quick", and doesn't give any reason behind the word :P
Contributions to OEIS
Please edit all OEIS-only contributions into this post, instead of posting a separate answer for each. If there's a larger result that also led to an OEIS contribution (like a novel algorithm that allowed computation of more terms), feel free to post it separately, though.
...
Are there any dates dd/mm such that dd, mm, ddmm and mmdd are all prime? Optionally, no leading zero for m?
Potential feature #2: multiple "stages," such that at the end of a stage, the match is reset to empty and the capture groups' contents ($1, $2 and so forth) become the new stage's inputs ($~1, $~2 and so forth).
Combining both of those features would allow solving some problems that are currently unsolvable in Regenerate; for example, it's currently not possible to match a substring of an input.
@emanresuA True, some stuff like \d would be easy to add.
One of my big problems when golfing is that I get too stuck on implementing the challenge as described, rather than looking for other approaches that can give the same output.
@thejonymyster If you don't mind flags, I suspect the -l flag might help
@thejonymyster I guess there's not any documentation specifically focused around iterables per se. It's really just an umbrella term that covers Scalars, Lists, and Ranges.
mathematica, 32: [`Print@@Mod[r#,10]&/@(r=Range@10)`](https://tio.run/##y00syUjNTSzJTE78/z@gKDOvxMHBNz8lukhZx9AgVk3fQaPINigxLz3VwdBA8/9/AA) boring but i don't think it gets any better
(There's probably a way to combine the two loops into one and save bytes, but I'm too lazy and I need to head home now anyway)
@emanresuA Less buggy than ATO at the moment. ;P Also, @thejonymyster, the big advantage of DSO (or ATO once it gets fixed) is that it's got an up-to-date version of Pip. TIO's version is 4 years old.
@lyxal I didn't want to announce this, but I might as well: my name is Bill Gates, and I'm the founder of Microsoft. I know, big surprise, but it's true
Now, if you could all send me $500, MS is struggling rn, I'd be super happy to give you all free laptops :P
