For SVG to be truly turing complete, it must have its output fed to it's input--- making this only a sort of driven turing machine.
Scalable Vector Graphics is an XML based language with significant image processing capabilities, and here I demonstrate that SVG can theoretically do arbitrarily large (but ultimately finite) computations.
It does so by unrolling a fixed number of iterations of rule 110, which IS turing complete, using SVG image filters.
Depending on the browser and browser version, this runs either very fast or excruciatingly slowly. Try it below!
Behold the monstrocity in-browser here.