A recursive language (also known as a decidable language) is a type of formal language in the field of computer science and computational theory. Specifically, a recursive language is a set of strings over a given alphabet for which there exists a Turing machine that will accept every string in the language and will reject (or halt) every string that is not in the language.
