<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On the Computational Power of Transformers and its Implications in Sequence Modeling · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.09286/</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/2006.09286/feed.xml" rel="self" type="application/rss+xml" /><item><title>On the Computational Power of Transformers and its Implications in Sequence Modeling — mentioned by naasking</title><link>https://news.ycombinator.com/item?id=35169969</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.09286:35169969</guid><pubDate>Wed, 15 Mar 2023 15:38:32 GMT</pubDate><description>&lt;p&gt;&amp;gt; I must have missed the part when it started doing anything algorithmically. I thought it’s applied statistics, with all the consequences of that. This is a common misunderstanding. Transformers are actually Turing complete: * On the Turing Completeness of Modern Neural Network Architectures, https://arxiv.org/abs/1901.03429 * On the Computational Power of Transformers and its Implications in Sequence Modeling, https://arxiv.org/abs/2006.09286&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.09286/"&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>On the Computational Power of Transformers and its Implications in Sequence Modeling — mentioned by naasking</title><link>https://news.ycombinator.com/item?id=35120108</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.09286:35120108</guid><pubDate>Sun, 12 Mar 2023 14:00:32 GMT</pubDate><description>&lt;p&gt;* On the Turing Completeness of Modern Neural Network Architectures, https://arxiv.org/abs/1901.03429 * On the Computational Power of Transformers and its Implications in Sequence Modeling, https://arxiv.org/abs/2006.09286&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.09286/"&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>On the Computational Power of Transformers and its Implications in Sequence Modeling — mentioned by shawnz</title><link>https://news.ycombinator.com/item?id=34734574</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.09286:34734574</guid><pubDate>Fri, 10 Feb 2023 01:46:25 GMT</pubDate><description>&lt;p&gt;To be clear, transformer networks are turing-complete: https://arxiv.org/abs/2006.09286&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.09286/"&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>
