Turing Machines and Decidable Problems

1. Turing Machines
   • Material here
   • More thoughts: intro to Turing Machines | Example TM: 0^n1^n | Example TMs: equal 0s and 1s
2. Variations of Turning Machines:
   • Material here
   • More thoughts: TMs as transducers | Example Transducer: Computing 2^x in unary | Changing TMS | Church's Thesis
3. Decidable Problems and Recursive Languages:
   • Material Part1 and Part2
   • More thoughts Closure properties | Decidable Problems | Some comments on decision problems
4. Summary from book here
5. Extension/Revision Questions:
   • Turing Machines and sols
   • Decidability and Recursive Languages and sols