Problem 4. Prove that a language A C{0,1}* is c.e. if and only if there is a computable partial function f := {0, 1}* + {0,1}* such that dom f = A