<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Ask, and it shall be given: On the Turing completeness of prompting · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2411.01992/</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/2411.01992/feed.xml" rel="self" type="application/rss+xml" /><item><title>Ask, and it shall be given: On the Turing completeness of prompting — mentioned by ivraatiems</title><link>https://news.ycombinator.com/item?id=45805991</link><guid isPermaLink="false">urn:hackerpapers:mention:2411.01992:45805991</guid><pubDate>Tue, 04 Nov 2025 00:01:01 GMT</pubDate><description>&lt;p&gt;That doesn&amp;#x27;t seem right to me. If I understand it right, your logic is: 1. Humans intellect is Turing computable. 2. LLMs are based on Turing-complete technology. 3. Therefore, LLMs can eventually equal human intellect. But if that is the right chain of assumptions, there&amp;#x27;s lots of issues with it. First, whether LLMs are Turing complete is a topic of debate. There are points for[0] and against[1]. I suspect they probably _are_, but that doesn&amp;#x27;t mean LLMs are tautologically indistinguishable from human intelligence. Every computer that uses a Turing-complete programming language can…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2411.01992/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Ask, and it shall be given: On the Turing completeness of prompting — mentioned by zihotki</title><link>https://news.ycombinator.com/item?id=44186512</link><guid isPermaLink="false">urn:hackerpapers:mention:2411.01992:44186512</guid><pubDate>Wed, 04 Jun 2025 23:02:21 GMT</pubDate><description>&lt;p&gt;LLMs are turing complete ( https://arxiv.org/abs/2411.01992 ). Or what is your definition of &amp;#x27;count&amp;#x27;?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2411.01992/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Ask, and it shall be given: On the Turing completeness of prompting — HN submission</title><link>https://news.ycombinator.com/item?id=42227610</link><guid isPermaLink="false">urn:hackerpapers:submission:2411.01992:42227610</guid><pubDate>Sun, 24 Nov 2024 12:31:33 GMT</pubDate><description>&lt;p&gt;Ask, and it shall be given: Turing completeness of prompting&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2411.01992/"&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>Ask, and it shall be given: On the Turing completeness of prompting — HN submission</title><link>https://news.ycombinator.com/item?id=42056510</link><guid isPermaLink="false">urn:hackerpapers:submission:2411.01992:42056510</guid><pubDate>Wed, 06 Nov 2024 00:45:39 GMT</pubDate><description>&lt;p&gt;Ask, and it shall be given: Turing completeness of prompting&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2411.01992/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
