[FOM] Learnability

[Victor Marek]

During a routine perusal of the site RealClearScience.com, I read the piece
about the article "Learnability can be undecidable", by S. Ben-David, P. Hrubes
et.al. The piece is published in the journal Nature Machine Intelligence.
In that paper the authors appear to show that certain aspect of machine learning
(pretty practical task) is equivalent (in ZFC) to Continuum Hypothesis which
is (as we know since P.J. Cohen) undecidable in ZFC.

I never did Machine Learning, and this appears to be absolutely incredible.
The piece in RealClearScience is a product of a science writer, not necessarily
knowing what s/he is talking about.

Obviously, the matter is relevant to F.O.M. Could someone in the community make
this matter clearer for pedestrians such as I?

Thanks,

		Victor Marek
Victor W. Marek                                 Department of Computer Science
marek at cs.uky.edu                                        University of Kentucky
marek at cs.engr.uky.edu                                 Lexington, KY 40506-0633
859-257-3496 (office)                                     859-257-3961 (Dept)
http://www.cs.uky.edu/~marek                              859-257-1505 (FAX)