Lesson plan
ELEMENTARY
In computational complexity theory, the complexity class \mathsf{ELEMENTARY} 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 \mathsf{ELEMENTARY} . The time hierarchy theorem implies that \mathsf{ELEMENTARY} has no complete problems. Problems outside of \mathsf{ELEMENTARY} are the nonelementary problems.
Article summary
In computational complexity theory, the complexity class \mathsf{ELEMENTARY} 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 \mathsf{ELEMENTARY} . The time hierarchy theorem implies that \mathsf{ELEMENTARY} has no complete problems. Problems outside of \mathsf{ELEMENTARY} are the nonelementary problems.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.