The Turing machine implicitly includes time as a sequence, and the lambda calculus does not. It is easier for the amateur programmer to reason about time as a s

The Turing machine implicitly includes time as a sequence, and the lambda calculus does not. It is easier for the amateur programmer to reason about time as a sequence. So the lay person begins programming easily writing imperative programs and struggling writing functional programs. The years turn the amateur programmer into the experienced one. Before they only understood imperative programming, now they understand functional too. But they still work with the amateur programmers who only understand imperative. They both use imperative in order to work together. There is something universal in our understanding of temporal logic that makes objects changing over time an intuitive model for a computer's internal state.