Source: wikibot/computable-set
= Computable set
{wiki=Computable_set}
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.