11-Letter Words Containing: U,N,D,L,E,D,_,_

• by a factor of one hundred

• in an unadvised manner

• without doubt; certainly

• not scheduled or not on a regular schedule

• not developed, mature, or fully formulated

• not developed, improved, exploited or used

• act (a role) with great restraint

• play a card lower than (a held high card)

• 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.)