This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1880 of 2,872·42. Turing Machines and ComputabilityPro lesson
Proof by Contradiction Setup
Set up the classic proof that the halting problem is undecidable using contradiction.