« first day (132 days earlier)      last day (1110 days later) » 

ASCII-only
ASCII-only
00:24
@DrMcMoylex You can run it youself and access at localhost:8000
 
1 hour later…
ASCII-only
ASCII-only
01:30
Can anyone give me an upper bound of length for an integer of length n?
e.g. assume te only operations used are divide by 2, divide by 3 and subtract one, and assume this is done greedily
Wheat Wizard
Wheat Wizard
@ASCII-only As n-> infinity this will be constrained by to 4*log_2(x)
for any arbitrary value of n we can only constrain it by 2*n
e.g. 4 is 8 long
ASCII-only
ASCII-only
:(
Also :D JS metagolfer is done
I'll push it to gh pages when I get back home
It's fast enough to have realtime metagolfing as well :D
 
5 hours later…
ASCII-only
ASCII-only
06:17
somebody1234.github.io/bfi
Pls test and tell me if there are any bugs
@WheatWizard Are you sure that is the best upper bound
From what I've seen it should be way lower, looks like using that as estimate beans upper bound is 10x more than actual on average
Also pls someone suggest description and PR with actual README if possible
ASCII-only
ASCII-only
06:47
@DrMcMoylex Done
Surprisingly it's less RAM-hungry than Python even though JS has no big integer datatype
 
1 hour later…
ASCII-only
ASCII-only
07:57
Also @DrMcMoylex @WheatWizard Do either of you know of any other optimizations I can add? e.g. Negatives aren't the most optimal for small numbers right now since I just append ([{}])
 
3 hours later…
ASCII-only
ASCII-only
11:15
Will add factorial support later, if anyone really wants it now you can send a PR - I'll be busy for like two days
@ASCII-only *means not beans
 
4 hours later…
Wheat Wizard
Wheat Wizard
15:36
@ASCII-only if you input n you can always get n with "()"*n which makes a strong upper bound of 2n
Wheat Wizard
Wheat Wizard
16:31
I am working on a better upper bound riht now
DrMcMoylex
DrMcMoylex
@ASCII-only Looks awesome! I'm a little bummed that you beat me to implementing it, but that's what I get for being lazy, haha
There's some stuff I'd like to change, but I'll do that over some PR's
I Have the url brain-flak.github.io. Would you mind if we hosted it there? (Since the url is easier to remember)
Wheat Wizard
Wheat Wizard
17:17
@ASCII-only New upper bound: -6+2sqrt{3}sqrt{4n+3}
Add 2 to that if you are pushing the numbers
 
2 hours later…
Wheat Wizard
Wheat Wizard
18:56
An even strong upper bound is the inverse of this function: f(x)=3(x^2+x)(x^2+x+2)/4
(Again add 2 if you are pushing)
 
5 hours later…
ASCII-only
ASCII-only
23:55
@DrMcMoylex Okay
@DrMcMoylex Can you pls give me admin access to brain-flak organization so i can transfer? tyvm

« first day (132 days earlier)      last day (1110 days later) »