Question: language is not recursively enumerable?
Answer: An example of a language which is not recursively enumerable is the language L of all descriptions of Turing machines which don't halt on the empty input.