How does one prove that a programming language is not Turing complete?
I know one may attempt to show that every program that could be written in the programming language in question is primitive recursive.
But are there other ways/constructs than primitive recursion that we know are also not as expressive as $\mu$-recursion?