Computable set

Set with algorithmic membership test

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.

From Wikipedia, under CC BY-SA. More on occurri.