Numbering of prime enumerating functions

63 Views Asked by At

I have a trouble solving this problem. Let's define $I$ as a set of those $i \in N$ such that $\varphi_i$ is an injective total recursive function and its range consists of all primes. Are $I$ and its complement $I^C$ recursively enumerable? Thank you in advance for your help.