From Wikipedia, the free encyclopedia.
In recursion theory (otherwise called the theory of computability) a set S of integers, or natural numbers, or literal strings, or tuples of any of the above, is recursive or computable or decidable if there is an algorithm that, when given a number or literal string or tuple (as the case may be) returns a correct yes-or-no answer to the question of whether the input number, string, or tuple is a member of the set S.
This article is a stub. You can help Wikipedia by fixing it.
