next up previous contents
Next: Recursive Languages Up: Recursively Enumerable Languages Previous: Some r.e. languages have

TMs always halt for w in L(M)

It is important to note that L(M) will still halt for any w in L(M) -- that is the definition for the acceptance of a language by a TM.