@Mr.Xcoder I don't know them, but my name was inspired by theirs. Is that a problem? EDIT: Never mind, might as well change my name. — VoteToReopenyesterday
ಠ_ಠ I just saw this challenge, and got annoyed because its basically the first challenge I posted in the Sandbox, before abandoning it because it was poorly made.
CMC: Random int in range [1,∞). You may chose distribution, but all values should be possible (at least in principle; only limited by implementation and/or hardware).
Square-free Rock-Paper-Scissors tournament
On the day of the Codegolf Rock-Paper-Scissors tournament you hear through the grapevine that everybody else is going to play a fix square-free sequence (a sequence made of the letters R, P, S is square-free if it does not contain a subsequence that rep...
Basically, the cops have to modify their language to make addition non-commutative, but their program has to be able to be changed so that multiplication is non-commutative instead. The multiplication program has to be a levenstein distance of to be decided from the addition program, and is trying to be found by the robbers.
@dzaima Yeah. It is being worked on. Meanwhile, using an incognito tab should fix it until the server resets your session.
@dzaima I just fixed another bug last week which cause the server to hang with certain input…
Luckily it is running in Docker and is being polled for availability, so Docker will kill it and restart it whenever that happens. Anyway, I've fixed that bug – just need to commit.
Self-compiler/interpreter
code-golf quine string classification
Create a language validator, which takes a string/file that might or might not be syntactically in the language of your choice, and returns a value corresponding to whether or not it is a valid program in the implementing language....
@ATaco The problem with TREE(3) is that I've never seen any lower bound for it or estimate of how big it is. At least with Graham's number, I understand the steps to get to it, even though it's still too big to comprehend
Actually now that I think about it, I know the size it Graham's number, but not what it answers. And I know what TREE(3) answers but I don't know how big it is lol
I worked on the lower bound for the problem related to Graham's number while I was grad school, but this paper (arxiv.org/abs/0811.1055) came out while I was working on it
3
For showing lower bounds to those things, a lot of times you just need to write a better program to find an example. And every 5-10 years, thanks to computing power going up, that can sometimes be easy.
See List of things named after Gottfried Leibniz for other formulas known under the same name.
In mathematics, the Leibniz formula for π, named after Gottfried Leibniz , states that
1
−
1
3
+
1
5
−
1
7
+
1
9
...