2 Generating computable functions 32 ubstitution combined with the principle described in the next s s a powerful method of generating computable functions. fu th Exercises 1. Without writing any programs, show that for every mEN the following functions are computable: (a) m (recall that m (x)-m, for all x), (b) mx. 0l . Suppose that f(x, y) is computable, and mEN. Show that the function h(x) f(x, m) is computable. Suppose that g(x) is a total computable function. Show that the predicate M(x, y) given by M(x, y) g(x)-y' is decidable 4. fu eq Ni e