<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Look, There's More to Say about Conway's Look and Say Sequence · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2405.11103/</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/2405.11103/feed.xml" rel="self" type="application/rss+xml" /><item><title>Look, There's More to Say about Conway's Look and Say Sequence — mentioned by robot-wrangler</title><link>https://news.ycombinator.com/item?id=46066924</link><guid isPermaLink="false">urn:hackerpapers:mention:2405.11103:46066924</guid><pubDate>Thu, 27 Nov 2025 08:06:25 GMT</pubDate><description>&lt;p&gt;&amp;gt; What is the reason why there are 92 elements in this mathematical method Those elements are necessary and sufficient for closure in exactly the weird formal automaton that the informal look-and-say sequence describes, i.e. once you have a graph and transition-states spelled out this much, there&amp;#x27;s just nowhere else for sequences to transition to. This would maybe be an unsatisfying answer except.. it&amp;#x27;s surprising at first that it&amp;#x27;s even finite, or for that matter that you can even analyze this kind of question in the first place. They proved it originally by simplifying the cases that had to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2405.11103/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item></channel></rss>
