| ENCYCLOPEDIA 4U .com |
Encyclopedia Home Page |
|
|
Recursive setIn 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. 
|
Content on this web site is provided for informational purposes only. We accept no responsibility for any loss, injury or inconvenience sustained by any person resulting from information published on this site. We encourage you to verify any critical information with the relevant authorities.
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Recursive set".