Turing machine visits state Q for some input of length atmost 15, as it is going to run for atmost 15 steps.
Set of strings of length atmost 15 is finite, hence if machine visits state Q for atleast one input from this set machine halts and says yes. Otherwise no.
We got an algorithm hence it is decidable.