It seems trivial as a naive guess that SVG is TC if it can contain JavaScript, which is TC.<p>However, the posted solution seems inelegant and uncompelling. Simply iterating in SVG, which can infinitely scalable.<p>The author expresses apprehension in this closed issue: <a href="https://github.com/tom-p-reichel/svg-is-turing-complete/issues/1" rel="nofollow">https://github.com/tom-p-reichel/svg-is-turing-complete/issu...</a><p>It is mentioned that they intend to demonstrate this using feComposite in the source code.<p>There are bits and pieces of how one would prove TC for SVG.<p>A first step, would be identifying basic operations, as they have done. The next step would be compiling to a tag system, and simulate cyclic tag behavior.<p>It is expressed elsewhere that the lack of loops would exempt TC. Perhaps it can still be argued through DOM manipulation.