Maven (famous) to Programmer [email protected] • 8 months agoSTOP WRITING Clemmy.worldimagemessage-square156fedilinkarrow-up1845arrow-down160
arrow-up1785arrow-down1imageSTOP WRITING Clemmy.worldMaven (famous) to Programmer [email protected] • 8 months agomessage-square156fedilink
minus-square@[email protected]linkfedilink13•edit-28 months agoFor the programmer? Very no. For saving space if run via interperter? No. For running compiled for conventional CPUs? No. Compared to CISC instruction sets? Absolutely no. BF might be highly efficient if crunched down to a bit-packed representation (3 bits per instruction) and run on an FPGA that understands it.
minus-square@[email protected]linkfedilink6•8 months agoFor demonstrating to CS freshmen that Turing Completeness isn’t that remarkable of a language feature: very highly efficient.
minus-squareMinekPo1 [She/Her]linkfedilink1•8 months agoits efficient in terms of compiler size ! nya
minus-square@[email protected]linkfedilink6•8 months agoCan be compressed very efficiently. I do dread the thought of writing a driver in brainfuck.
minus-square@[email protected]linkfedilink5•edit-28 months ago Can be compressed very efficiently. Which basically means: “You have to write more code than actually needed”. It’s more a con than a pro in my eyes.
minus-square@[email protected]linkfedilink2•8 months agoHot take: As a VM with only eight instructions, it’s very easy to code and securely sandbox. Maybe BF has utility as a compilation target?
minus-squareMinekPo1 [She/Her]linkfedilink1•8 months agodecided to check : mandelbrot can be compressed by 87.5% by gzip on maximum compression strength
minus-square@[email protected]linkfedilink5•8 months agoHardware is complex and mysterious enough without added complexity of an esoteric language.
Is brainfuck efficient ?
For the programmer? Very no.
For saving space if run via interperter? No.
For running compiled for conventional CPUs? No.
Compared to CISC instruction sets? Absolutely no.
BF might be highly efficient if crunched down to a bit-packed representation (3 bits per instruction) and run on an FPGA that understands it.
For demonstrating to CS freshmen that Turing Completeness isn’t that remarkable of a language feature: very highly efficient.
its efficient in terms of compiler size ! nya
Can be compressed very efficiently. I do dread the thought of writing a driver in brainfuck.
Which basically means: “You have to write more code than actually needed”. It’s more a con than a pro in my eyes.
Hot take: As a VM with only eight instructions, it’s very easy to code and securely sandbox. Maybe BF has utility as a compilation target?
decided to check : mandelbrot can be compressed by 87.5% by gzip on maximum compression strength
Why specifically a driver ?
Hardware is complex and mysterious enough without added complexity of an esoteric language.