recursively enumerable set

Also known as computably enumerable set, c.e. set, r.e. set, semidecidable set, partially decidable set, listable set, provable set, Turing-recognizable set

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