Skip to content

An implementation of rule 110 in Scalable Vector Graphics

Notifications You must be signed in to change notification settings

tom-p-reichel/svg-is-turing-complete

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 

Repository files navigation

SVG is turing-complete-ish:

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.

About

An implementation of rule 110 in Scalable Vector Graphics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages