CMC: no-computers What is the longest word you can come up with that alternates between vowels and consonants? The longest I've found it [[[Topological]]] at 11.
@PostLeftGarfHunter Same, but the unfortunate thing is that we could work on that for hours and hours and build up a massive framework to make it slightly easier, add one thing and then all the sudden the entire thing is completely broken
Cause that's how brain-flak always is, it's just you notice it less with small-ish tasks. With a large task, you accidentally zero something? Leave an extra 1 somewhere? it all blows up
128,673,515 cycles
Try it online
Explanation
The reason that Miniflak quines are destined to be slow is Miniflak's lack of random access. To get around this I create a block of code that takes in a number and returns a datum. Each datum represents a single character like before and the main ...
Mini-Flak, 6900 bytes
Mini-flak is a Turing complete subset of Brain-Flak. It works exactly like Brain-Flak except the [], <> and <...> operations are banned from use. Programming in Min-Flak is thus much more difficult than traditional Brain-Flak.
The main difficulty with Mini-Flak is the la...
In @Adám's Dyalog APL Extended, the ⍢ (under) operator means conjugation: apply one function, then a second function, then the inverse of the first. It's fun to think of real-life actions in terms of conjugation:
A problem is transformed by g into another domain where it more
readily solve...
Number of Unit Squares Intersecting a Circle [WIP]
This is https://oeis.org/A234300.
Input
A positive integer n (or nonnegative for zero-indexed).
Output
Either the \$n\$th term of the sequence, or the first \$n\$ terms. You may index from \$n=0\$ or \$n=1\$.
Need: drawings of example circl...
@EriktheOutgolfer @Arnauld I had originally intended for there to only be one inverse in the input, but your comment made me doubt the challenge as it was
Sums of Bessel Polynomial Coefficients [WIP]
This is https://oeis.org/A001515.
Interesting alternate characterizations include:
Equivalently, number of sequences of n unlabeled items such that each item occurs just once or twice (cf. A105749). - David Applegate, Dec 08 2008
Numerator o...
128,673,515 cycles
Try it online
Explanation
The reason that Miniflak quines are destined to be slow is Miniflak's lack of random access. To get around this I create a block of code that takes in a number and returns a datum. Each datum represents a single character like before and the main ...
