Just to be clear: a language with only if() conditionals and for() loops with known number of iterations (so for instance all for-each loops) isn't actually Tur

Just to be clear: a language with only if() conditionals and for() loops with known number of iterations (so for instance all for-each loops) isn't actually Turing complete. This is called primitive recursion, and an easy to prove example of what it cannot process is computing the Ackerman function. Also, you can easily see that something is fishy because all such code must terminate (where's the halting problem here?) https://en.m.wikipedia.org/wiki/Primitive_recursive_function https://en.m.wikipedia.org/wiki/Primitive_recursive_function Otherwise I completely agree with the aphorism.