If a language L is decidable, does that imply that the is a computable function f such that L is in O(f(n)) ?

For example what would be the complexity class of the language of "provably halting turring machines that halt in an even number of steps"