Words Containing: D,E,C,I,D,U,A,L

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

• something additional of the same kind

• a copy that corresponds to an original exactly

• identically copied from an original

• being two identical

• make or do or perform again

• duplicate or match

• make a duplicate or duplicates of

• increase twofold

• one part in twelve equal parts

• based on twelve

• make sour or more sour

• make clear and (more) comprehensible

• make free from confusion or ambiguity; make clear