As Alan Turing (almost said): a true General Purpose Programming Language is a Domain Specific Language for writing Domain Specific Languages. If you're not writing DSLs, Turing's Theorem does not apply to you and you are NOT using a Turing-equivalent language.https://twitter.com/jdegoes/status/945692757208608769 …
Turing completeness is about Universality. If you take it formally, you'll want bitwise universality, not just universality up to some preprocessing, at which point you have Kolmogorov Universality... and none of the usual languages are universal, save Lisp, Perl and... shell(!)
Read my blog!