A characterization of $p$-automatic sequences as columns of linear cellular automata · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1209.6008/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTA characterization of $p$-automatic sequences as columns of linear cellular automata — mentioned by jaymzcampbellhttps://news.ycombinator.com/item?id=40135378urn:hackerpapers:mention:1209.6008:40135378Tue, 23 Apr 2024 18:27:35 GMT<p>The Game of Life is a 2-dimensional cellular automata (CA), so given the 1-dimensional rule 110 has been proven to be universal / Turing-complete [1], it becomes less mysterious. Albeit the complexity of the system required to set it up to do anything &quot;useful&quot; would be prohibitive. I&#x27;m currently finishing up my OU MSc and the project I picked was specifically around cellular automata - only in this case relating to them calculating any arbitary automatic sequence - which are sequences you can create from finite state machines - that really opened my eyes to the fact these sorts of very, very…</p><p><a href="https://hackerpaper.kaipfister.de/p/1209.6008/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.DS