Palindrome (Turing Test Proj)

Palindrome (Turing Test Proj) - Palindrome Created by Julio...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Palindrome Page 1 Created by Julio "Alex" Gonzalez This Turing Machine tests whether the 1s and 0s within parentheses are palindromes. The machine moves both left and right and replaces the numbers on the tapes with parentheses. If the number located within the parentheses is indeed a palindrom, the machine will print out "Y." If the number located within parentheses is not a palindrome, it will print out the letter "N." This Turing Machine is limited by the fact the palindromes given to it must be within parentheses. It would identify the number 111(1)000 as a palindrome, and ignore the remaining numbers.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Palindrome Page 2 1,0, ,1 Looking for left parentheses. It wasn't found, so the machine keeps searching. 1,1, ,1 Looking for left parentheses. It wasn't found, so the machine keeps searching. 1,(, ,2 The left parentheses was found, so the next step is to read the leftmost endpoint. 2,0,(,14 If the left endpoint is 0, write a ( and send it to state 14. 14,(, ,3 State 2 allows the machine to write what it needs to, and state 14 causes the read/write head to move. It is used solely as a storage state. 2,1,(,15
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/30/2008 for the course PHIL 031 taught by Professor Moor during the Spring '08 term at Dartmouth.

Page1 / 4

Palindrome (Turing Test Proj) - Palindrome Created by Julio...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online