On 4/7/2012 14:17, Kevin Wampler wrote:
> require very similar encoding of a problem

I disagree that the encodings are similar.

> 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.

Take, for example, quantum computers, for which this is untrue.

> 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.

That too.

-- 
Darren New, San Diego CA, USA (PST)
   "Oh no! We're out of code juice!"
   "Don't panic. There's beans and filters
    in the cabinet."

Post a reply to this message