Turing Machine, Limits and Complexity

1. The Standard Turing Machine
2. TM Variants and Robustness
3. Decidability and the Church–Turing Thesis
4. Undecidability and Reductions
5. The Chomsky Hierarchy
6. Computational Complexity: P and NP

Slide Deck

Key Takeaways

• Exercises and Review