On the Recursive Enumerability of Fixed-Point Combinators