Hart, K. P. Machine learning and the continuum hypothesis. (English) Zbl 1446.03085 Nieuw Arch. Wiskd. (5) 20, No. 3, 214-217 (2019). Summary: In January 2019 the journal Nature reported on an exciting development in Machine Learning: the very first issue of the journal Nature Machine Intelligence contains a paper that describes a learning problem whose solvability is neither provable nor refutable on the basis of the standard ZFC axioms of Set Theory. In this note K. P. Hart describes what the fuss is all about and indicates that maybe the problem is not so undecidabie after all. Cited in 1 Document MSC: 03E50 Continuum hypothesis and Martin’s axiom 03E10 Ordinal and cardinal numbers 03D35 Undecidability and degrees of sets of sentences 68V15 Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) PDFBibTeX XMLCite \textit{K. P. Hart}, Nieuw Arch. Wiskd. (5) 20, No. 3, 214--217 (2019; Zbl 1446.03085) Full Text: arXiv