<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Did Turing prove the undecidability of the halting problem? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2407.00680/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2407.00680/feed.xml" rel="self" type="application/rss+xml" /><item><title>Did Turing prove the undecidability of the halting problem? — HN submission</title><link>https://news.ycombinator.com/item?id=40853620</link><guid isPermaLink="false">urn:hackerpapers:submission:2407.00680:40853620</guid><pubDate>Tue, 02 Jul 2024 04:40:08 GMT</pubDate><description>&lt;p&gt;Did Turing prove the undecidability of the halting problem?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;81 points; 105 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2407.00680/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item></channel></rss>
