Decidability of a Turing machine which always halts in at most ten steps
Consider the following hint:

If $M$ is a TM, and it is given an input of length $12$ (for example), but you only allow $M$ to operate for $10$ steps, 
what can it do with the input?