116b- Lecture 15

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 \Sigma_1 graphs, one can see this result as empirical evidence for Church’s thesis, the claim that the intuitive notion of “algorithmically 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 X\subseteq\mathbb{N}, a function f: \mathrm{dom}(f) \subseteq \mathbb{N}^k\to\mathbb{N} is computable by a Turing machine with oracle X iff f is recursive in X (meaning that it is built up from \chi_X and the basic functions by composition, recursion and minimalization) iff f has a graph \Sigma_1 definable in the structure (\mathbb{N},+,\times,0,1,<,X). We then defined the partial order A\le_T B among subsets of \mathbb{N} which holds iff \chi_A is recursive in B.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: