>I'm so tired of "CSS is Turing Complete" meme being propagated.
The article addressed this:
>but the declarations interact with each other just enough to allow an encoding of the cellular automaton Rule 110 (assumption: requires mechanical mouse clicks on the web browser to advance state; see also the Magic: The Gathering example)
[Note: I have omitted links embedded in the original text.]
The claim is not that CSS is Turing-complete, only that it can be used to represent the rules of a Turing-complete automaton. You still need to provide a physical driver.
Rule 110 is so simple that practically everything can represent its rules. You don't need to be Turing complete to do it. Indeed, the rules are even representable in Presburger arithmetic, which, unlike Peano arithmetic, is decidable! You can deduce formulas for every single step of the process, just like with CSS! But I'm sure we can all agree that this is not Turing completeness, otherwise the term itself becomes a farce.
Rule 110 is Turing complete. Therefore anything which can implement/simulate it is also Turing complete.
The same is true of any other model of a Turing machine. If your host computer can simulate a Turing complete machine then the host is also Turing complete.
> You can deduce formulas for every single step of the process, just like with CSS!
You can deduce the formulas, but can you make the formulas self-deducing when driven only by a mechanical clock like a steady mouse-click? Or will it require constant adjustment and intervention by the operator?
> But I'm sure we can all agree that this is not Turing completeness
I'm not sure we can. TC can be tricky. That's why people try to give constructions rather than just claim something or other is TC.
The article addressed this:
>but the declarations interact with each other just enough to allow an encoding of the cellular automaton Rule 110 (assumption: requires mechanical mouse clicks on the web browser to advance state; see also the Magic: The Gathering example)
[Note: I have omitted links embedded in the original text.]
The claim is not that CSS is Turing-complete, only that it can be used to represent the rules of a Turing-complete automaton. You still need to provide a physical driver.