# Infinite u decidable languages [closed]

I am trying to see if infinite languages are always decidable. I believe it is not always decidable because there will not be a maximum length of string for the Turing machine to halt. Am I on the right path? I am having difficulty coming up with an example infinite language That is decidable.

• Are these languages with an infinite number of words? With words that may have infinite length? Both? – André Souza Lemos May 8 '15 at 19:15
• Finite set of strings in the language – Jake May 8 '15 at 19:33
• I suggest that you edit the question, making this distinction explicit. It is not an easy guess. – André Souza Lemos May 8 '15 at 20:03
• All finite languages are regular and thus decidable. Some of the infinite languages are decidable and some are not. See cs.stackexchange.com/a/11289 – Ran G. Jun 7 '15 at 21:00
• and see also cs.stackexchange.com/questions/1990 – Ran G. Jun 7 '15 at 21:03

There are many infinite languages which are decidable, for example $\Sigma^*$, or the language of all (binary representations of) primes. However, in some sense "most" languages are undecidable, since there are uncountably many languages, but only countably many decidable languages. We also know many explicit undecidable languages, such as the language of (encodings of) Turing machines which halt on the empty input.