No actual implementation of a language is Turing complete because the universe is finite, but a language specification could be. I think the argument here is that even if you had a computer with infinite memory, if you implemented C99 per the specification it would not be Turing complete.
The literal definition of Turing completeness means that if you can use an environment to implement a Turing machine, the environment is necessarily Turing complete.
