3: III- Turing Machines Last updated Sep 12, 2021 Save as PDF 2.7.7: Other Logics 3.1: Turing Machine Computations Page ID121594 Richard Zach et al.Open Logic Project ( \newcommand{\kernel}{\mathrm{null}\,}\) 3.1: Turing Machine Computations3.1.1: Introduction3.1.2: Representing Turing Machines3.1.3: Turing Machines3.1.4: Configurations and Computations3.1.5: Unary Representation of Numbers3.1.6: Halting States3.1.7: Combining Turing Machines3.1.8: Variants of Turing Machines3.1.9: The Church-Turing Thesis3.1.10: Summary3.2: Undecidability3.2.1: Introduction3.2.2: Enumerating Turing Machines3.2.3: The Halting Problem3.2.4: The Decision Problem3.2.5: Representing Turing Machines3.2.6: Verifying the Representation3.2.7: The Decision Problem is Unsolvable3.2.8: Summary