These files demonstrate the Turing Machine syntax
div3.txt - Divides a binary number by 3
add.txt - Adds two binary numbers together
MPalin.txt - Tests if a string of 0's and 1's is a Palindrome (symmetrical) (eg 0110 and 10101 are, 0011 and 10010 aren't)
block01.txt - Tests if a string of 0's and 1's is of the form 0^n1^n (eg 000111 is, 00111 and 111000 aren't)
UTM.txt - A Programmable Turing Machine, which can simulate the behaviour of any Turing Machine supplied to it
invtrk.txt - converts a single track input of 0's and 1's into a double track outpt, where the second track contains the opposing symbol to that of the original track
Back to Main