My question comes from the following implementation of Rule 110 in CSS (This! In CSS!).
The doubt comes from the definition of Turing completeness, which says that a system is Turing-complete if it is able to solve any computational problem. However, Rule 110 is used to test this hypothesis, and CSS seems to have passed.
But I can not do so much with CSS (perhaps because my knowledge is limited ... in that case it would be extremely limited).
No, there is also the Game of Life that can be used to know if the system is turing-complete. / p>
It can be a good way to identify a language as turing-complete using Rule 110 because of its universality.
For example if we have a S computational function that for program (P, X) then P will stop when it reaches X, and if S (P, X) stops then its result will always be similar to of P on X. Rule 110 - English
Now rules 30 and 90 do not know if they are universal or not.
