Reduce $K$ to the set of natural numbers codifying programs such that the domain of the function computed by the program has cardinal at least $2$ (roughly, the set of programs implementing functions whose domain has at least two elements) in order to prove that such set is undecidable (not recursive).