It is an idea that dates back to Demmel, 1987 that the condition number of a problem is often related to the distance to the closest ill-posed problems. In Section 3 of the above paper, the author cites as examples linear systems/matrix inversion (1/condition number = relative distance to the closest singular matrix), polynomial root-finding, and eigenvalue calculation (1/condition number = relative distance to the closest problem with double roots).
Can the condition number of least-squares problems $\min \|Ax-b\|$ be interpreted in the same sense?
The first idea that comes to mind is considering 'ill-posed problems' as those with solution $x=0$ and those in which $A$ does not have full column rank, but in this case I cannot make much sense of the $\kappa(A)^2$ that appears in the formulas.