News for hackers. Stuff that matters.
Re:Design patterns implemented in Java by kazinator on Wednesday August 30, 2017 @01:03AM (#15129830)
C++ template meta programming isn't Turing complete in a way that is useful.

Turing Complete means that you can calculate any partial recursive function (given some suitable input encoding).

For instance, in pure Lambda Calculus that has only functional terms (no numbers), we an make integers out of function using "Church numerals" and then calculate functions over these numbers. No amount of such calculation will produce an integer object, though.

Similarly C++ template cannot calculate any C++ syntax whatsoever, in spite of Turing Completeness. You get template functions and template classes; that's it.

There are no comments on this comment yet.