A resource-free characterization of some complexity classes is given by means of the predicative recursion and constructive diagonal- ization schemes, and of restrictions to substitution. Among other classes, we predicatively harmonize in the same hierarchy PTIMEF,
the class ε of the elementary functions, and classes DTIMESPACEF(n
p
,n
q
).
Keywords time-space classes - implicit computational complexity - elementary functions