"So this is pretty cool, but it turns out that the contextual substitution lookup type is really powerful. This is because the table that it references can be itself, which means it can be recursive."
[…]
"So thats a pretty powerful virtual machine. I think the above is sufficient to prove Turing complete-ness."
Postscript fonts? Fully programmable font glyphs in the 80's. Little used, but very fun. I recall a typewriter font that would vary the glyphs position, weight and edges a bit to simulate coming from a manual typewriter.
One could, if so inclined, build a complete COLRv1 font parser in PostScript.
"So this is pretty cool, but it turns out that the contextual substitution lookup type is really powerful. This is because the table that it references can be itself, which means it can be recursive."
[…]
"So thats a pretty powerful virtual machine. I think the above is sufficient to prove Turing complete-ness."