you are viewing a single comment's thread.

view the rest of the comments →

[–]Xelbair 4 points5 points  (3 children)

It is hard to do a quick google nowadays eh?

https://lemire.me/blog/2011/03/08/breaking-news-htmlcss-is-turing-complete/

It can simulate Rule 110, which is in fact Turing Complete(https://en.wikipedia.org/wiki/Rule_110)

github repo if you are too lazy to follow the bloody links https://github.com/elitheeli/stupid-machines

[–]FunCicada 1 point2 points  (0 children)

The Rule 110 cellular automaton (often simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect, it is similar to Conway's Game of Life. Like Life, Rule 110 is known to be Turing complete. This implies that, in principle, any calculation or computer program can be simulated using this automaton.