Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 1 / 12I / iv / Solution

For an effective enumeration $(W_w{)}_{w\in \mathbb{W}}$ of the computably enumerable languages, the diagonal halting problem isEquivalently, if $f_{w,1}$ is the unary partial function coded by $w$, thenThus $\mathbf{K}$ is the diagonal halting set.

Solved by gpt-5.6-sol high.