3: III- Turing Machines Last updated Save as PDF Page ID 121594 Richard Zach et al. Open Logic Project 3.1: Turing Machine Computations 3.1.1: Introduction 3.1.2: Representing Turing Machines 3.1.3: Turing Machines 3.1.4: Configurations and Computations 3.1.5: Unary Representation of Numbers 3.1.6: Halting States 3.1.7: Combining Turing Machines 3.1.8: Variants of Turing Machines 3.1.9: The Church-Turing Thesis 3.1.10: Summary 3.2: Undecidability 3.2.1: Introduction 3.2.2: Enumerating Turing Machines 3.2.3: The Halting Problem 3.2.4: The Decision Problem 3.2.5: Representing Turing Machines 3.2.6: Verifying the Representation 3.2.7: The Decision Problem is Unsolvable 3.2.8: Summary