Recursive set

In computability theory a countable set is called recursive, computable or decidable if we can construct an algorithm which terminates after a finite amount of time and decides whether or not a given element belongs to the set.

Related Topics:
Computability theory - Countable - Set - Algorithm

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

A more general class of sets are called recursively enumerable sets. These sets include the decidable sets, but only require that they halt on either yes or no (or both, which would make the set decidable) in finite time.

~ ~ ~ ~ ~ ~ ~ ~ ~ ~