Undecidable has more than one meaning:

In mathematical logic:

• A decision problem is called recursively undecidable if no algorithm can decide it, such as for Turings's halting problem; see also under Decidable.
• A problem may be undecidable if it cannot be either formally proven or disproven.
• "Undecidable" is sometimes used as a synonym of "independent".