i think you're alluding to an interesting question: in what cases does this "undecidability of learnability" result apply? the paper seems to talk about binary

i think you're alluding to an interesting question: in what cases does this "undecidability of learnability" result apply? the paper seems to talk about binary classifiers `h : X --> {0, 1}`, where each classifier h belongs to some family `F` of functions subseteq `{h : X --> {0, 1}}`, and where observed samples are drawn from some unknown distribution P over X. so, it probably depends upon the choice of `X` and `F`, but i dont have enough of a handle on the theory to understand this.