https://hackerpaper.kaipfister.de/p/1706.04129/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=39820750urn:hackerpapers:mention:1706.04129:39820750Mon, 25 Mar 2024 20:11:16 GMT<p>That’s only true if the list of programming languages is infinite or if the list of features is infinite. If you want the list to be expandable without ever reindexing AND you want it to still be relatively compact, you can use Rosenberg-Strong which creates a square shells instead of Cantor’s diagonal shell. https://arxiv.org/abs/1706.04129 Bonus content: Szudzik shows how Rosenberg-Strong lets you create a bijection from positive to binary trees ordered in a way so that larger integers never yield a tree of height N until it’s exhausted all tree instances of height N-1.</p><p><a href="https://hackerpaper.kaipfister.de/p/1706.04129/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DM