|
|
Boost : |
Subject: Re: [boost] The C++ Post-Processor
From: Mathias Gaunard (mathias.gaunard_at_[hidden])
Date: 2009-10-25 11:08:06
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?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk