<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Looped Transformers as Programmable Computers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2301.13196/</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/2301.13196/feed.xml" rel="self" type="application/rss+xml" /><item><title>Looped Transformers as Programmable Computers — HN submission</title><link>https://news.ycombinator.com/item?id=49637745</link><guid isPermaLink="false">urn:hackerpapers:submission:2301.13196:49637745</guid><pubDate>Thu, 10 Sep 2026 02:46:31 GMT</pubDate><description>&lt;p&gt;Looped Transformers as Programmable Computers (2023)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2301.13196/"&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>Looped Transformers as Programmable Computers — mentioned by stavros</title><link>https://news.ycombinator.com/item?id=38623926</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.13196:38623926</guid><pubDate>Wed, 13 Dec 2023 07:48:06 GMT</pubDate><description>&lt;p&gt;Yep: https://arxiv.org/pdf/2301.13196.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.13196/"&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>Looped Transformers as Programmable Computers — mentioned by nojvek</title><link>https://news.ycombinator.com/item?id=36344955</link><guid isPermaLink="false">urn:hackerpapers:mention:2301.13196:36344955</guid><pubDate>Thu, 15 Jun 2023 18:51:36 GMT</pubDate><description>&lt;p&gt;As others have mentioned, turing machines can be achieved by only one instruction set. See https://en.wikipedia.org/wiki/One-instruction_set_computer Most popular being subleq (subract if less than or equal to zero). Subleq can be implemented with a transformer. See https://arxiv.org/pdf/2301.13196.pdf (Looped Transformers as Programmable Computers). The important distinction is that transformers need to be looped. Just like ChatGPT calls the model over and over again until stop token or limit is reached. And we know ChatGPT does better if we let it think step by step and blabber more (chain…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2301.13196/"&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>
