Undecidability

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
Property of a decision problem indicating that there is no algorithm, in the chosen model of computation, that always halts and correctly decides membership for every input instance.