Turing machine that checks whether a given string is an output of a given machine and input
No, in fact any non-trivial semantic property of Turing machines is undecidable. This result is Rice's theorem.