Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Clarification for Problem 1 in HW 5
0 views
Skip to first unread message
Madhur Tulsiani
Mar 14, 2007, 4:40:42 AM3/14/07
to
This is probably a late clarification, but for problem 1 in HW 5 you must
assume that all the Turing machines in question have the same alphabet. In
particular, you can assume that the input alphabet is {0,1} and the tape
alphabet is {0,1,blank} for all the machines.
assume that all the Turing machines in question have the same alphabet. In
particular, you can assume that the input alphabet is {0,1} and the tape
alphabet is {0,1,blank} for all the machines.
Sorry for the omission.
Madhur
0 new messages