NONELEMENTARY

In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY.

Examples of nonelementary problems that are nevertheless decidable include: