few machines might not halt on X. then we cant say anything abt X. neither yes nor No
but when every TM accepts x, we can say that "yes,x is accepted by all TMs"
we are able to say "yes" for yes cases, but unable to say "No" when any TM doesnt halt on x . so recursively ennumerable but not recursive