<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Expressive Power of Transformers with Chain of Thought · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2310.07923/</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/2310.07923/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Expressive Power of Transformers with Chain of Thought — mentioned by shawntan</title><link>https://news.ycombinator.com/item?id=49630418</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:49630418</guid><pubDate>Wed, 09 Sep 2026 17:49:05 GMT</pubDate><description>&lt;p&gt;For the research focused, there are some references in my blogpost here on what kinds of computational problems minimally require how much CoT to solve: https://blog.wtf.sg/posts/2023-02-03-the-new-xor-problem/ Notably Will Merrill&amp;#x27;s work: https://arxiv.org/abs/2310.07923 As for how universal transformers (looping transformers, but everyone has since forgotten prior work) will affect this, Will Merrill (again) has a paper here (https://arxiv.org/abs/2503.03961) that discusses exactly this. The original universal transformers is called &amp;quot;universal&amp;quot; because if you allow for per-token looping…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=49248328</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:49248328</guid><pubDate>Mon, 10 Aug 2026 19:15:02 GMT</pubDate><description>&lt;p&gt;&amp;gt;why wouldn&amp;#x27;t that same model be able to find ways to improve it&amp;#x27;s own algorithms beyond that of the capabilities of human mathematicians / ML researchers Because algorithms have lower bounds, and the computational characteristics of LLMs are well-characterized by papers like https://arxiv.org/abs/2310.07923 . No amount of intelligence can make something faster than a mathematically-proven lower bound, any more than it could make 1+1=3 (that&amp;#x27;s why every single successful production transformer architecture has some form of O(N^2) attention layers, because it&amp;#x27;s mathematically impossible to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by anonymid</title><link>https://news.ycombinator.com/item?id=47030752</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:47030752</guid><pubDate>Mon, 16 Feb 2026 04:02:14 GMT</pubDate><description>&lt;p&gt;Thanks for reading, and I really appreciate your comments! &amp;gt; who feed their produced tokens back as inputs, and whose tuning effectively rewards it for doing this skillfully Ah, this is a great point, and not something that I considered. I agree that the token feedback does change the complexity, and it seems that there&amp;#x27;s even a paper by the same authors about this very thing! https://arxiv.org/abs/2310.07923 I&amp;#x27;ll have to think on how that changes things. I think it does take the wind out of the architecture argument as it&amp;#x27;s currently stated, or at least makes it a lot more challenging. I&amp;#x27;ll…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by red75prime</title><link>https://news.ycombinator.com/item?id=45423434</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:45423434</guid><pubDate>Tue, 30 Sep 2025 09:02:04 GMT</pubDate><description>&lt;p&gt;The term for research on whether LLMs can learn and execute this or that algorithm of program synthesis? I guess there&amp;#x27;s none. If we do know the algorithm, it&amp;#x27;s better to teach LLM to write a program that outputs a program. If we don&amp;#x27;t know the algorithm, we can&amp;#x27;t reason whether LLM can do it. &amp;gt; even if someone discovered that LLMs can only ever emit/recognize context-sensitive languages https://arxiv.org/abs/2310.07923 Their recognition abilities are limited by context-sensitive languages, if the number of steps in chain-of-thought is linear in the length of input. All in all, asymptotic…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=45120415</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:45120415</guid><pubDate>Wed, 03 Sep 2025 21:06:10 GMT</pubDate><description>&lt;p&gt;LLMs are not formally equivalent to Markov chains, they&amp;#x27;re more powerful; transformers with sufficient chain of thought can solve any problem in P: https://arxiv.org/abs/2310.07923.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=44367776</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:44367776</guid><pubDate>Tue, 24 Jun 2025 16:14:45 GMT</pubDate><description>&lt;p&gt;We can be sure via analysis based on computational theory, e.g. https://arxiv.org/abs/2503.03961 and https://arxiv.org/abs/2310.07923 . This lets us know what classes of problems a model is able to solve, and sufficiently deep transformers with chain of thought have been shown to be theoretically capable of solving a very large class of problems.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by inciampati</title><link>https://news.ycombinator.com/item?id=42756660</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:42756660</guid><pubDate>Sun, 19 Jan 2025 13:11:18 GMT</pubDate><description>&lt;p&gt;Yes it is, because the post discussed this approach precisely because unrolling the actual chain of thought in interactive chat does not work. And it&amp;#x27;s doubly relevant because chain of thought let&amp;#x27;s transformers break out of TCO complexity and be UTM. This matters because TC0 is pattern matching while UTM is general intelligence. Forgetting what the model thought breaks this and (ironically) probably forces the model back into one-shot pattern matching. https://arxiv.org/abs/2310.07923&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by Isinlor</title><link>https://news.ycombinator.com/item?id=42572588</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:42572588</guid><pubDate>Thu, 02 Jan 2025 07:50:47 GMT</pubDate><description>&lt;p&gt;When Can Transformers Count to n? https://arxiv.org/html/2407.15160v2 The Expressive Power of Transformers with Chain of Thought https://arxiv.org/html/2310.07923v5 Transformer needs to retrieve letters per each token while forced to keep internal representation still aligned in length with the base tokens (each token also has finite embedding, while made out of multiple letters), and then it needs to count the letters within misaligned representation. Autoregressive mode completely alleviate the problem as it can align its internal representation with the letters and it can just keep…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=42422919</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:42422919</guid><pubDate>Sun, 15 Dec 2024 11:38:32 GMT</pubDate><description>&lt;p&gt;An LLM with chain of thought and unbounded compute/context can run any program in PTIME: https://arxiv.org/abs/2310.07923 , which is a huge class of programs.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=42416301</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:42416301</guid><pubDate>Sat, 14 Dec 2024 11:13:38 GMT</pubDate><description>&lt;p&gt;&amp;gt; that we are not guaranteed to be able to replicate all traits of human intelligence by brute forcing. We know from complexity theory that transformers with chain of thought are guaranteed to be able to reproduce a significant fraction of human reasoning, anything in the complexity class PTIME: https://arxiv.org/abs/2310.07923&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by aithrowawaycomm</title><link>https://news.ycombinator.com/item?id=42142913</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:42142913</guid><pubDate>Fri, 15 Nov 2024 00:44:28 GMT</pubDate><description>&lt;p&gt;I think the more obvious explanation has to do with computational complexity: counting is an O(n) problem, but transformer LLMs can’t solve O(n) problems unless you use CoT prompting: https://arxiv.org/abs/2310.07923&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by aithrowawaycomm</title><link>https://news.ycombinator.com/item?id=42142884</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:42142884</guid><pubDate>Fri, 15 Nov 2024 00:40:01 GMT</pubDate><description>&lt;p&gt;I am aware of errors in computations that can be fixed by better tokenization (e.g. long addition works better tokenizing right-left rather than L-R). But I am talking about counting, and talking about counting words, not characters. I don’t think tokenization explains why LLMs tend to fail at this without CoT prompting. I really think the answer is computational complexity: counting is simply too hard for transformers unless you use CoT. https://arxiv.org/abs/2310.07923&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=41567331</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:41567331</guid><pubDate>Tue, 17 Sep 2024 13:21:06 GMT</pubDate><description>&lt;p&gt;&amp;gt;How would that be remarkable, when it is exactly what he Universal Approximation Theorem already states Only with infinite precision, which is highly unrealistic. Under realistic assumptions, fixed depth transformer without chain-of-thought are very limited in what they can express: https://arxiv.org/abs/2207.00729 . Chain of thought increases the class of problems which fixed depth transformers can solve: https://arxiv.org/abs/2310.07923&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by shawntan</title><link>https://news.ycombinator.com/item?id=41563327</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:41563327</guid><pubDate>Tue, 17 Sep 2024 02:11:08 GMT</pubDate><description>&lt;p&gt;Theoretical results exist that try to quantify the number of CoT tokens needed to reach different levels of computational expressibility: https://arxiv.org/pdf/2310.07923 TL;DR: Getting to Turing completeness can require polynomial CoT tokens, wrt the input problem size. For a field that constantly harps on parallelism and compute efficiency, this requirement seems prohibitive. We really need to get away from constant depth architectures.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=41446600</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:41446600</guid><pubDate>Wed, 04 Sep 2024 15:02:16 GMT</pubDate><description>&lt;p&gt;The theoretical foundation of transformers is well understood; they&amp;#x27;re able to approximate a very wide family of functions, particularly with chain of thought ( https://arxiv.org/abs/2310.07923 ). Training them on next-token-prediction is essentially training them to compress, and more optimal compression requires a more accurate model of the world, so they&amp;#x27;re being trained to model the world better and better. However you want to define intelligence, for practical purposes models with better and better models of the world are more and more useful.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=41423243</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:41423243</guid><pubDate>Mon, 02 Sep 2024 07:04:58 GMT</pubDate><description>&lt;p&gt;Transformers with chain of thought can use FOL: https://arxiv.org/abs/2310.07923&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=40612230</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:40612230</guid><pubDate>Fri, 07 Jun 2024 19:48:15 GMT</pubDate><description>&lt;p&gt;Interestingly LLMs also do better with pen and paper reasoning: https://arxiv.org/abs/2310.07923 .&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — mentioned by logicchains</title><link>https://news.ycombinator.com/item?id=40587638</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.07923:40587638</guid><pubDate>Wed, 05 Jun 2024 17:16:13 GMT</pubDate><description>&lt;p&gt;&amp;gt;For reasoning of any complexity, some sort of internal monologue and iteration is needed. From a formal perspective you&amp;#x27;re entirely correct. Transformers with chain-of-thought are strictly more powerful than transformers without it, and can efficiently solve classes of problems that would otherwise require exponentially increasing model depth: https://arxiv.org/abs/2310.07923&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>The Expressive Power of Transformers with Chain of Thought — HN submission</title><link>https://news.ycombinator.com/item?id=39805923</link><guid isPermaLink="false">urn:hackerpapers:submission:2310.07923:39805923</guid><pubDate>Sun, 24 Mar 2024 09:01:46 GMT</pubDate><description>&lt;p&gt;The Expressive Power of Transformers with Chain of Thought (Revised)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;20 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2310.07923/"&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>
