A common problem that arises in software debugging is determining the condition under which a particular error message might be printed. The analogous problem for TMs would be to determine if a particular symbol is ever written to the tape. Prove by reduction that Lsym the set of pairs (T.s) where T is a Turing machine and s is a symbol that is written by T on some input, is not recursive