Question is the following language decidable:
{(M)|given input "aaaaa" Turing machine M will perform at least 1295 steps}
I would say, yes it is. Just let the Universal Turing Machine count each step, and accept if it reaches step 1295.
But is this not a case where Rice´s theorem applies? Which means that we cannot decide such a property?