UTM theorem

In computability theory the utm theorem or universal turing machine theorem is a basic result about effective numberings of the the of computable functions.

Rogers equivalence theorem provides a characterization of the effective numberings of the computable functions in terms of the smn theorem and the utm theorem.