No -- the Turing completeness of templates that people refer to just talks about the fact that templates are powerful enough to compute anything. It's a differe

No -- the Turing completeness of templates that people refer to just talks about the fact that templates are powerful enough to compute anything. It's a different issue from parsing the template syntax in the first place, which is the problem they talk about here.