3 ms·
CSS is not turing-complete - it is as turing-complete as a simple TXT file. Deciding whether some sequence of bytes resembles a CSS file is very possible. Decid
by Gehinnn 6y ago
CSS is not turing-complete - it is as turing-complete as a simple TXT file.
Deciding whether some sequence of bytes resembles a CSS file is very possible.
Deciding whether a stylesheet can be successfully applied to a website is also decidable.
Of course, it is undecidable whether a certain pattern emerges if a stylesheet is applied to an infinitely large HTML file.
But then, it is also undecidable whether some TXT file appears in an infinitely large HTML file.
- Liron 6y agoIt's Turing complete if you let a human feed a bunch of clicks to proceed along the computation steps. [1] It also allows embedded JS (in some browsers), which is Turing complete. My point is that languages really quickly surpass the Turing complete barrier if you let them do fancy things. Godel realized that proving interesting statements about unbounded natural numbers is quite a fancy thing. [1] https://stackoverflow.com/questions/2497146/is-css-turing-complete https://stackoverflow.com/questions/2497146/is-css-turing-co...