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.
Just as assembly language is also turing complete, but there is also a ton of usability difference between it versus C/C++, in favor of C/C++ and with little performance penalty.
A language can be Turing Complete, yet do only pure calculation plus I/O strictly in Roman numerals on two predefined streams.
Good luck decoding a JPEG with that, right?