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 are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: !programmerhumor@lemmy.ml
Post funny things about programming here! (Or just rant about your favourite programming language.)
Rules:
Posts must be relevant to programming, programmers, or computer science.
No NSFW content.
Jokes must be in good taste. No hate speech, bigotry, etc.
how does something get tested for turing completeness
By building a simulated Turing machine, usually… or at least by demonstrating that all the components to do so are available.
@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.