Undecidability: writing a symbol on Turing Machine's tape
First take a Arbitrary Turing Machine M and modify it so that on stopping state it will first write a new symbol $\phi$ that it won't write at any other time.

If you can decide that Machine M' will write that symbol then you can decide whether machine M halted.