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:
“He could walk, or rather turn about in his little garden, and feel more solid happiness from the flourishing of a cabbage or the growing of a turnip than was ever received from the most ostentatious show the vanity of man could possibly invent. He could delight himself with thinking, “Here will I set such a root, because my Camilla likes it; here, such another, because it is my little David’s favorite.””
—Sarah Fielding (1710–1768)