Multiple Choice
If a Turing machine program consists of the following four instructions:
(1,0,1,2,R)
(1,1,0,2,R)
(2,0,0,2,R)
(2,b,b,2,L)
Then the configuration ____ is a halting configuration.
A) ... b 1 1 b b b ... (current state = 2, symbol 1 is being read)
B) ... b 1 1 b b b ... (current state = 1, symbol 1 is being read)
C) ... b 1 0 b b b ... (current state = 1, symbol 0 is being read)
D) ... b 1 0 b b b ... (current state = 2, symbol 0 is being read)
Correct Answer:

Verified
Correct Answer:
Verified
Q25: Turing machines define the limits of _,
Q26: Prototypes are an important way of studying
Q27: Each time a Turing machine operation is
Q28: The model of a phenomenon does not
Q29: An extra bit, called a(n)_, can be
Q31: A tape is used to hold the
Q32: Describe in detail what a Turing machine
Q33: A computing agent must be able to
Q34: In any collection of Turing machine instructions,
Q35: State _ is always the start-up state