Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

3
  • Sorry, I misread you. I deleted my comment but I'll restate the recommendation of GEB. Commented Dec 19, 2011 at 14:17
  • @zvrba That's been on my reading list for some time - probably time to dive in. Commented Dec 19, 2011 at 22:28
  • You can allow any loops where an upper limit for the number of iterations is calculated before the loop starts. And other loops, like anything where some state has a complete ordering, the loop ends when the state is "small" enough, and each iteration of the loop leads to an earlier state in the ordering; this lets you write a program for the Big Ackermann function which is guaranteed to halt. (in theory). Commented Jul 12, 2022 at 10:05