How things work college course/Turing machine quiz
Jump to navigation
Jump to search
This quiz covers Wikipedia's Computer (Wikipedia permalink) and its links: w:Turing machine * w:Busy beaver * w:Halting problem * w: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[edit | edit source]
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.
- In State A: Print 1. Move head Right. Go to State B.
- 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).
- In State A: Print 1. Move head Left. Go to State B.
The following table should be made available to students as they take the quiz:
A | B | |
---|---|---|
0 | 1RB | 1LA |
1 | 1LB | 1RH |
Computer TURING MACHINE[edit | edit source]