CS 381 Assignment 9 due Friday, Nov. 10, 2006 Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignment back to you by the following Wednesday. If you turn in homework not on separate sheets we will circulate your homework and grade the problems in serial and thus it will likely be delayed somewhat in getting back to you. 1. Let M be a Turing machine and let L(M) be the set of strings that are accepted by M.
This is the end of the preview.
access the rest of the document.
Halting problem, Alan Turing, Busy beaver, Register machine