In
computability theory, traditionally called recursion theory, a set
S of
natural numbers is called
recursively enumerable,
computably enumerable,
semidecidable,
provable or
Turing-recognizable if:
- There is an algorithm such that the set of input numbers for which the algorithm halts is exactly S.