I often hear that C++ templates are Turing complete. What does it mean?
My previous search lead me to links [1] and [2] which are good but they do not answer what I am asking.
it's capable of expressing general recursion by simply using templates that refer to themselves and using template specialization for making decisions.
Is recursion and and making decision equivalent to Turing completeness?
Could someone please break down the requirements of Turing completeness in the programming aspect (not from the computer science aspect)?