Words Containing: B,A,N,L,I,E,U,E

• not equitable or fair

• not easily excited

• not capable of being precisely or readily described; not easily put into words

• Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included.

• (of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)

• having two nuclei

• too numerous to be counted

• not capable of being carried out or put into practice

• impossible to avoid or evade

• impossible to surmount

• incapable of being surmounted or excelled