3 ms·

Any self-recursive algorithm (and possibly mutually-recursive - I haven't thought about it enough) can be expressed with an iterative algorithm if you use a sta

Any self-recursive algorithm (and possibly mutually-recursive - I haven't thought about it enough) can be expressed with an iterative algorithm if you use a stack-based structure to maintain state.

sid0 16y ago
Yes, that's essentially implied by the Church-Turing thesis. :)