Is there any uncountable Turing decidable language?

Problem Detail: 

There are many(and I mean many) countable languages which are Turing-decidable. Can any uncountable language be Turing decidable?

Asked By : Jyotirmoy Pramanik

Answered By : Yuval Filmus

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.

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/53187