Do any of Blum's theorems prove that there exist decidable languages that are unclassifiable anywhere in the time hierarchy? In other words, asserting they (mentioned in the proofs) are computable within any time $O(f(n))$ for some time-constructable function $f(n)$ leads to a contradiction?
Blum's speedup theorem showing unclassifiable complexity languages?
complexity theory