Computable set

Set where an algorithm can take a number as an input and can decide whether the number belongs to the 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.

Nº Q877945 ★★

Uncommon · Knowledge

Computable set

Set where an algorithm can take a number as an input and can decide whether the number belongs to the 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.

From Wikipedia

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.

Text: Wikipédia, CC BY-SA 4.0. · Image: Jean-Christophe BENOIST (CC BY-SA 4.0) ·

Related cards

Finite set

Set that has a finite number of elements

Nº Q272404 ★★

Not listed
Number sets

Set containing numbers

Nº Q3054943 ★★★

Not listed
Recursive definition

Defining the elements in a set in terms of other elements in the set

Nº Q2466486 ★

Not listed
W

Well-ordered set

Set paired with a well-order relation

Nº Q54561312 ★★

Not listed
R

RE (complexity)

Complexity class

Nº Q905621 ★★

Not listed
O

Order type

Two ordered sets X,Y are said to have the same order type just when they are order isomorphic, that is, when there exists a bijection f: X → Y such that both f and its inverse are strictly increasing

Nº Q620006 ★

Not listed