A Language L may not be accepted by a Turing Machine if:

• A. It is recursively enumerable
• B. It is recursive
• C. L can be enumerated by some turing machine
• D. None of the mentioned