I cannot understand how to reduce the halting problem to a property to show that is undecidable.
For example, I have this property of a Turing Machine and I have to prove if it's recursive or not:
"M eventually enters the fifth state in its rule list when executed on an empty tape"
How can I do it? Do I have to reduce it to a halting problem or vice-versa?
Thanks in advance.