ELEMENTARY
≈ 4 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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
edit edit sourceThe most quickly-growing elementary recursive functions are obtained by iterating an exponential function such as 2n for a bounded number k of iterations, 222⋅⋅⋅n}k times.
Thus, 𝖤𝖫𝖤𝖬𝖤𝖭𝖳𝖠𝖱𝖸 is the union of the classes
𝖤𝖫𝖤𝖬𝖤𝖭𝖳𝖠𝖱𝖸=⋃k∈ℕk-𝖤𝖷𝖯=𝖣𝖳𝖨𝖬𝖤(2n)∪𝖣𝖳𝖨𝖬𝖤(22n)∪𝖣𝖳𝖨𝖬𝖤(222n)∪⋯. It is sometimes described as iterated exponential time,[1] though this term more commonly refers to time bounded by the tetration function.[2]
Characterizations
edit edit sourceIterated stack automata
edit edit sourceThis 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.[3]
Higher-order logic
edit edit sourceIn 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, 𝖭𝖳𝖨𝖬𝖤(22⋯2O(n))=∃𝖧𝖮i, where ⋯ indicates a tower of i exponentiations and ∃𝖧𝖮i is the class of queries that begin with existential quantifiers of ith order and then a formula of (i − 1)th order.[4]
Notes
edit edit source- ^ "ELEMENTARY", Complexity Zoo, retrieved 2025-07-31
- ^ Friedman 1999.
- ^ Engelfriet 1991.
- ^ Hella & Turull-Torres 2006.
References
edit edit source- Engelfriet, Joost (1991), "Iterated stack automata and complexity classes", Information and Computation, 95 (1): 21–75, doi:10.1016/0890-5401(91)90015-T, MR 1133778
- Friedman, Harvey (1999), "Some decision problems of enormous complexity" (PDF), 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, {IEEE} Computer Society, pp. 2–12, doi:10.1109/LICS.1999.782577, ISBN 0-7695-0158-3, MR 1942515
- Hella, Lauri; Turull-Torres, José María (2006), "Computing queries with higher-order logics", Theoretical Computer Science, 355 (2): 197–214, doi:10.1016/j.tcs.2006.01.009, ISSN 0304-3975
Text derived from https://en.wikipedia.org/w/index.php?oldid=1371839387 under CC BY-SA 4.0; modifications have been made.