A predicative approach to the classification problem

Abstract

We harmonize many time-complexity classes DTIMEF(f(n)) (f(n) [ges ] n) with the PR functions (at and above the elementary level) in a transfinite hierarchy of classes of functions [Tscr ]α. Class [Tscr ]α is obtained by means of unlimited operators, namely: a variant Π of the predicative or safe recursion scheme, introduced by Leivant, and by Bellantoni and Cook, if α is a successor; and constructive diagonalization if α is a limit. Substitution (SBST) is discarded because the time complexity classes are not closed under this scheme. [Tscr ]α is a structure for the PR functions finer than [Escr ]α, to the point that we have [Tscr ]ε0 = [Escr ]3 (elementary functions). Although no explicit use is made of hierarchy functions, it is proved that f(n) ∈ [Tscr ]α implies f(n) [les ] nGα(n), where Gα belongs to the slow growing hierarchy (of functions) studied, in particular, by Girard and Wainer.

On tiered small jump operators

“…For this, they define a rank function which, roughly speaking, is a bound on the number of nested recursions. The work of Caporaso, Covino and Pani seems also related to the research presented in this paper, see [6]. We are also aware of other related works like the one of Oitavem [15] or the one of Beckmann and Weiermann [2].…”