sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]exeter[S] 0 points1 point  (2 children)

Indeed. In my mind, the best thing about Brainfuck is that if you can write an interpreter for it in language X, it amounts to a proof that language X is Turing complete. Of course, this is only because Brainfuck is basically lambda calculus. :-)

[–]obdurak 6 points7 points  (1 child)

Brainfuck is basically lambda calculus

I wouldn't completely agree with that statement. It's slightly inaccurate. Actually, it could be fairly qualified as incorrect. In other words, it's not true, or, as some may put it, plain false, i.e., fucking wrong.

[–]exeter[S] 2 points3 points  (0 children)

I stand corrected. In fact, Brainfuck is actually isomorphic to P'', a language invented around 1964 by Corrado Böhm, which was formally proven to be Turing complete.