## Ranking primitive recursions: The low grzegorczyk classes revisited (1998)

Venue: | SIAM Journal of Computing |

Citations: | 10 - 1 self |

### BibTeX

@ARTICLE{Bellantoni98rankingprimitive,

author = {Stephen J. Bellantoni and Karl-heinz Niggl},

title = {Ranking primitive recursions: The low grzegorczyk classes revisited},

journal = {SIAM Journal of Computing},

year = {1998},

volume = {29},

pages = {401--415}

}

### OpenURL

### Abstract

Abstract. Traditional results in subrecursion theory are integrated with the recent work in “predicative recursion ” by defining a simple ranking ρ of all primitive recursive functions. The hierarchy defined by this ranking coincides with the Grzegorczyk hierarchy at and above the linearspace level. Thus, the result is like an extension of the Schwichtenberg/Müller theorems. When primitive recursion is replaced by recursion on notation, the same series of classes is obtained except with the polynomial time computable functions at the first level.

### Citations

397 | LCF considered as a programming language - Plotkin - 1977 |

179 | A new recursion-theoretic characterization of the poly-time functions
- Bellantoni, Cook
- 1992
(Show Context)
Citation Context ...recursion, some of these function classes were later characterized by restricting the way in which values can be accessed during the recursion. These latter schemes are called “predicative recursion” =-=[4]-=- or “ramified recurrence” [11] schemes; the phrase “safe recursion” has also been used. Taking the predicative viewpoint, one has two types of values: values which are known in their entirety and whic... |

150 |
The intrinsic computational difficulty of functions
- Cobham
- 1964
(Show Context)
Citation Context ...sion of these theorems. Theorem 2.1 (Schwichtenberg [23], Müller [15]). For r ≥ 2, E r+1 = D r . Theorem 2.2 (Ritchie [22]). E 2 consists of the linear-space computable functions. Theorem 2.3 (Cobham =-=[7]-=-). The polynomial-time computable functions are exactly those in the class obtained from the initial functions 0, π n i , s0x = 2x, s1x = 2x + 1, and x#y ≡ 2 |x|·|y| using composition and the rule of ... |

57 |
Ramified recurrence and computational complexity I: Word recurrence and poly-time
- Leivant
- 1994
(Show Context)
Citation Context ...tion classes were later characterized by restricting the way in which values can be accessed during the recursion. These latter schemes are called “predicative recursion” [4] or “ramified recurrence” =-=[11]-=- schemes; the phrase “safe recursion” has also been used. Taking the predicative viewpoint, one has two types of values: values which are known in their entirety and which therefore can be examined co... |

45 | Predicative Recursion and Computational Complexity
- Bellantoni
- 1992
(Show Context)
Citation Context ...to ρ. The set of derivations f such that ρ(f) = 1, are derivations of all the fptime functions. A linear-space characterization similar to the current one was first proved by the author in his thesis =-=[3]-=-, p. 49, at the suggestion of S. Cook; and related linear-space results were proved independently by Handley [9] and Leivant [11]. The characterization was adapted and reproved by Nguyen [18] in her w... |

42 |
Some classes of recursive functions
- Grzegorczyk
- 1953
(Show Context)
Citation Context ...those in the class obtained from the initial functions 0, π n i , s0x = 2x, s1x = 2x + 1, and x#y ≡ 2 |x|·|y| using composition and the rule of bounded recursion on notation. Theorem 2.4 (Grzegorczyk =-=[8]-=-). E 3 consists of the Kalmar elementary functions. 3. Ranking Recursions. The development begins by defining function classes PR1 and PR2. Let I1 consist of the initial functions: constant 0; success... |

38 |
Classes of predictably computable functions
- Ritchie
- 1963
(Show Context)
Citation Context ...ctions. Like deg , the ranking ρ characterizes the Grzegorczyk hierarchy at and above the elementary level; but at level 1 it characterizes the linear-space computable functions – by Ritchie’s result =-=[22]-=-, this is E 2 . Thus, E r+1 = PR r 1 for r ≥ 1, where PR r 1 consists of the primitive recursive derivations with rank at most r. In this sense, the result is like an extension of the Schwichtenberg/M... |

37 | Computation models and function algebras
- Clote
- 1999
(Show Context)
Citation Context ... AMS subject classifications. 03D20, 68Q15, 03D15 1. Introduction. A variety of restricted recursion schemes have been successfully used to characterize some common complexity classes; see e.g. Clote =-=[6]-=- for a survey. At first characterized using explicit bounds on the value computed by a recursion, some of these function classes were later characterized by restricting the way in which values can be ... |

37 |
Stratified Functional Programs and Computational Complexity
- Leivant
- 1993
(Show Context)
Citation Context ...oved by Nguyen [18] in her work on linear space reasoning. The current characterizations of E r+1 can also be compared to Leivant’s characterization of Grzegorczyk classes using “coerced recurrence”, =-=[12]-=- §4. Coerced recurrence seems to be more powerful than stratified recurrence. To restrict it, Leivant uses an approach similar to Parson’s earlier definition [20] p. 358: one separately determines whe... |

22 |
Predicative recursion and the polytime hierarchy
- Bellantoni
- 1995
(Show Context)
Citation Context ...and does not determine whether or not the step function uses the critical term. “Predicative recursion” results for some other space-bounded complexity classes are available (Oitavem [19]; Bellantoni =-=[2]-=-; Leivant & Marion [13]; Bloch [5]) In respect of parallel complexity classes, current results using unbounded recursion schemes (Bloch [5]; Leivant & Marion [13]; Bellantoni [3] p. 69 and [2]) are ei... |

