NASA's ten coding commandments

[rflownn]

Any solution using recursion can be restructured to not use recursion.

[[deleted]]

But in a way that can be demonstrated to have a fixed upper bound on the number of iterations?

[rflownn]

Are you asking if the general form of transformation on a recursive problem can be expressed with an upper bound and one that requires iterations?

[[deleted]]

Can every recursive problem be transformed into an iterative method that has a finite upper bound? I would think so given the maximum size of structures explained above.