Scalable Vector Graphics is an XML based language with significant image processing capabilities, and here I demonstrate that these capabilities breach turing completeness.
The turing machine I choose to emulate to prove SVG's turing completeness is rule 110.
Runs in Chromium 73.0.3683.103
after several seconds, seriously, this thing is slow!
Behold the monstrocity in-browser here.
Technical information found in the source, for those further interested.
stjordanis / svg-is-turing-complete Goto Github PK
View Code? Open in Web Editor NEWThis project forked from tom-p-reichel/svg-is-turing-complete
An implementation of rule 110 in Scalable Vector Graphics