I could be wrong, but I don’t think the creators envisioned it being a basis for easily proving the Turing Completeness of other languages, but it did. They were more thinking “how can I have the most fucked up language in the smallest package and still be Turning Complete?”
how does something get tested for turing completeness
@jackpot @KittyCat implementing a brainfuck interpreter for it is a useful method
Just about the only good reason for Brainfuck.
@frezik I mean that’s literally it’s purpose. being a minimal turing complete language.
I could be wrong, but I don’t think the creators envisioned it being a basis for easily proving the Turing Completeness of other languages, but it did. They were more thinking “how can I have the most fucked up language in the smallest package and still be Turning Complete?”
You port Doom to it.
Or linux.
By building a simulated Turing machine, usually… or at least by demonstrating that all the components to do so are available.