Reduce $\overline{K}$ to the set of natural numbers such that the program codified by them computes the identity function (roughly, the set of programs that compute the identity function), in order to prove that such set is not semi-decidable (not recursively enumerable).