This isn't even consistent. You can't disprove that language can express infinitely many thoughts by showing a thought language can't express. Likewise, the fact you can show that there exist functions a universal Turing machine can't compute doesn't disprove that a universal Turing machine can compute infinitely many functions.

You're also just plainly wrong, e.g. because recursion exists.