No, they're equating _Turing completeness_ with _might not terminate_. CEL, Expr, Rego, and other languages like them are intended to guarantee to complete. You can't do that cleanly with a Turing complete language.

▲

IshKebab 2 hours ago | parent [-]

Right but "guaranteed to terminate" is not a useful property. You could write a program that terminates... after a billion years.

	▲	dilyevsky an hour ago \| parent [-]
		You can estimate cost of CEL program using static analysis before running it. "estimate" only because size of runtime data is generally unknown (but obv you could limit that).