Machine learning and the Continuum Hypothesis
Klaas Pieter Hart (TU Delft - Analysis)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
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 undecidable after all.