https://github.com/tom-p-reichel/svg-is-turing-complete

An implementation of rule 110 in Scalable Vector Graphics
https://github.com/tom-p-reichel/svg-is-turing-complete

Last synced: 3 months ago
JSON representation

An implementation of rule 110 in Scalable Vector Graphics

• Host: GitHub
• URL: https://github.com/tom-p-reichel/svg-is-turing-complete
• Owner: tom-p-reichel
• Created: 2019-04-12T04:12:24.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2020-08-07T22:03:23.000Z (over 4 years ago)
• Last Synced: 2024-08-02T01:26:31.961Z (6 months ago)
• Language: HTML
• Size: 6.84 KB
• Stars: 147
• Watchers: 2
• Forks: 7
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# 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](http://mathworld.wolfram.com/Rule110.html), 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](https://tom-p-reichel.github.io/svg-is-turing-complete/110.html).