• dejected_warp_core@lemmy.world
      1·
      2 years ago

      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
        1·
        2 years ago

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