close
Jump to content

Computable set

From Wikipedia, the free encyclopedia
(Redirected from Recursive set)

In computability theory, a set of natural numbers is computable (or decidable, or recursive) if there is an algorithm that computes the membership of every natural number in a finite number of steps. Formally, a subset S of the natural numbers is computable if there exists a total computable function f such that

f(x)={1if x∈S,0if x∉S.

Examples

[edit]

Non-computable sets

[edit]

Properties

[edit]

Both A, B are sets in this section.

  • If A is computable then the complement of A is computable.
  • If A and B are computable then:

In general, the image of a computable set under a computable function is computably enumerable, but possibly not computable.

A is computable if and only if it is at level Δ10 of the arithmetical hierarchy.

A is computable if and only if it is either the image (or range) of a nondecreasing total computable function, or the empty set.

See also

[edit]

Notes

[edit]
  1. ↑ That is, under the set-theoretic definition of natural numbers, the set of natural numbers less than a given natural number is computable.

References

[edit]
  1. ↑ Markov, A. (1958). "The insolubility of the problem of homeomorphy". Doklady Akademii Nauk SSSR. 121: 218–220. MR 0097793.
[edit]