We proved that the class of functions computable by means of Turing machines coincides with the class of recursive functions. Together with the characterization of the recursive functions as those admitting graphs, one can see this result as empirical evidence for Church’s thesis, the claim that the intitive notion of “algorithymically computable” is correctly formalized in the notion of recursive. An immediate consequence of this result is the existence of universal Turing machines.
We defined machines with oracles and stated the corresponding result: Given an oracle , a function is computable by a Turing machine with oracle iff is recursive in (meaning that it is built up from and the basic functions by composition, recursion and minimalization) iff has a graph definable in the structure . We then defined the partial order among subsets of which holds iff is recursive in .