Is there any uncountable Turing decidable language? There are many(and I mean many) countable languages which are Turing-decidable. Can any uncountable language be Turing decidable?
Every language over a finite (or even countable) alphabet is countable. Assuming your Turing machine alphabet is finite, any language it can possibly accept is countable.