25 Oct
2009
25 Oct
'09
3:08 p.m.
Christopher Jefferson wrote:
While that is a very impressive piece of coding, it doesn't show [Turing]-completeness of the preprocessor, as the code is hardwired to at most 2^30-1 reductions.
How is that significantly different from the recursion limit in template meta-programming?