Question

I think I am doing it wrong because im ending up on a halting state, can someone help with this question.

0 1R2OL5 1OR0 1R1 21R4 1R5 3OR1 1L3 1 1L3 1L5 3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10n +4 steps the machine will be in state 3 with the tape reading: ...0(0111)"011100.... That is, although there are three states with halting instructions, show why none of those instructions is actually encountered, and formulate this into a proof that this machine does not halt when started with a blank tape.

Answer 1

Ang e1 oRo 12s 2 Ru IL3 ILS 113 e need to freue hductan nhot ナEnama ma chrrue lon he ca3 folles

2 steps euut sh ould e ke Test 1: Tape0ocoo It oooo

2 steps euut sh ould e ke Test 1: Tape0ocoo It oooo

2 steps euut sh ould e ke Test 1: Tape0ocoo It oooo

test2 oooooolllolooo hence Pieve d (2), In '.rm , State dcoM (ơr )hot ps+cfe is

.. CCocoloc.