[mrkeen]

I was chatting about languages with guaranteed termination as a feature to a C-programmer colleague.

He said "well then they're not Turing-complete" and that was the end of the discussion. Dismissed as 100% useless.

[wruza]

Not a CS guy, but afaiu guaranteed termination lowers the automata class to push-down automatons or FSMs, which are definitely not what we’d agree to call general purpose programming languages. In practical terms, they have a computing regime equivalent to that one of regexps of various sorts.