3 ms·

Rule 110 might also be of interest to people as Turing completeness has been proven for it http://en.wikipedia.org/wiki/Rule_110 http://en.wikipedia.org/wiki/R

• cwmma 11y ago
  and then used to prove css is turning complete http://eli.fox-epste.in/rule110-full.html http://eli.fox-epste.in/rule110-full.html
  • srtjstjsj 11y ago
    Is there an explanation of how the CSS implements the state transitions?
    • cwmma 11y ago
      I've looked through the style sheets and from what I can tell the grid is actually just a bunch of check boxes and are selectors like input:not(:checked) +*+ input:not(:checked) +*+ input:not(:checked) + *+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+ input { display: none; } the plus sign meaning adjacent to and the * meaning anything so + * + means 2 over + * + *+ meaning 3 etc
  • habitue 11y ago
    It clearly isn't turing complete because it requires the user to input do the loop portion. If you can't loop, you can't be turing complete.
    • cwmma 11y ago
      yeah it's basically turing complete if the turning machine is allowed to be hand cranked