[28] Show that there is a computably enumerable infinite sequence and some (incomputably) large time bound T such that for every total computable time

[28] Show that there is a computably enumerable infinite sequence χ and some (incomputably) large time bound T such that for every total computable time bound t, for each initial segment x of χ, Et 3(x, ) > ct2ET 3 (x,)/2, where ct > 0 is a constant depending only on t and χ.