Set
S
is computable if there exists a program
p
so that
φ
p
(
x
)↓ for every
x
φ
p
(
x
) = yes when
x
∈
S
φ
p
(
x
) = no when
x
∉
S