<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>LSTM Networks Can Perform Dynamic Counting · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1906.03648/</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/1906.03648/feed.xml" rel="self" type="application/rss+xml" /><item><title>LSTM Networks Can Perform Dynamic Counting — mentioned by YeGoblynQueenne</title><link>https://news.ycombinator.com/item?id=21572137</link><guid isPermaLink="false">urn:hackerpapers:mention:1906.03648:21572137</guid><pubDate>Tue, 19 Nov 2019 11:42:17 GMT</pubDate><description>&lt;p&gt;So I think I really screwed this one up, by assuming a common background. Your comment about aⁿbⁿ being a &amp;quot;simple regular grammar&amp;quot; stuck with me and I realise that we do not have any common background and I should have done a better job of putting my example in context. It was my mistake to agree that aⁿbⁿ is a &amp;quot;simple&amp;quot; grammar. It looks simple and it&amp;#x27;s simple for a human. But, aⁿbⁿ is a context-free language and as such it can only be learned &amp;quot;in the limit&amp;quot;, i.e. by a number of positive and negative examples approaching infinity. It cannot be learned by positive examples only, not even in…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1906.03648/"&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>
