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......
3. Use Mathematical Induction on n to prove that if the TM (above) is started with a blank tape, after 10 n + 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.
3. Use Mathematical Induction on n...
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: ..00111)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
3. Use Mathematical Induction on n to...
0 1ORO 1RI 2 1R41R5 3 OR11L3 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 wil be in state 3 with the tape reading:001)"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.
0 1ORO...
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...