On the complexity of the $\mathscr E^2$ Grzegorczyk class

We define several abstract computing devices which allow us to characterise the $\mathscr E^2$ class of the Grzegorczyk hierarchy. For each of these devices, we estimate the time needed to compute functions of the class $\mathscr E^2$.