A set of strings S is computable if there exists a Turing machine M so that, for every string x, both of the following hold.
M accepts x ⇔ x ∈ S
M rejects x ⇔ x ∉ S