Design an Infinite NTM for Any Input String: Turing Machine Question

[leo0liver]

Hey guys just wondering if I could get some help with this question. I am having trouble with it as I don't know what the input language is and therefore what inputs to handle. Heres the question:

Design an NTM (normalised Turing machine) that never terminates, so that regardless of the input string, it always gives an infinite configuration sequence. (You only need two states!)

Thanks in advance!

 

[BvU]

Hello Leo, !

Alas, PF is not a place that does your homework for you. Read the guidelines:

https://www.physicsforums.com/threads/homework-help-guidelines-for-students-and-helpers.686781/

 

[leo0liver]

Ok sorry about that will read now

 

[berkeman]

(Thread moved to the schoolwork forums)

Welcome to the PF, @leo0liver -- What can you tell us about Turing machines, and what can affect whether they terminate?

 

[leo0liver]

Hey the problem I was having with this question is I was not sure what the set of inputs would be. For example if they had stated that it was a binary input I would have moved the tape head to the right for inputs 1 and 0 and then started an infinite loop causing the tape head to never return to the first position and therefore never terminate. If the input language is not specified wouldn't there be a very large of possibilities of letters that the machine first sees on the tape that would cause it to abort and finish in the starting position? Or is there a way to move left on the tape no matter what the input?

 

[leo0liver]

I could also be overthinking it and what they really are asking for is a machine that never terminates for an input of 0 1 or blank.