<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Python Type Hints are Turing Complete · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2208.14755/</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/2208.14755/feed.xml" rel="self" type="application/rss+xml" /><item><title>Python Type Hints are Turing Complete — mentioned by bhouston</title><link>https://news.ycombinator.com/item?id=37555894</link><guid isPermaLink="false">urn:hackerpapers:mention:2208.14755:37555894</guid><pubDate>Mon, 18 Sep 2023 13:34:50 GMT</pubDate><description>&lt;p&gt;&amp;gt; Rust’s type system ended up being Turing-complete anyway. It seems like it fell into the same trap as C++ templates: it’s an accidental programming language in a programming language, but with way worse syntax. Most anything in software can easily end up Turing-complete though. It isn&amp;#x27;t that high of a bar unfortunately. I think most mature type and template systems end up as Turing-complete. To single out Rust for this is to ignore that this is just standard fare for mature typing systems. TypeScript&amp;#x27;s types are Turing complete: https://github.com/microsoft/TypeScript/issues/14833 Python&amp;#x27;s…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2208.14755/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Python Type Hints are Turing Complete — mentioned by aw1621107</title><link>https://news.ycombinator.com/item?id=35146840</link><guid isPermaLink="false">urn:hackerpapers:mention:2208.14755:35146840</guid><pubDate>Tue, 14 Mar 2023 03:01:34 GMT</pubDate><description>&lt;p&gt;&amp;gt; even though C++ has a significantly more complex type system (it&amp;#x27;s type system is TC) For what it&amp;#x27;s worth, Python&amp;#x27;s type hints are also Turing complete (https://arxiv.org/abs/2208.14755, discussed on HN at https://news.ycombinator.com/item?id=32779296)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2208.14755/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Python Type Hints are Turing Complete — mentioned by w-m</title><link>https://news.ycombinator.com/item?id=32779570</link><guid isPermaLink="false">urn:hackerpapers:mention:2208.14755:32779570</guid><pubDate>Fri, 09 Sep 2022 14:19:50 GMT</pubDate><description>&lt;p&gt;Here&amp;#x27;s the article rendered as html: https://ar5iv.labs.arxiv.org/html/2208.14755 (Replace the x in arxiv.org with a 5 to get there. I feel like it&amp;#x27;s working well enough in most cases, when will they start linking these from the actual arxiv article pages?)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2208.14755/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Python Type Hints are Turing Complete — HN submission</title><link>https://news.ycombinator.com/item?id=32779296</link><guid isPermaLink="false">urn:hackerpapers:submission:2208.14755:32779296</guid><pubDate>Fri, 09 Sep 2022 13:56:55 GMT</pubDate><description>&lt;p&gt;Python type hints are Turing complete&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;246 points; 135 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2208.14755/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Python Type Hints are Turing Complete — HN submission</title><link>https://news.ycombinator.com/item?id=32733861</link><guid isPermaLink="false">urn:hackerpapers:submission:2208.14755:32733861</guid><pubDate>Tue, 06 Sep 2022 07:00:23 GMT</pubDate><description>&lt;p&gt;Python Type Hints Are 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/2208.14755/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Python Type Hints are Turing Complete — mentioned by belter</title><link>https://news.ycombinator.com/item?id=32698114</link><guid isPermaLink="false">urn:hackerpapers:mention:2208.14755:32698114</guid><pubDate>Sat, 03 Sep 2022 02:39:18 GMT</pubDate><description>&lt;p&gt;&amp;quot;...We apply Grigore’s algorithm to Python type hints and deduce that they are Turing complete. In addition, we present an alternative reduction in which the Turing machines are simulated in real time, resulting in significantly lower compilation times...&amp;quot; [PDF] - https://arxiv.org/pdf/2208.14755.pdf &amp;quot;OriRoth/python-typing-machines: Python Typing Machines 1.0&amp;quot; - https://zenodo.org/record/7004898&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2208.14755/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Python Type Hints are Turing Complete — HN submission</title><link>https://news.ycombinator.com/item?id=32698113</link><guid isPermaLink="false">urn:hackerpapers:submission:2208.14755:32698113</guid><pubDate>Sat, 03 Sep 2022 02:39:18 GMT</pubDate><description>&lt;p&gt;Python Type Hints Are Turing Complete&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2208.14755/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
