> It is necessary for a system to display the property of being turing complete in order to be defined as a programming language.

There are programming languages that are explicitly not Turing complete. I'm not familiar with any of them, but an example is BlooP, where recursion is not permitted.

https://en.wikipedia.org/wiki/BlooP_and_FlooP

> If you disagree, you can fight me on it.

I don't think anyone would argue that HTML is a programming language - so you might be fighting shadows.

https://en.wikipedia.org/wiki/Markup_language

However, there are endless variations of template languages based on HTML, that arguably cross over into programming, mixing presentation and logic.

God, is that article pretentious.

The points made can be made — and have been made hundreds of times before — with much less condescension.