= Recursive process
A computation that retains pending operations while further calls run, then completes those operations as results return. A <recursive procedure> can instead describe an iterative process: passing an updated accumulator onward may leave no arithmetic pending. Avoiding growing <call stack> storage in that case depends on the implementation. A fixed number of <variables> also does not imply fixed storage in <bits> when their <integer> values grow.<Structure and Interpretation of Computer Programs by Harold Abelson and others>[Structure and Interpretation of Computer Programs, second edition, §1.2.1: deferred operations, state variables, and implementation dependence of space use; bit-storage qualification added here]{ref}
Back to article page
