ELEMENTARY

Template:About Template:Use dmy dates Template:CS1 config In computational complexity theory, the complexity class $𝖤𝖫𝖤𝖬𝖤𝖭𝖳𝖠𝖱𝖸$ consists of the decision problems that can be solved in time bounded by an elementary recursive function. Equivalently, these are the problems that can be solved in time bounded by an iterated exponential function with a bounded number of iterations.

Every elementary recursive function can be computed in a time bound of this form, and therefore every decision problem whose calculation uses only elementary recursive functions belongs to the complexity class $𝖤𝖫𝖤𝖬𝖤𝖭𝖳𝖠𝖱𝖸$.

The time hierarchy theorem implies that $𝖤𝖫𝖤𝖬𝖤𝖭𝖳𝖠𝖱𝖸$ has no complete problems. Problems outside of $𝖤𝖫𝖤𝖬𝖤𝖭𝖳𝖠𝖱𝖸$ are the nonelementary problems.

Definition

The most quickly-growing elementary recursive functions are obtained by iterating an exponential function such as $2^n$ for a bounded number $k$ of iterations, $$\begin{array}{c}{2}^{2^{2^{{\cdot }^{{\cdot }^{{\cdot }^n}}}}}\end{array}\}k\text{ times}.$$

Thus, $𝖤𝖫𝖤𝖬𝖤𝖭𝖳𝖠𝖱𝖸$ is the union of the classes

$$\begin{array}{cc}𝖤𝖫𝖤𝖬𝖤𝖭𝖳𝖠𝖱𝖸& =\bigcup _{k\in \mathbb{N}}k\text{-}𝖤𝖷𝖯\\ & =𝖣𝖳𝖨𝖬𝖤\left(2^n\right)\cup 𝖣𝖳𝖨𝖬𝖤\left(2^{2^n}\right)\cup 𝖣𝖳𝖨𝖬𝖤\left(2^{2^{2^n}}\right)\cup \cdots .\end{array}$$ It is sometimes described as iterated exponential time, though this term more commonly refers to time bounded by the tetration function.Template:Sfn

Characterizations

Iterated stack automata

This complexity class can be characterized by a certain class of "iterated stack automata", pushdown automata that can store the entire state of a lower-order iterated stack automaton in each cell of their stack. These automata can compute every language in $𝖤𝖫𝖤𝖬𝖤𝖭𝖳𝖠𝖱𝖸$, and cannot compute languages beyond this complexity class.Template:Sfn

Higher-order logic

In descriptive complexity theory, ELEMENTARY is equal to the class HO of languages that can be described by a formula of higher-order logic. This means that every language in the ELEMENTARY complexity class corresponds to as a higher-order formula that is true for, and only for, the elements on the language. More precisely, $𝖭𝖳𝖨𝖬𝖤\left(2^{2^{\cdots 2^{O(n)}}}\right)=\mathrm{\exists }{𝖧𝖮}^i$, where ⋯ indicates a tower of Template:Mvar exponentiations and $\mathrm{\exists }{𝖧𝖮}^i$ is the class of queries that begin with existential quantifiers of Template:Mvarth order and then a formula of Template:Mathth order.Template:Sfn

References

• Template:Citation
• Template:Citation
• Template:Citation