Like I get that a Turing Machine is a decider if it halts for every input . But for this question, it just gave me this diagram and asked me to deduce whether this Turing Machine was considered a decider or not and the answer was no. How was 'no' deduced? I can't seem to wrap my head around this whole decider and non-decider Turing Machine thing. If anyone could help explain this to me. Thanks.
If I am getting this right, then if I write "ba" on the tape and start the Turing machine with the head located at "b", then it will loop forever.
You can see that this will loop forever. Because there is an input for which the Turning machine doesn't halt, it's not a decider.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.