How things work college course/Turing machine quiz

This quiz covers Wikipedia's Computer (Wikipedia permalink) and its links:  Turing machine * Busy beaver * Halting problem * Bombe. For another quiz on this topic, see Computer quiz.

The un-shuffled version of this quiz serves as a good pre-reading activity for the article. For randomized versions of this quiz, use the testbank. For information on how to print out test copies (and other questions) see How to use testbank.

Turing machine: 2-state 2-symbol busy beaver
The 2-state 2-symbol busy beaver starts with all zeros and proceed as follows:
 * If head reads 0 and
 * In State A: Print 1. Move head Right. Go to State B.
 * In State B: Print 1. Move head Left. Go to State A.
 * If head reads 1 and
 * In State A: Print 1. Move head Left. Go to State B.
 * In State B: Print 1. Move head Right. Go to State H (Halt).

The following table should be made available to students as they take the quiz:

Computer TURING MACHINE
{If the machine is at A: 000 0 00, what's next?} - B: 000 0 10 + B: 0001 0 0 - A: 0001 0 0 - A: 0000 1 0 {If the machine is at B: 0001 0 0, what's next?} - B: 000 1 10 - A: 001 1 00 - B: 0001 1 0 + A: 000 1 10 {If the machine is at A: 000 1 10, what's next?} - B: 0011 0 0 + B: 00 0 110 - A: 00 0 110 - A: 0011 1 0 {If the machine is at B: 00 0 110, what's next?} - B: 0001 1 1 - B: 0 0 1110 - A: 00 1 110 + A: 0 0 1110 {If the machine is at A: 0 0 1110, what's next?} + B: 01 1 110 - H: 01 1 110 - A: 01 1 110 - H: 011 1 10 {If the machine is at B: 01 1 110, what's next?} - B: 011 1 10 + H: 011 1 10 - A: 01 1 110 - H: 01 1 110