Nonelementary problem
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:
英汉双解词典包含3607232条英汉词条,基本涵盖了全部常用单词的翻译及用法,是英语学习的有利工具。