The aim is to complete the following instruction table to obtain a 2-state Turin

Question

The aim is to complete the following instruction table to obtain a 2-state Turing Machine which runs for the maximal (2) = 6 steps then halts, having started with a blank tape. (i) What is meant by a 'halting instruction'? Which of the two states must this TM be in, to encounter the 'halt' instruction? Why? (ii) Can there be more than one way to complete the TM to run for exactly 6 steps? If so, how many ways? Justify your answer. (iii) Complete the instruction table, so that the TM leaves a maximal number of 1s on the tape, but with the head finishing on a '0'.

Explanation / Answer

Basically  Halt instruction uss to freeze the worth of Program Counter. Since Program Counter isn't obtaining updated and keeps its worth as its is, taking of any instruction isn't doable. this may keep silicon chip in steady position. Clock is internally active however not connected to the Program Counter.

For other questions please provide as seprate question

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.