519
you are viewing a single comment's thread
view the rest of the comments
[-] jackpot@lemmy.ml 8 points 4 months ago

how does something get tested for turing completeness

[-] fleckenstein@social.lizzy.rs 11 points 4 months ago

@jackpot @KittyCat implementing a brainfuck interpreter for it is a useful method

[-] frezik@midwest.social 5 points 4 months ago

Just about the only good reason for Brainfuck.

[-] fleckenstein@social.lizzy.rs 3 points 4 months ago

@frezik I mean that's literally it's purpose. being a minimal turing complete language.

[-] frezik@midwest.social 14 points 4 months ago

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?"

[-] xmunk@sh.itjust.works 10 points 4 months ago

By building a simulated Turing machine, usually... or at least by demonstrating that all the components to do so are available.

this post was submitted on 06 Mar 2024
519 points (96.1% liked)

Programmer Humor

31259 readers
794 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

founded 4 years ago
MODERATORS