Assignment3
Assignment3
(b) Design a Turing machine which recursively enumerates L. Recall that such a Turing ma-
chine has no input but prints the words on an output tape. You may assume several
other tapes. (Hint: see the video on recursively enumerable languages.)
(c) Simulate the subroutine program you have written for the previous exercise on different
input strings. Submit your code.
Let M be a Turing machine not necessarily halting on every input. Construct Turing machine
M 0 which halts on w if ww ∈ L(M) and does not halt otherwise.