25 Oct
2009
25 Oct
'09
3:24 p.m.
Mathias Gaunard wrote:
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?
Or the stack and heap limits, for that matter. Regards, -- Joel de Guzman http://www.boostpro.com http://spirit.sf.net