 This illustrates how the existence of a computable function satisfying a recursive definition such as (\ref{recex}) follows from the Recursion Theorem even if we have not started out by characterizing a “computable function” as one defined “recursively” in the informal sense discussed in  Section 1.  And this in turn helps to explain why  Theorem 3.5  has come to be known as the Recursion Theorem.