Earlier quoted context omitted.
Algorithms != computation
Then no algorithm holds state, because an algorithm is just a ruleset.
Sure. But the point is that functional languages are more declarative, holding very little control flow state. Procedural languages are the opposite.
The computation I’m talking about is whether you’re for more of a von neumann target or a lambda calc target.