Can anyone elaborate on how or why Turing completeness requires these sub optimal patterns?
I recall reading about avoiding Turing completeness for similar reasons to avoid the halting problem.
> Other times these programmers apply the rule of least power—they deliberately use a computer language that is not quite fully Turing-complete. Frequently, these are languages that guarantee all subroutines finish, such as Coq.