Are run time bounds in P decidable when the problem is promised that an input program must halt?
Given a Turing machine $T$, construct a new Turing machine $T'$ which, in input of length $n$, simulates $T$ for up to $n$ steps. If $T$ halts then $T'$ also halts, and otherwise $T$ counts up to $2^n$ and then halts.