Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2023/ii/paper-1/12i/iv/solution

For an effective enumeration of the computably enumerable languages, the diagonal halting problem is
Equivalently, if is the unary partial function coded by , then
Thus is the diagonal halting set.

New to topics? Read the docs here!