Language
S
over alphabet
A
is computable if there exists a program (or algorithm)
p
so that
p
halts on all inputs and,
for every
x
∈
A
*, φ
p
(
x
) = yes ⇔
x
∈
S
.
That is,
p
solves
S
.