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?

  • 1
    $\begingroup$ "Von Neumann architecture implements this machine theory" -- nope. TMs don't have shared memory space for instructions and data. I don't think the two concepts are related; they happen to co-occur in modern machines, true (to the extent to which modern machines are Turing-equivalent). $\endgroup$ – Raphael Nov 2 '16 at 10:27
  • $\begingroup$ "imperative program works like a Turing machine" -- maybe in the sense that horses run like sharks swim, but otherwise... not so much. $\endgroup$ – Raphael Nov 2 '16 at 10:28
  • $\begingroup$ This is the second question of this kind in a short time. I recommend you do some more reading before trying to write a report. In particular, make sure you know your way around different models of computation. $\endgroup$ – Raphael Nov 2 '16 at 10:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.