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?”
HTML5 + CSS3 is Turing complete, but just basic html is not.
how does something get tested for turing completeness
You port Doom to it.
Or linux.
@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?”
By building a simulated Turing machine, usually… or at least by demonstrating that all the components to do so are available.
I mean it’s technically turning complete through Rule 110 automata, but it requires user input to advance each step so…
My favourite example like this
On the Turing Completeness of PowerPoint
Yep, perfect example! Just because it’s technically turning complete doesn’t mean it’s in any way usable or practical haha