21 |
Ramified recurrence and computational complexity II: Substitution and poly-space
- Leivant, Marion
- 1994
(Show Context)
Citation Context ... whether or not the step function uses the critical term. “Predicative recursion” results for some other space-bounded complexity classes are available (Oitavem [19]; Bellantoni [2]; Leivant & Marion =-=[13]-=-; Bloch [5]) In respect of parallel complexity classes, current results using unbounded recursion schemes (Bloch [5]; Leivant & Marion [13]; Bellantoni [3] p. 69 and [2]) are either unable to characte... |

14 | Function-algebraic characterizations of log and polylog parallel time - Bloch - 1994 |

9 |
Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity
- Leivant
- 1999
(Show Context)
Citation Context ...rank locates the Kalmar functions above the linear-space functions in a hierarchy.sRanking Primitive Recursions 7 The Kalmar functions were given a resource-free recursive characterization by Leivant =-=[14]-=- using higher-type recurrence. The present results do not use higher type recursion. This work extends the polynomial-time characterization of Bellantoni & Cook [4]. That result is listed above, but i... |

8 |
Rekursionszahlen und die Grzegorczyk-Hierarchie. Archiv fur mathematische Logik und Grundlagenforschung, 12:85{97
- Schwichtenberg
- 1969
(Show Context)
Citation Context ...entary functions: E r+1 = D r for r ≥ 2, where D r are the primitive recursive derivations with degree at most r. As discussed by Clote [6], the characterization for r ≥ 3 was shown by Schwichtenberg =-=[23]-=-, and later the case of r = 2 was shown by Müller [15]. Another possible classification was given prior to Müller’s result by Parsons [20], who referred to whether or not the step function (i.e. the f... |

7 |
The µ-measure as a tool for classifying computational complexity
- Niggl
(Show Context)
Citation Context ...st level, when primitive recursion is replaced with recursion on notation. In fact, E r+1 = PR r 2 for r ≥ 2, but PR 1 2 characterizes the polynomial time computable functions. The µ measure of Niggl =-=[17]-=-, a slight modification of [16], provides similar characterisations of the complexity classes discussed here with respect to classes R n 1 and R n 2 . The former are based on primitive recursion, the ... |

5 |
New Recursive Characterizations of the Elementary Functions and the Functions Computable in Polynomial Space. Revista Mathematica de la Universidad Complutense de
- Oitavem
- 1997
(Show Context)
Citation Context ...R1. The equivalence of PR1 and D is obtained by straightforward simulations. For example, the projection functions are computed in PR1 by the full composition πi(�x) = C(0, C(xi, xi, xi), 0). Oitavem =-=[19]-=- has shown that the Kalmar functions are obtained by adding s0 as an initial function to the definition of PR 1 1. In the current work, extra rank is used instead: the Kalmar functions are shown to eq... |

4 | Ranking Arithmetic Proofs by Implicit Ramification
- Bellantoni
- 1998
(Show Context)
Citation Context ...es the natural derivation of multiplication as level 1, and exponentiation as level 2. A parallel of these developments can be carried out in the setting of formal logic. This paper is a companion to =-=[1]-=-, which shows how to define weak subsystems of arithmetic by defining the “rank” of proofs instead of by bounding the induction formulas. Rank r functions turn out to be exactly those having a rank r ... |

3 |
Bellantoni and Cook's Characterization of Polynomial Time Functions", typescript
- Handley
- 1992
(Show Context)
Citation Context ...haracterization similar to the current one was first proved by the author in his thesis [3], p. 49, at the suggestion of S. Cook; and related linear-space results were proved independently by Handley =-=[9]-=- and Leivant [11]. The characterization was adapted and reproved by Nguyen [18] in her work on linear space reasoning. The current characterizations of E r+1 can also be compared to Leivant’s characte... |

3 |
Klassifizierungen der primitiv rekursiven Funktionen
- Müller
- 1974
(Show Context)
Citation Context ... the primitive recursive derivations with degree at most r. As discussed by Clote [6], the characterization for r ≥ 3 was shown by Schwichtenberg [23], and later the case of r = 2 was shown by Müller =-=[15]-=-. Another possible classification was given prior to Müller’s result by Parsons [20], who referred to whether or not the step function (i.e. the function h in f(x + 1) = h(x, f(x))) accesses the criti... |

3 |
Hierarchies of primitive recursive functions. Zeitschrift f. math. Logik und Grundlagen d
- Parsons
- 1968
(Show Context)
Citation Context ...], the characterization for r ≥ 3 was shown by Schwichtenberg [23], and later the case of r = 2 was shown by Müller [15]. Another possible classification was given prior to Müller’s result by Parsons =-=[20]-=-, who referred to whether or not the step function (i.e. the function h in f(x + 1) = h(x, f(x))) accesses the critical value. This result also characterized the Grzegorczyk hierarchy at the elementar... |

2 |
A Formal System For Linear-Space Reasoning
- Nguyen
- 1993
(Show Context)
Citation Context ...is thesis [3], p. 49, at the suggestion of S. Cook; and related linear-space results were proved independently by Handley [9] and Leivant [11]. The characterization was adapted and reproved by Nguyen =-=[18]-=- in her work on linear space reasoning. The current characterizations of E r+1 can also be compared to Leivant’s characterization of Grzegorczyk classes using “coerced recurrence”, [12] §4. Coerced re... |

1 |
Towards the computational complexity of PR ω terms
- Niggl
- 1995
(Show Context)
Citation Context ...ion is replaced with recursion on notation. In fact, E r+1 = PR r 2 for r ≥ 2, but PR 1 2 characterizes the polynomial time computable functions. The µ measure of Niggl [17], a slight modification of =-=[16]-=-, provides similar characterisations of the complexity classes discussed here with respect to classes R n 1 and R n 2 . The former are based on primitive recursion, the latter on recursion on notation... |