I see a sentence in one final exam on automaton course.
I have one problem: if we want to have a TM that halts for all word in L, it's enough to have L be R.E? or we should have R be R.E and Complement of R be R.E?
Note: (Recursive Enumerable = R.E).