In computational complexity theory, a nonelementary problem[1] is a problem that is not a member of the class ELEMENTARY.
As a class it is sometimes denoted as NONELEMENTARY.
Examples of nonelementary problems that are nevertheless decidable include:
This theoretical computer science–related article is a stub.
You can help Wikipedia by expanding it.