Turing Machine & Modern Computer

Posted by smwikipedia on Stack Overflow See other posts from Stack Overflow or by smwikipedia
Published on 2010-03-31T05:48:03Z Indexed on 2010/03/31 5:53 UTC
Read the original article Hit count: 348

I heard a lot that modern computers are based on Turing machine. I'd like to share my understanding and hear your comments.

I think the computer is a big general-purpose Turing machine. Each program we write is a small specific-purpose Turing machine. The classical Turing machine do its job based on the input and its current state inside and so do our programs.

Let's take a running program (a process) as an example. We know that in the process's address space, there's areas for stack, heap, and code. A classical Turing machine doesn't have the ability to remember many things, so we borrow the concept of stack from the push-down automaton. The heap and stack areas contains the state of our specific-purpose Turing machine (our program). The code area represents the logic of this small Turing machine. And various I/O devices supply input to this Turing machine.

The above is my naive understanding about the working paradigm of modern computer. I couln't wait to hear your comments. Thanks very much.

© Stack Overflow or respective owner

Related posts about computer-science

Related posts about turing-machines