A common problem that arises in software debugging is determining the condition under which a particular error message might be printed The analogeus prelkem to er witen t the sape 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