  The above argument shows that if a set \(S\) is r.e. then it is accepted by some Turing machine, \(P\), i.e., \(S = L(P)\). The converse of this statement holds as well.  That is, \(S\) is r.e. if and only if it is accepted by some Turing machine, \(P\).