My Turing Machine or Yours?

author: John Goldsmith, +Departments of Linguistics and Computer Science, University of Chicago
published: Oct. 31, 2007,   recorded: June 2007,   views: 9320


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


The title of this talk is “Your Turing Machine or Mine?”. What I am alluding to with this title is the universality of a universal Turing machine, and at the same time, to the fact that there are many different universal Turing machines with somewhat different properties. Universal Turing machines are both universal and individual, in different senses. A universal Turing machine is one that can emulate (or imitate) any other Turing machine, and thus in a sense can undertake to compute any of a very large class of computable functions. But there are an indefinitely large number of universal Turing machines that can be defined.

See Also:

Download slides icon Download slides: mlcs07_goldsmith_john.pdf (742.6 KB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: