Non-deterministic turing machine, with writing capability is equivalent to
Answers
Answered by
0
A nondeterministic Turing machine is a Turing machine which, as nondeterministic limited automata, at any state, it is in and for the tape image it is reading, can make any action choosing from an arrangement of determined actions as opposed to making one positive foreordained activity.
Indeed, even in a similar circumstance, it might take distinctive activities under various circumstances. Here an activity implies the mix of composing a symbol on the tape, moving the tape head and setting off to a next state.
A deterministic Turing machine, then again, cannot figure the midpoint of the string x. It must find the midpoint by for instance matching off symbols from either end of x.
Indeed, even in a similar circumstance, it might take distinctive activities under various circumstances. Here an activity implies the mix of composing a symbol on the tape, moving the tape head and setting off to a next state.
A deterministic Turing machine, then again, cannot figure the midpoint of the string x. It must find the midpoint by for instance matching off symbols from either end of x.
Similar questions