Date: 13 May 2010 11:49
Number of posts: 3
RSS: New posts
by defenition, if M is a T.M that accepts L, then for any word in L M must accept, and for any word who isn't in L, M must either reject of loop. Take any language different from L, let's say L'. L' contains a word w which isn't in L. M must reject it or loop on it.
(I would wait for the staff's approval though :) )