You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !programmerhumor@lemmy.ml
Post funny things about programming here! (Or just rant about your favourite programming language.)
Rules:
Posts must be relevant to programming, programmers, or computer science.
No NSFW content.
Jokes must be in good taste. No hate speech, bigotry, etc.
Just use brainfuck for everything. The entry barrier for the programming industry needs to be higher anyway.
Is brainfuck efficient ?
Can be compressed very efficiently. I do dread the thought of writing a driver in brainfuck.
decided to check : mandelbrot can be compressed by 87.5% by gzip on maximum compression strength
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.
Which basically means: “You have to write more code than actually needed”. It’s more a con than a pro in my eyes.
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.
its efficient in terms of compiler size ! nya
For demonstrating to CS freshmen that Turing Completeness isn’t that remarkable of a language feature: very highly efficient.