With all respect to Tim Berners-Lee, I think the principle of least power is overrated. For example, even binary Horn clauses are Turing complete[0]. Whatever configuration language you can come up with (HTML, CSS, or whatever), it's either Turing-complete or not, and if it's Turing-complete there is no danger of executing infinite loops as long as you have some cutoff for resource requirements. The only thing that matters is whether the code is properly sandboxed before it tries to do any I/O.
Not sure I agree with you overall, but I do agree with the distinction between computational power and I/O (or capabilities). That's a very important design criteria for languages for distributed systems.
I think the problem would be that the computation would get cut off at different points on every machine, leading to an unstable ecosystem. Remember the browser has to run on devices with at least an order of magnitude difference in resources, probably 2 orders now.
Generally, you want to guarantee that your style computations terminate. Now it appears that CSS doesn't actually provide that guarantee, since it's Turing complete :) But I guess it's close enough in practice.
[0] https://www.ps.uni-saarland.de/Publications/documents/devien...