Articles by others on the same topic
RE, or recursively enumerable, refers to a class of languages in the theory of computation that can be recognized by a Turing machine. Specifically, a language is said to be recursively enumerable if there exists a Turing machine that will accept any string in the language (i.e., it will halt and say "yes" if the string is part of the language) but may either reject or run forever if the string is not in the language.