Question: ld is not recursively enumerable?
Answer: L is recursively enumerable but not decidable. That is, any Turing machine M such that L(M) = L, M does not halt on some inputs. ... Thus, Ld is the collection of Turing machines (programs) M such that M does not halt and accept when given itself as input.