recursively enumerable language

Also known as Turing-recognizable

a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)