Blum's speedup theorem showing unclassifiable complexity languages?
If a language is decidable then it is accepted by some Turing machine. The running time of that Turing machine is by definition time-constructible. So any computable function has a time-constructible upper bound by definition.