In the context of computability theory and theoretical computer science, a **computable set** (also known as a recursively enumerable set) refers to a set of natural numbers for which there exists a total computable function (often represented as a Turing machine) that can enumerate its elements.
Articles by others on the same topic
A set is computable when an algorithm decides membership for every input and always halts. Equivalently, both the set and its complement are computably enumerable.