 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.
Contents
Formal definition
A subset S of the natural numbers is called recursive if there exists a total computable function f such that f(x) = 1 if x ∈ S and f(x) = 0 if x ∉ S . In other words, the set S is recursive if and only if the indicator function 1_{S} is computable.
Examples
 Every finite or cofinite subset of the natural numbers is computable. This includes these special cases:
 The empty set is computable.
 The entire set of natural numbers is computable.
 Each natural number (as defined in standard set theory) is computable; that is, the set of natural numbers less than a given natural number is computable.
 The set of prime numbers is computable.
 A recursive language is a recursive subset of a formal language.
 The set of Gödel numbers of arithmetic proofs described in Kurt Gödel's paper "On formally undecidable propositions of Principia Mathematica and related systems I"; see Gödel's incompleteness theorems.
Properties
If A is a recursive set then the complement of A is a recursive set. If A and B are recursive sets then A ∩ B, A ∪ B and the image of A × B under the Cantor pairing function are recursive sets.
A set A is a recursive set if and only if A and the complement of A are both recursively enumerable sets. The preimage of a recursive set under a total computable function is a recursive set. The image of a computable set under a total computable bijection is computable.
A set is recursive if and only if it is at level Δ0
1 of the arithmetical hierarchy.A set is recursive if and only if it is either the range of a nondecreasing total computable function or the empty set. The image of a computable set under a nondecreasing total computable function is computable.
References
 Cutland, N. Computability. Cambridge University Press, CambridgeNew York, 1980. ISBN 0521223849; ISBN 0521294657
 Rogers, H. The Theory of Recursive Functions and Effective Computability, MIT Press. ISBN 0262680521; ISBN 0070535221
 Soare, R. Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. SpringerVerlag, Berlin, 1987. ISBN 3540152997
Categories:  Every finite or cofinite subset of the natural numbers is computable. This includes these special cases:
Wikimedia Foundation. 2010.
Look at other dictionaries:
Recursive — may refer to:*Recursion *Recursively enumerable language *Recursively enumerable set *Recursive filter *Recursive function *Recursive language *Recursive acronym *Recursive set *Primitive recursive function … Wikipedia
Recursive languages and sets — This article is a temporary experiment to see whether it is feasible and desirable to merge the articles Recursive set, Recursive language, Decidable language, Decidable problem and Undecidable problem. Input on how best to do this is very much… … Wikipedia
recursive — A procedure that is applied once, and then applied to the result of that application, and so on. A recursive definition (definition by induction) defines the result of some operation for 0, and then the result for any number n + 1 in terms of the … Philosophy dictionary
Set (mathematics) — This article gives an introduction to what mathematicians call intuitive or naive set theory; for a more detailed account see Naive set theory. For a rigorous modern axiomatic treatment of sets, see Set theory. The intersection of two sets is… … Wikipedia
Set theory — This article is about the branch of mathematics. For musical set theory, see Set theory (music). A Venn diagram illustrating the intersection of two sets. Set theory is the branch of mathematics that studies sets, which are collections of objects … Wikipedia
Recursive partitioning — is a statistical method for multivariable analysis.cite book author=Breiman, Leo title=Classification and Regression Trees publisher=Chapman Hall/CRC location=Boca Raton year=1984 pages= isbn=0 412 04841 8 oclc= doi=] . Recursive… … Wikipedia
Recursive Bayesian estimation — is a general probabilistic approach for estimating an unknown probability density function recursively over time using incoming measurements and a mathematical process model. Model The true state x is assumed to be an unobserved Markov process,… … Wikipedia
Recursive language — This article is about a class of formal languages as they are studied in mathematics and theoretical computer science. For computer languages that allow a function to call itself recursively, see Recursion (computer science). In mathematics,… … Wikipedia
Recursive ordinal — In mathematics, specifically set theory, an ordinal α is said to be recursive if there is a recursive binary relation R that well orders a subset of the natural numbers and the order type of that ordering is α. It is trivial to check that ω is… … Wikipedia
Recursive definition — A recursive definition or inductive definition is one that defines something in terms of itself (that is, recursively), albeit in a useful way. For it to work, the definition in any given case must be well founded, avoiding an infinite regress.… … Wikipedia