On a Turing machine, the state changes during the execution of the program. Von Neumann architecture implements this machine theory and typical computer hardware uses Von Neumann architecture.
Imperative programs uses the state to describes their computations.
Semantically, is correct to say that imperative program works like a Turing machine? If not, theoretically, what is the origin of state used by imperative programming?