-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Lecture "Computability", exercise 1 #7
Labels
Comments
Hi all, thanks for your takes. Just a note for all: remember that you are entitled to use only two symbols in the Turing Machines, i.e. |
Start state: A
# 1 is printed only left and right the starting position.
blank: '0'
start state: A
table:
# print 1, move left
A:
[0]: {write: 1, L: B}
# print 1, move back right
B:
[0]: {write: 1, R: C}
# check if 1, turn it to 0 and back to B, otherwise stop
C:
[1]: {write: 0, R: B}
[0]: {R: D}
D: |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Write the table of instructions of a Turing machine with four states – A (initial state), B, C, and D (final state) – such that, once reached the final state, only the cells immediately on the left and on the right of the initial position of the head of the machine will have the value 1 specified. The final state must not have any instruction set in the table.
The text was updated successfully, but these errors were encountered: