Grzegorczyk hierarchy

The Grzegorczyk hierarchy (pronounced: [ɡʐɛˈɡɔrt͡ʂɨk]), named after the Polish logician Andrzej Grzegorczyk, is a hierarchy of functions used in computability theory (Wagner and Wechsung 1986:43). Every function in the Grzegorczyk hierarchy is a primitive recursive function, and every primitive recursive function appears in the hierarchy at some level. The hierarchy deals with the rate at which the values of the functions grow; intuitively, functions in lower level of the hierarchy grow slower than functions in the higher levels.

Definition

First we introduce an infinite set of functions, denoted E_i for some natural number i. We define $E_{0}(x,y)=x+y$ and $E_{1}(x)=x^{2}+2$ . I.e., E₀ is the addition function, and E₁ is a unary function which squares its argument and adds two. Then, for each n greater than 1, we define $E_{n}(x)=E_{{n-1}}^{{x}}(2)$ , i.e. the x-th iterate of $E_{{n-1}}$ evaluated at 2.

From these functions we define the Grzegorczyk hierarchy. ${\mathcal {E}}^{n}$ , the n-th set in the hierarchy, contains the following functions:

E_k for k < n
the zero function (Z(x) = 0);
the successor function (S(x) = x + 1);
the projection functions ( $p_{i}^{m}(t_{1},t_{2},\dots ,t_{m})=t_{i}$ );
the (generalized) compositions of functions in the set (if h, g₁, g₂, ... and g_m are in ${\mathcal {E}}^{n}$ , then $f({\bar {u}})=h(g_{1}({\bar {u}}),g_{2}({\bar {u}}),\dots ,g_{m}({\bar {u}}))$ is as well)^{[note 1]}; and
the results of limited (primitive) recursion applied to functions in the set, (if g, h and j are in ${\mathcal {E}}^{n}$ and $f(t,{\bar {u}})\leq j(t,{\bar {u}})$ for all t and ${\bar {u}}$ , and further $f(0,{\bar {u}})=g({\bar {u}})$ and $f(t+1,{\bar {u}})=h(t,{\bar {u}},f(t,{\bar {u}}))$ , then f is in ${\mathcal {E}}^{n}$ as well)^{[note 1]}

In other words, ${\mathcal {E}}^{n}$ is the closure of set $B_{n}=\{Z,S,(p_{i}^{m})_{{i\leq m}},E_{k}:k<n\}$ with respect to function composition and limited recursion (as defined above).

Properties

These sets clearly form the hierarchy

{\mathcal {E}}^{0}\subseteq {\mathcal {E}}^{1}\subseteq {\mathcal {E}}^{2}\subseteq \cdots

because they are closures over the $B_{n}$ 's and $B_{0}\subseteq B_{1}\subseteq B_{2}\subseteq \cdots$ .

They are strict subsets (Rose 1984; Gakwaya 1997). In other words

{\mathcal {E}}^{0}\subsetneq {\mathcal {E}}^{1}\subsetneq {\mathcal {E}}^{2}\subsetneq \cdots

because the hyper operation $H_{n}$ is in ${\mathcal {E}}^{n}$ but not in ${\mathcal {E}}^{{n-1}}$ .

${\mathcal {E}}^{0}$ includes functions such as x+1, x+2, ...
${\mathcal {E}}^{1}$ provides all addition functions, such as x+y, 4x, ...
${\mathcal {E}}^{2}$ provides all multiplication functions, such as xy, x⁴
${\mathcal {E}}^{3}$ provides all exponentiation functions, such as x^y, 2^{2^{2^x}}, and is exactly the elementary recursive functions.
${\mathcal {E}}^{4}$ provides all tetration functions, and so on.

Notably, both the function $U$ and the characteristic function of the predicate $T$ from the Kleene normal form theorem are definable in a way such that they lie at level ${\mathcal {E}}^{0}$ of the Grzegorczyk hierarchy. This implies in particular that every recursively enumerable set is enumerable by some ${\mathcal {E}}^{0}$ -function.

Relation to primitive recursive functions

The definition of ${\mathcal {E}}^{n}$ is the same as that of the primitive recursive functions, PR, except that recursion is limited ( $f(t,{\bar {u}})\leq j(t,{\bar {u}})$ for some j in ${\mathcal {E}}^{n}$ ) and the functions $(E_{k})_{{k<n}}$ are explicitly included in ${\mathcal {E}}^{n}$ . Thus the Grzegorczyk hierarchy can be seen as a way to limit the power of primitive recursion to different levels.

It is clear from this fact that all functions in any level of the Grzegorczyk hierarchy are primitive recursive functions (i.e. ${\mathcal {E}}^{n}\subseteq {\mathsf {PR}}$ ) and thus:

\bigcup _{n}{{\mathcal {E}}^{n}}\subseteq {\mathsf {PR}}

It can also be shown that all primitive recursive functions are in some level of the hierarchy (Rose 1984; Gakwaya 1997), thus

\bigcup _{n}{{\mathcal {E}}^{n}}={\mathsf {PR}}

and the sets ${\mathcal {E}}^{0},{\mathcal {E}}^{1}-{\mathcal {E}}^{0},{\mathcal {E}}^{2}-{\mathcal {E}}^{1},\dots ,{\mathcal {E}}^{n}-{\mathcal {E}}^{{n-1}},\dots$ partition the set of primitive recursive functions, PR.

Extensions

Main article: Fast-growing hierarchy

The Grzegorczyk hierarchy can be extended to transfinite ordinals. Such extensions define a fast-growing hierarchy. To do this, the generating functions $E_\alpha$ must be recursively defined for limit ordinals (note they have already been recursively defined for successor ordinals by the relation $E_{{\alpha +1}}(n)=E_{\alpha }^{n}(2)$ ). If there is a standard way of defining a fundamental sequence $\lambda_m$ , whose limit ordinal is $\lambda$ , then the generating functions can be defined $E_{\lambda }(n)=E_{{\lambda _{n}}}(n)$ . However, this definition depends upon a standard way of defining the fundamental sequence. Rose (1984) suggests a standard way for all ordinals α < ε₀.

The original extension was due to Martin Löb and Stan S. Wainer (1970) and is sometimes called the Löb–Wainer hierarchy.

Notes

1 2 Here ${\bar {u}}$ represents a tuple of inputs to f. The notation $f({\bar {u}})$ means that f takes some arbitrary number of arguments and if ${\bar {u}}=(x,y,z)$ , then $f({\bar {u}})=f(x,y,z)$ . In the notation $f(t,{\bar {u}})$ , the first argument, t, is specified explicitly and the rest as the arbitrary tuple ${\bar {u}}$ . Thus, if ${\bar {u}}=(x,y,z)$ , then $f(t,{\bar {u}})=f(t,x,y,z)$ . This notation allows composition and limited recursion to be defined for functions, f, of any number of arguments.

References

Brainerd, W.S., Landweber, L.H. (1974), Theory of Computation, Wiley, ISBN 0-471-09585-0
Cichon, E. A.; Wainer, S. S. (1983), "The slow-growing and the Grzegorczyk hierarchies", The Journal of Symbolic Logic, 48 (2): 399–408, doi:10.2307/2273557, ISSN 0022-4812, MR 704094
Gakwaya, J.–S. (1997), A survey on the Grzegorczyk Hierarchy and its Extension through the BSS Model of Computability
Grzegorczyk, A. (1953), Some classes of recursive functions, Rozprawy matematyczne, Vol 4, pp. 1–45.
Löb, M.H. and Wainer, S.S., "Hierarchies of Number Theoretic Functions I, II: A Correction," Arch. Math. Logik Grundlagenforschung 14, 1970 pp. 198–199.
Rose, H.E., "Subrecursion: Functions and hierarchies", Oxford University Press, New York, USA, 1984. ISBN 0-19-853189-3
Wagner, K. and Wechsung, G. (1986), Computational Complexity, Mathematics and its Applications v. 21. ISBN 978-90-277-2146-4

Important complexity classes (more)

Considered feasible	DLOGTIME AC⁰ ACC⁰ TC⁰ L SL RL NL NC SC CC P P-complete ZPP RP BPP BQP APX

Suspected infeasible	UP NP NP-complete NP-hard co-NP co-NP-complete AM QMA PH ⊕P PP #P #P-complete IP PSPACE PSPACE-complete

Considered infeasible	EXPTIME NEXPTIME EXPSPACE ELEMENTARY PR R RE ALL

Class hierarchies	Polynomial hierarchy Exponential hierarchy Grzegorczyk hierarchy Arithmetical hierarchy Boolean hierarchy

Families of classes	DTIME NTIME DSPACE NSPACE Probabilistically checkable proof Interactive proof system

This article is issued from Wikipedia - version of the 11/22/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.