Computable 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.
Wikipedia contributors, "Computable set", Wikipedia, revision 1381380068, retrieved 20 November 2026, source, CC BY-SA 4.0.