Re:Brainfuck interpreter written in the C preprocessor
by caf on Friday November 16, 2012 @10:55PM
(#4797109)
One simple reason that the C Preprocessor language is not Turing complete - the answer to the halting problem for any CPP input is "yes".
[ Parent
| on HN ]
Re:Brainfuck interpreter written in the C preprocessor
by mistercow on Saturday November 17, 2012 @08:48AM
(#4798062)
Ah now, that is an interesting point. Any language that only supports looping by recursion could, in principle, avoid that problem regardless of stack size by transforming recursion into iteration. But CPP can't do that.
Thanks, that's the first clear distinction I've seen for why this is "more" Turing incomplete than C.