Question: Suppose there is a two-dimensional Turing machine, which writes to an infinite grid, rather than an infinite tape. Transitions can move the tape head left,
Suppose there is a two-dimensional Turing machine, which writes to an infinite grid, rather than an infinite tape. Transitions can move the tape head left, right, up or down. Prove or disprove that the set of languages accepted by this 2D machine is the same as those accepted by a standard Turing machine
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
