Recursive Set
In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set.
A more general class of sets consists of the recursively enumerable sets, also called semidecidable sets. For these sets, it is only required that there is an algorithm that correctly decides when a number is in the set; the algorithm may give no answer (but not the wrong answer) for numbers not in the set.
A set which is not computable is called noncomputable or undecidable.
Read more about Recursive Set: Formal Definition, Examples, Properties
Famous quotes containing the word set:
“Although knaves win in every political struggle, although society seems to be delivered over from the hands of one set of criminals into the hands of another set of criminals, as fast as the government is changed, and the march of civilization is a train of felonies, yet, general ends are somehow answered.”
—Ralph Waldo Emerson (1803–1882)