11-Letter Words Containing: E,D,U,C,I,B,L,E

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

• acceptable as a deduction (especially as a tax deduction)

• (taxes) an amount that can be deducted (especially for the purposes of calculating income tax)

• a clause in an insurance policy that relieves the insurer of responsibility to pay the initial loss up to a stated amount

• having two nuclei

• incapable of being made smaller or simpler