I don’t know if it’s been said before1, so in case it hasn’t, I’ll say it:
Every domain specific language converges towards Turing completeness over it’s lifetime.
The reason for this observation is that I’ve recently come in contact with a number of new DSLs2, which exhibit the same problem I’ve seen with other DLSs in the past. Except, this time, I noticed that their authors expressly distanced themselves from the idea of implementing Turing complete languages.


