From 859f3b6729ca890f63dd3aed6b7ab90d3d468f4a Mon Sep 17 00:00:00 2001 From: Daniel Holden Date: Sat, 17 Nov 2012 13:35:00 +0000 Subject: [PATCH] Update README.md --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index ff889d5..4cf0467 100644 --- a/README.md +++ b/README.md @@ -3,12 +3,12 @@ BRAINFUCK A Brainfuck interpreter written in the C preprocessor. -There has been much speculation on the turing completeness of the C Preprocessor, but I believe ~~this is the first demonstrative proof that the C preprocessor _is_ turing complete~~*. This uses no GCC extensions and other than the rules for macro evaluation the only "features" it takes advantage of are token pasting and variable argument macros. +There has been much speculation on the turing completeness of the C Preprocessor, but I believe ~~this is the first demonstrative proof that the C preprocessor _is_ turing complete~~**. This uses no GCC extensions and other than the rules for macro evaluation the only "features" it takes advantage of are token pasting and variable argument macros. Thanks to [pfultz](https://github.com/pfultz2/Cloak/wiki/Is-the-C-preprocessor-Turing-complete%3F) and the many others for their contributions and ideas on recursion in the C preprocessor. -* I stand corrected! [Vesa Karvonen](http://chaos-pp.cvs.sourceforge.net/viewvc/chaos-pp/order-pp/), one of the authors of Boost.PP beat me to it by implementing a lisp like dialect in the CPP -* Another Brainfuck in CPP implementation also exists by [kotha](http://www.kotha.net/bfi/) +** I stand corrected! [Vesa Karvonen](http://chaos-pp.cvs.sourceforge.net/viewvc/chaos-pp/order-pp/), one of the authors of Boost.PP beat me to it by implementing a lisp like dialect in the CPP +** Another Brainfuck in CPP implementation also exists by [kotha](http://www.kotha.net/bfi/) Compiling ---------