Lesson plan

Nonelementary problem

In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY. As a class it is sometimes denoted as NONELEMENTARY. That is, it includes all decision problems that has no algorithmic solution with time bounded by an elementary recursive function. These functions grow no faster than a fixed-height tower of exponentiation (for example, O(2^{2^n}) ). Not all primitive recursive functions are elementary; for example, tetration grows too rapidly to be included in the elementary class. The hierarchy of decidable problems beyond the elementary is usually presented along the fast-growing hierarchy. Let the functions of the hierarchy be F_0, F_1, \dots, F_\omega, F_{\omega+1}, \dots . For each ordinal \alpha , we define the class \mathcal F_\alpha to be the class of functions computable in time F_\alpha^{(k)}(n) , for some positive constant k . Here, the notation F^{(k)} indicates function iteration: it is the function obtained by applying F repeatedly, k times. That is, \mathcal F_\alpha := \bigcup_{k = 1}^\infty \mathsf{FDTIME}(F_\alpha^{(k)}(n)) Now, define \mathsf{F}_\alpha to be the complexity class \bigcup_{\beta . With the definition, we have * ELEMENTARY: the class of problems decidable in time f(n) , where f(n) is a fixed-height exponential tower function.…

Back to article

Article summary

In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY. As a class it is sometimes denoted as NONELEMENTARY. That is, it includes all decision problems that has no algorithmic solution with time bounded by an elementary recursive function. These functions grow no faster than a fixed-height tower of exponentiation (for example, O(2^{2^n}) ). Not all primitive recursive functions are elementary; for example, tetration grows too rapidly to be included in the elementary class. The hierarchy of decidable problems beyond the elementary is usually presented along the fast-growing hierarchy. Let the functions of the hierarchy be F_0, F_1, \dots, F_\omega, F_{\omega+1}, \dots . For each ordinal \alpha , we define the class \mathcal F_\alpha to be the class of functions computable in time F_\alpha^{(k)}(n) , for some positive constant k . Here, the notation F^{(k)} indicates function iteration: it is the function obtained by applying F repeatedly, k times. That is, \mathcal F_\alpha := \bigcup_{k = 1}^\infty \mathsf{FDTIME}(F_\alpha^{(k)}(n)) Now, define \mathsf{F}_\alpha to be the complexity class \bigcup_{\beta . With the definition, we have * ELEMENTARY: the class of problems decidable in time f(n) , where f(n) is a fixed-height exponential tower function.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. 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.