Question: Consider a simple polycephalic Turing machine which has two tapes, i 1 and i 2 , each of which is filled completely by zero's except
Consider a simple "polycephalic" Turing machine which has two tapes, i1 and i2, each of which is filled completely by zero's except for a single block of 1's. Let the blocks of 1's on the two tapes be right-justified, as indicated above. Find the simplest possible next-move function that will enable an outside observer to determine whether or not the number of 1's on tape i1 is greater than or equal to the number of 1's on tape i2, assuming that he cannot observe the state q of the Turing machine.
Step by Step Solution
3.42 Rating (158 Votes )
There are 3 Steps involved in it
Heres a simple nextmove function that meets the requirements 1 Initialization Position the heads of ... View full answer
Get step-by-step solutions from verified subject matter experts
