<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Braid is undecidable · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1412.0784/</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/1412.0784/feed.xml" rel="self" type="application/rss+xml" /><item><title>Braid is undecidable — mentioned by jamesmiller5</title><link>https://news.ycombinator.com/item?id=10320142</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0784:10320142</guid><pubDate>Fri, 02 Oct 2015 17:58:20 GMT</pubDate><description>&lt;p&gt;If you didn&amp;#x27;t catch it in the article, it links to a proof of Braid the game&amp;#x27;s undecidability without use of it&amp;#x27;s time mechanics. http://arxiv.org/abs/1412.0784 I&amp;#x27;d guess Super Mario Maker could be similar if monsters can infinitely spawn, be destroyed and interact with one another, skimming the paper it looks like a requirement.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0784/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item><item><title>Braid is undecidable — HN submission</title><link>https://news.ycombinator.com/item?id=10319679</link><guid isPermaLink="false">urn:hackerpapers:submission:1412.0784:10319679</guid><pubDate>Fri, 02 Oct 2015 16:53:38 GMT</pubDate><description>&lt;p&gt;Braid is Turing Complete&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/1412.0784/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item><item><title>Braid is undecidable — mentioned by Sniffnoy</title><link>https://news.ycombinator.com/item?id=9648474</link><guid isPermaLink="false">urn:hackerpapers:mention:1412.0784:9648474</guid><pubDate>Tue, 02 Jun 2015 19:49:43 GMT</pubDate><description>&lt;p&gt;A note -- if you&amp;#x27;re linking to arXiv, it&amp;#x27;s better to link to the abstract (http://arxiv.org/abs/1412.0784) rather than directly to the PDF. From the abstract, one can easily click through to the PDF; not so the reverse. And the abstract allows one to do things like see different versions of the paper, search for other things by the same authors, etc. Thank you!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1412.0784/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item><item><title>Braid is undecidable — HN submission</title><link>https://news.ycombinator.com/item?id=9645845</link><guid isPermaLink="false">urn:hackerpapers:submission:1412.0784:9645845</guid><pubDate>Tue, 02 Jun 2015 13:58:02 GMT</pubDate><description>&lt;p&gt;Braid is undecidable (2014) [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;136 points; 30 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1412.0784/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item></channel></rss>
