> Actually, it's quite possible to determine if a deterministic program with finite memory will loop. More practically, if you stick to structurally recursive

> Actually, it's quite possible to determine if a deterministic program with finite memory will loop. More practically, if you stick to structurally recursive loops, it's trivial to determine those loops will terminate. Structural recursion is when the recursive calls acts on smaller parts of the original input (e.g. map, reduce and filter functions do this), so you know it'll terminate eventually. I find it pretty rare that I write loops with complex looping conditions.