Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2025/ii/paper-1/12f/b/solution

Let and let be any index for the empty language. The proof of Rice theorem gives
In either case choose a language on the opposite side of the nontrivial property and switch from the empty enumerator to its enumerator if the simulated diagonal computation halts.

New to topics? Read the docs here!