Turing Machine Adder

1
Turing Machine Adder

• Input string of 1s separated by zeros
• E.g., 01101110 gt 2 3
• Output string of 1s surrounded by 0s.
• E.g., 0111110 (5)

2
(No Transcript)
3
Fascinating Facts

• Any program you can write on a computer can also
  be written as a TM program
• TM programs with P complexity are P complexity on
  a computer
• TM programs that are NP are NP on a computer.
• TM is complete
• Parsers look remarkably like TMs
• Parsers look like TMs, programs are like TMs . .
  . .

4
Example

• E -gt E T T
• T -gt T F F
• F -gt (E) id

5
Example
6
Example