this post was submitted on 21 Jan 2024
783 points (93.4% liked)

Programmer Humor

32591 readers
947 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

founded 5 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] dejected_warp_core@lemmy.world 13 points 10 months ago* (last edited 10 months ago) (2 children)

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.

[–] frezik@midwest.social 6 points 10 months ago

For demonstrating to CS freshmen that Turing Completeness isn't that remarkable of a language feature: very highly efficient.

[–] MinekPo1@lemmygrad.ml 1 points 10 months ago

its efficient in terms of compiler size ! nya