I. Given a string w and a Turing machine M, there exists no algorithm which decides whether the string w is accepted or not. So, it is not recursive.
II. The Turing machine M may or may not halt over the string w, so it is recursively enumerable. (The membership property for TM is undecidable).
What do above sentences mean?
