Maven (famous) to Programmer Humor@lemmy.ml • 10 months agoSTOP WRITING Clemmy.worldimagemessage-square158fedilinkarrow-up1846arrow-down160
arrow-up1786arrow-down1imageSTOP WRITING Clemmy.worldMaven (famous) to Programmer Humor@lemmy.ml • 10 months agomessage-square158fedilink
minus-square@dejected_warp_core@lemmy.worldlinkfedilink12•edit-210 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@frezik@midwest.sociallinkfedilink5•10 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•10 months agoits efficient in terms of compiler size ! nya
minus-square@MeanEYE@lemmy.worldlinkfedilink6•10 months agoCan be compressed very efficiently. I do dread the thought of writing a driver in brainfuck.
minus-square@MatFi@lemmy.thias.xyzlinkfedilink5•edit-210 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@dejected_warp_core@lemmy.worldlinkfedilink2•10 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-square@MeanEYE@lemmy.worldlinkfedilink5•10 months agoHardware is complex and mysterious enough without added complexity of an esoteric language.
minus-squareMinekPo1 [She/Her]linkfedilink1•10 months agodecided to check : mandelbrot can be compressed by 87.5% by gzip on maximum compression strength
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?
Why specifically a driver ?
Hardware is complex and mysterious enough without added complexity of an esoteric language.
decided to check : mandelbrot can be compressed by 87.5% by gzip on maximum compression strength