Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2020/ii/paper-1/12f/c/i/solution

The function is not partial computable. It is defined on every input, so if a register machine with code computed it, then and in particular would be defined. The first clause in the definition would give
which is impossible. This is the usual diagonal argument behind the noncomputability of the diagonal halting set.

New to topics? Read the docs here!