  Now we can formally define what it means for a set to be recursively enumerable (r.e.) which we earlier described informally. Let \(S \subseteq \mathbf{N}\). Then \(S\) is r.e. if and only if there is some Turing machine, \(M\), such that \(S\) is the image of the function computed by \(M\), in symbols,