benelliott comments on Fine-tuned for Interestingness vs. Ramsey’s Theorem

[benelliott]

even some one-dimensional, two-colour cellular automata—extremely simple systems as far as that goes—have been proven to be Turing complete

Some are, most aren’t.