Rule 110 for turing completeness

Rule 110 for turing completeness
0

#1

what is rule 110 for turing completeness,does it define css to be a programming language?


#2

Rule 110 is a cellular automata, like Conway’s Game of Life. It is Turing complete, so in theory any other programming language can be implemented using it. Rule 110 can be encoded using CSS keyframe animations. This means CSS is theoretically Turing complete as well if you pretend it doesn’t need HTML and user input to start the animation. In practise, it’s a pretty meaningless observation, just a mildly interesting thing about CSS if you find that kind of thing interesting.