Reduce $\overline{K}$ to the set of natural numbers such that the program codified by them does not halt with any input (roughly, the set of programs non-halting with any input), in order to prove that such set is not semi-decidable (not recursively enumerable).