Course contentsShow
Computer Science
Lesson 1881 of 2,87242. Turing Machines and ComputabilityPro lesson

Constructing the Diagonal Argument

Build the diagonal argument: assume a halt-checker exists and construct a paradoxical program.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.