last day (95 days later) » 

Bubbler
Bubbler
23:42
room topic changed to Flurry: Discussion about golfing in Flurry github.com/Reconcyl/flurry, a functional language with Brain-Flak-like syntax (no tags)
Esolanging Fruit
Esolanging Fruit
I wrote a factorial program: {}{<{}(<><<>()>{})>}[(<>())()]
unfortunately, I can't submit it to the factorial challenge because it's really slow for inputs >9
Actually, come to think of it, that would be a valid submission if it were made into a function
Bubbler
Bubbler
> Completes in under a minute for numbers up to 125
wtf...
Esolanging Fruit
Esolanging Fruit
since it technically "calculates" the Church numeral near-instantly depending on how you interpret the rules
it's just that the resulting numeral could never be used practically
Bubbler
Bubbler
Yeah, kind of.
I think the function version would be just that, wrapped in {...}?
Esolanging Fruit
Esolanging Fruit
Yeah
a pretty big fraction of the answers on that challenge don't even meet that requirement
user image
i can't read assembly, but i'm pretty sure that's not a bignum implementation
Bubbler
Bubbler
23:58
Agreed, especially given that there's only one loop
As it is one of the canonical challenges, it would be actually good to remove those restrictions of the old days.

  last day (95 days later) »