Undecidability refers to the state of a problem for which no algorithm can ever provide a correct 'yes' or 'no' answer for all possible inputs. Such problems lie beyond the limits of computability, signifying inherent theoretical boundaries to what can be solved systematically.