Undecidable

A Decision Problem is called (recursively) undecidable if no Algorithm can decide it, such as for Turing 's Halting Problem ; see also under Decidable .

"Undecidable" is sometimes used as a synonym of " Independent ", where a formula in mathematical logic is independent of a logical theory if neither that formula nor its negation can be proved within the theory.

Information About