Is L={|M is a TM and L(M) is uncountable} decidable?
This is somewhat of a trick question. What you are missing is that there are no uncountable languages over a finite (or even countable) alphabet. This should be enough information to answer it. 

(I initially gave the entire answer away, but edited it out after considering a bit.)