Subject: Re: [boost] The C++ Post-Processor
From: Joel de Guzman (joel_at_[hidden])
Date: 2009-10-25 11:24:49
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
Or the stack and heap limits, for that matter.
-- Joel de Guzman http://www.boostpro.com http://spirit.sf.net
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk