Brainfuck
An extremely minimal, esoteric programming language with eight instructions operating on a tape of bytes; Turing complete but very hard to read or write.
As defined in 286 | Blaise Agüera y Arcas on the Emergence of Replication and Computation
Where it comes up · 1
Most important claims · 4 of 4Search all claims for “Brainfuck” →
- Brainfuck was chosen because it is extremely minimal and very close to a Turing machine — with eight instructions (only seven used) operating on a tape like a Turing tape — making it among the smallest Turing-complete languages, which allows both fast simulation and tractable mathematical analysis.286 | Blaise Agüera y Arcas on the Emergence of Replication and Computation
- Because only seven of 256 byte values code for an instruction (roughly one in 32), a random 128-byte tape contains only a small handful of working instructions, and since only three instructions actually change the tape and loops are unlikely to form, the vast majority of initial interactions result in no computation at all.286 | Blaise Agüera y Arcas on the Emergence of Replication and Computation
- Making the code self-modifying — placing the program in the same data space so it can be manipulated like data — was hypothesized to be the key to abiogenesis, which is why the BFF system uses a single tape containing both code and data rather than the original Brainfuck's separate program and data tapes.286 | Blaise Agüera y Arcas on the Emergence of Replication and Computation
- The simulation environment is named BFF, where the first BF stands for Brainfuck and the second F reflects the pairwise interaction of two tapes (also jokingly 'best friends forever').286 | Blaise Agüera y Arcas on the Emergence of Replication and Computation