[pcwalton]

Be careful what you wish for re. Turing completeness. One of the things we're discovering is that, when implemented properly, basic modern CSS (i.e. 2.1) parallelizes beautifully across multiple threads and cores for large speedups, with only a few exceptions in wide use, like floats. But if CSS hadn't been so declarative, we'd be stuck in the computing model of the 90's era it was designed in when implementing it.

[marcosdumay]

Turing completelness does not mean that the execution paths are specified.

Or, in a simpler way, do you know Haskell?