According to the Rice's Theorem, any non-trivial property of the language recognized by a Turing Machine is:
Show Hint
Rice's Theorem only applies to properties of the Language. Properties of the Machine itself (like "Does the TM have 5 states?") are actually decidable.