# Decidability of a language of Turing Machine descriptions [duplicate]

Given the language

$\{ <M> \mid\:$ M is a Turing machine and there is some w ∈ Σ* for which the computation M(w) takes more than 10 transitions$\}$

How can one prove that this language is decidable?