A decidable characterization of the classes between lintime and exptime

A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recursive hierarchies, is constructive and decidable. By counting the nesting levels of these schemes, an ordinal is assigned to each program. This yields a hierarchy Tα (α < ωω) that singles-out the complexity classes DTIMEF(ncn d+e) for all c, d, e ≥ 0.