<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learnability Can Be Independent of ZFC Axioms: Explanations and Implications · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1909.08410/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1909.08410/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learnability Can Be Independent of ZFC Axioms: Explanations and Implications — HN submission</title><link>https://news.ycombinator.com/item?id=49007918</link><guid isPermaLink="false">urn:hackerpapers:submission:1909.08410:49007918</guid><pubDate>Wed, 22 Jul 2026 15:02:26 GMT</pubDate><description>&lt;p&gt;Learnability Can Be Independent of ZFC Axioms (2019)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1909.08410/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learnability Can Be Independent of ZFC Axioms: Explanations and Implications — mentioned by jsrozner</title><link>https://news.ycombinator.com/item?id=48970800</link><guid isPermaLink="false">urn:hackerpapers:mention:1909.08410:48970800</guid><pubDate>Sun, 19 Jul 2026 19:00:16 GMT</pubDate><description>&lt;p&gt;Has anyone here actually looked at the Shai Ben David (SBD) result? I did a final grad project on it recently for a class on incompleteness. In my view it&amp;#x27;s not really that interesting. For learnability to be undecidable, the cardinality of the continuum (size of the reals) must exceed \aleph_k for all finite k. ZFC does not bear upon this (CH is independent of ZFC), so this is a possible setting of the world, and therefore learnability can be undecidable. But say the size of the continuum is, e.g., \aleph_3, (in this case CH is false, but it&amp;#x27;s not &amp;quot;horribly false&amp;quot;), then SBD shows how to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1909.08410/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
