Recursively enumerable set

A set is computably enumerable when a program halts precisely on its members. Equivalently, it is the domain of a partial computable function or some algorithm lists its elements.

Table of contents 86 1
- Domain and range characterizations of a nonempty computably enumerable set Recursively enumerable set 60

 Ancestors (5)

Computability theory
Foundations of mathematics
Area of mathematics
Mathematics
 Home

 Incoming links (3)

Many-one completeness of the halting problem
Solution
Solution

 Synonyms (1)

Computably enumerable set