« first day (156 days earlier)      last day (1086 days later) » 

3:22 AM
@DJMcMayhem What's the reason for @ causing a syntax error here? A feature or a bug?
@DLosc Uhm... a little bit of both, haha.
So, there are these debug flags:
A: Tips for Golfing in Brain-Flak

Wheat WizardUse Debug flags You might not know it because we haven't written it anywhere but Brain-Flak has debug flags and they are really useful. They can be placed anywhere in the code and will run when the command line flag -d is present. Here is a quick rundown of the debug flags. Most flags come in...

It's trying to parse it as a debug flag but failing. It probably shouldn't be doing that
Ah, okay. Thanks!
1 hour later…
4:38 AM
@MartinEnder I don't know if you remember but a while ago you asked about proving the optimality of the squaring snippet, well 1000000000 and I have finally proven it! We are not quite ready to publish our code but I thought I would tell you we have what we believe to be a proof that no program shorter than 18 bytes can square a number, so you can rest easy. We will keep you posted as we polish up our proof any verify all of our work. (unless you are no longer interested)
3 hours later…
8:02 AM
nice work. :) let me know when you're ready to release it.
9 hours later…
5:00 PM
Is Brain-Flak Turing complete???
Yes, its main design goal was to be a stack-based Turing tarpit iirc. Why so many question marks?
5:22 PM
@MartinEnder Well, the primary design goal was that all programs are matched brackets, but TC-ness was important too
This challenge was the original inspiration for bflack:
Q: Are the brackets fully matched?

DrMcMoylexYou must write a program or function that takes a string of brackets and outputs whether or not that string is fully matched. Your program should print a truthy or falsy value, and IO can be in any reasonable format. Rules and definitions: For the purpose of this challenge, a "bracket" is any...

I think wheatwizard proved it's TC even without the second stack and the <> monad
1 hour later…
6:50 PM
Brain-Flak is Turing complete without <>, <...> or []. link to informal proof
7:06 PM
@MartinEnder Because the room was too idle, I wanted to emphasize.
I realized that this link is dead.
7:30 PM
@WheatWizard now I wanna see a primarily tester in mini-flak. :D
@DJMcMayhem Well I know what I am doing for the rest of the afternoon
If you do, you could make a fork of brain-flak and just take out those functions to call it a new language
Minsky flak?
Primality tester needz range.
@ErikGolferエリックゴルファー What do you mean
I think that, to test if a number x is prime, you test if any integer in [2..√x] divides it. If not, the number is prime. Of course, you can just use x instead of √x, because computing in Brain-Flak is prettu much another thing.
And, Brain-Flak isn't to be used in production anyways :)
7:39 PM
Yeah I am going with just x
Range is difficult in Brain-Flak too, so we should expect some delay.
@DJMcMayhem What is mini-flak? Brain-Flak without <> nilad?
@DJMcMayhem Done
@ErikGolferエリックゴルファー Not really
@ErikGolferエリックゴルファー And yeah. Just a joke term I made up on the spot
@DJMcMayhem Whoops, it seems that input 10 does [1..8], not [2..9]?
Oh yeah. Simple fix though: brain-flak.tryitonline.net/…
7:46 PM
And... maybe a {} at the end would be useful to pop the 1.
@WheatWizard Damn that was fast. How does it work?
@WheatWizard It seems that was so fast it took some time for our eyes to catch. WOW +1!!
@DJMcMayhem I wrote a pretty simple version without using <> or [] and then I substituted < for ( and > for )[{}].
The original version simple makes a stack of the remainders for n-1 through 0, removes the top two (always zero) and uses and on the stack until there is only one element
I avoids using <> by employing Riley's switch (({}({}))[({}[{}])]).
It seems your code is 214 bytes. I'll try to golf it down, but I don't understand it at all.
8:02 PM
Golfing mini-flak is going to be really hard
8:29 PM
I golfed it a bit and made a proper answer.
A: Is this number a prime?

Wheat WizardMini-Flak, 202 bytes Mini-Flak is a turing complete subset of the Brain-Flak language. (It is currently the smallest know turing complete subset of Brain-Flak) It works exactly like Brain-Flak except the <> and [] nilads and the <...> monad are forbidden. (({})){(({}[()])(((({}({}))[({}[{}])](...

2 hours later…
10:17 PM
I think we need proper english names for all of the operations. Whenever I actually need to say <> or {...} outloud I have no idea what to actually say
2 hours later…
11:50 PM
@WheatWizard The first names that come to my mind are "One", "Pop", "Height", "Switch", "Push", "Loop", "Negate", and "Zero Out". I don't really like loop and zero out though.

« first day (156 days earlier)      last day (1086 days later) »