The recent 3Blue1Brown video on "How a Mandelbrot set arises from Newton’s work" (https://www.youtube.com/watch?v=LqbZpur38nw https://www.youtube.com/watch?v=Lq

The recent 3Blue1Brown video on "How a Mandelbrot set arises from Newton’s work" (https://www.youtube.com/watch?v=LqbZpur38nw https://www.youtube.com/watch?v=LqbZpur38nw) made me think how, similarly to how different areas of the Mandelbrot set represent some halting property of the given complex number and the iteration z_n+1 = z_n²+c, programming languages could be visualized. Chris Barker's Zot http://web.archive.org/web/20200414141014/http://www.nyu.edu/projects/barker/Iota/zot.html http://web.archive.org/web/20200414141014/http://www.nyu.edu... is a turing complete system in which every binary string is a valid program. Input data is just appended as binary string to it. So the two dimensional "program+input => number of steps before halting" space can be visualized similarly without having blanks for syntax errors: https://i.imgur.com/ZGeZBBa.png https://i.imgur.com/ZGeZBBa.png So not just mathematical computable spaces can be visualized this way, but also programming ones - another part of the Ruliad.