Explore relationships

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.

Use + to expand a branch. Click a topic name to open its summary.