5 ms·
Slight correction: FSMs are not turing-complete. They may not hold though, which is not the same thing.
by beders 7y ago
Slight correction: FSMs are not turing-complete.
They may not hold though, which is not the same thing.
- monadic2 7y agoDerp, been too long since my theory class. I am fairly confident AAT tables are FSMs, so I am curious where the turing completeness comes from. I am certainly not familiar with all truetype/opentype features.
- monocasa 7y agoIt's the hinting that's normally referred to here as Turing complete, I think. https://en.wikipedia.org/wiki/TrueType#Hinting_language https://en.wikipedia.org/wiki/TrueType#Hinting_language
- monadic2 7y agoI know Mac OS X has ignored a lot of the hinting in fonts. Do they evaluate the entire script regardless?