<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Logical Languages Accepted by Transformer Encoders with Hard Attention · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2310.03817/</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.03817/feed.xml" rel="self" type="application/rss+xml" /><item><title>Logical Languages Accepted by Transformer Encoders with Hard Attention — mentioned by yorwba</title><link>https://news.ycombinator.com/item?id=47367511</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.03817:47367511</guid><pubDate>Fri, 13 Mar 2026 17:56:02 GMT</pubDate><description>&lt;p&gt;Treating attention as a lookup operation is popular among computational complexity theorists (e.g. https://arxiv.org/abs/2310.03817 ) because it&amp;#x27;s easier to work with when you&amp;#x27;re explicitly constructing a transformer to perform a particular computation, just to demonstrate that tranformers can, in theory, perform it. That&amp;#x27;s also why there are no training details: the weights are computed directly and not trained.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.03817/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.FL</category></item></channel></rss>
