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 denotes as NONELEMENTARY.
Examples of nonelementary problems that are nevertheless decidable include: