Turing completeness is actually 1. easy to achieve (even accidentally) and 2. undesirable in many circumstances (it makes code hard to analyse and process by ma

Turing completeness is actually 1. easy to achieve (even accidentally) and 2. undesirable in many circumstances (it makes code hard to analyse and process by machines and the semantics, what you really meant, get lost in the noise). There's a reason there's no way to express loops and varibles in HTML, for example. That's the principle (or rule) of least power at work: http://www.w3.org/2001/tag/doc/leastPower.html http://www.w3.org/2001/tag/doc/leastPower.html Also see: http://en.wikipedia.org/wiki/Turing_tarpit http://en.wikipedia.org/wiki/Turing_tarpit