Well, this boils down to unanswered questions of theoretical physics.
According to quantum theory, any finite physical system can be approximated arbitrarily closely by a quantum Turing machine (see some old papers of David Deutsch, which prove this). And, a quantum Turing machine can provably not compute any non-classical-Turing-machine-computable functions (though it can compute some functions faster, on average, than any classical Turing machine) However, quantum theory is not a complete description of the physical universe, and it is not yet known whether the conclusions of the above paragraph will hold for future physics theories that unify quantum theory and gravitation. Perhaps an enlarged class of "quantum gravity computers" will need to be defined, but even so I consider it extremely likely that these QG computers will provably not be able to compute any non-classical-Turing-machine-computable functions.... [Roger Penrose has famously put forth a different intuition -- he suggests that QG computers will be able to compute non-classically-computable functions. I really doubt it...] As robots are physical systems, the above discussion pertains to robots ;-) -- Ben G On 10/2/06, Pei Wang <[EMAIL PROTECTED]> wrote:
We all know that, in a sense, every computer system (hardware plus software) can be abstractly described as a Turing machine. Can we say the same for every robot? Why? Reference to previous publications are also welcome. Pei ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/[EMAIL PROTECTED]
----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/[EMAIL PROTECTED]
