 Either by invoking Church’s Thesis or by formalizing the prior algorithm as a partial recursive definition, it follows that \(k(x)\) is computable. But this contradicts  Proposition 3.1  which shows that \(k(x)\) is not computable. □