Whether a Turing Machine takes more than 481 steps on input epsilon ?
If u will carefully think ,then it is saying that after finite (481 steps) steps .Then we are able run run turing machine exactly 481 times and says that whether it will take epsilon or not so it is decidable problem.
But Emptiness problem always Undecidable with respect to turing machine always remember.