This may very well be a silly question but I'm trying to cement my understanding of the material in the SICP (http://goo.gl/QXrbtV). My intuition (common sense) says yes, but wondering from a theoretical point of view if this always holds true.


closed as off-topic by Geoff Oxberry May 21 '14 at 2:32

This question appears to be off-topic. The users who voted to close gave this specific reason:

If this question can be reworded to fit the rules in the help center, please edit the question.

  • 1
    $\begingroup$ is a turing machine iterative? $\endgroup$ – k20 May 20 '14 at 21:57
  • $\begingroup$ It is interesting that this has been marked as off topic. I would've thought, but please correct me if I'm wrong that linear recursion and iteration are rudimentary features of computation, no? $\endgroup$ – stantona May 21 '14 at 6:18

I've got a simple and elegant answer for you. @k20 hinted at it in his comment.

Yes, there always is. You can simply emulate the call stack that would be created if you ran a recursive process.


Not the answer you're looking for? Browse other questions tagged or ask your own question.