 The characteristic function of a predicate is a function which has the value TRUE or FALSE when given appropriate arguments. In order for such functions to be computable, Turing relied on Gödel’s insight that these kind of problems can be encoded as a problem about numbers (See  Gödel’s incompleteness theorem  and the next  Sec. 2.3)  In Turing’s wording: