<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>When Can Transformers Count to n? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2407.15160/</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/2407.15160/feed.xml" rel="self" type="application/rss+xml" /><item><title>When Can Transformers Count to n? — mentioned by Isinlor</title><link>https://news.ycombinator.com/item?id=42572588</link><guid isPermaLink="false">urn:hackerpapers:mention:2407.15160: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/2407.15160/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
