On 4/7/2012 10:28 AM, Darren New wrote:
>
> That's why real computers can do things that
> Turing machines can't

Consider both Turing machines and "real" computers require very similar 
encoding of a problem in order for a computation to be performed, what 
are you viewing as the critical distinction between them?  After all 
both essentially represent a problem as a string of symbols from an 
alphabet.

Real computers can, of course, interact with the physical world in a way 
that a TM can't, but I imagine that's not your point since it's a little 
like commenting that there's no mathematical algorithm which returns a 
sandwich as the result of it's computation.

Post a reply to this message