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