u(t) is called 60 times per second.
t: Elapsed time in seconds.
S: Shorthand for Math.sin.
C: Shorthand for Math.cos.
T: Shorthand for Math.tan.
R: Function that generates rgba-strings, usage ex.: R(255, 255, 255, 0.5)
c: A 1920x1080 canvas.
x: A 2D context for that canvas.
I had a look at yours magna, they are true crt, much more realistic i think. The scan lines on this are just a sideeffect I exploited and it was easy to add colour distortion in the R().
Yes and no, it's a fractal n=T(0|(i/w+f^f-i/w)/(t**.7+6)) which is just a more elaborate variation of serpinsky triangles to produce more interesting patterns. Some fractals are automata, but not all automata are fractals, see here: https://en.wikipedia.org/wiki/Rule_90
The implication is serpinsky triangles are computationally reducable, meaning it does not have to be computed in the same way as a cellular automata i.e state can be computed at step t directly without traversing intermidiate steps.
u(t) is called 60 times per second.
t: elapsed time in seconds.
c: A 1920x1080 canvas.
x: A 2D context for that canvas.
S: Math.sin
C: Math.cos
T: Math.tan
R: Generates rgba-strings, ex.: R(255, 255, 255, 0.5)