recursively enumerable language
a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
recursive language
recursive subset of the set of all possible finite sequences over the alphabet of the language