Decisions Problem and the Church-TuringThesis
The unary representation of natural numbers represents thenumber n by (n+1) 1’s. For example, the number 3 isrepresented by 1111, the number 5 by 111111 and the number 0 by1.
Design a one or two tape (your choice) deterministic Turingmachine that does the following computation.
Input: representation of natural number n
Result: representation of 2n on the tape in the input position.The remainder of the tape(s) is/are blank.
a) Briefly describe the strategy of your machine.
b) Give the state diagram for your machine.
Solution
Bl Changed t。 北 6.