Join us for a deep dive into the Kolakowski sequence, a deceptively simple run-length sequence of 1s and 2s that generates itself. We explore how each block’s length determines the next, the self-referential rule behind its growth, and why this leads to rich mathematics—from connections to tag systems and Turing completeness to the still-open question of whether 1s and 2s occur with equal density. We’ll survey what’s known, including upper-density bounds by Schwadel and Nielsen, the link to the Gallum sequence, and how animations and the OEIS/Wikipedia resources illuminate this enigmatic, fractal-like sequence.

Note:  This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information.

Sponsored by Embersilk LLC