Re: Implausibility that we can be explained by evolution

In article <1185544257.833192.28210@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
someone2 <glenn.spigel2@xxxxxxxxxxxxxx> wrote:

The robot, due to its behaviour
(being a Turing Equivalent),

Is the robot a neural network or a Turing Machine?

A Turing Equivalent is a computing device which can be mathematically
shown to be equivalent to a Turing Machine.

The "Turing Test", never explicitly named by Alan Turing, is the one
involving humans talking to AI computers and other humans (as the
control case) over data terminals. If the AI computer can fool the human
into thinking it is a human, then it passes the "Turing Test".

Your question is ambiguous. Is the robot a Turing Equivalent or did it
pass the "Turing Test"? If you mean that it passed the Turing Test, then
why call it a Turing Equivalent?

caused some atheists to claim it was
consciously experiencing.

What do the atheists have to do with it?

Why do you keep running away from these questions?

--
Timberwoof <me at timberwoof dot com> http://www.timberwoof.com
"When you post sewage, don't blame others for
emptying chamber pots in your direction." ?Chris L.
an important web site: http://www.muslim-refusenik.com/

.

Relevant Pages

  • Re: Random reals are not computable!
    ... formalization of computation to the Turing Machine formalization. ... "I'll say that any computer which is equivalent in power to a Turing ... machine is Turing equivalent. ...
    (comp.theory)
  • Re: Random reals are not computable!
    ... formalization of computation to the Turing Machine formalization. ... "I'll say that any computer which is equivalent in power to a Turing ... machine is Turing equivalent. ...
    (sci.math)
  • Re: Random reals are not computable!
    ... formalization of computation to the Turing Machine formalization. ... "I'll say that any computer which is equivalent in power to a Turing ... machine is Turing equivalent. ...
    (sci.logic)
  • Re: Random reals are not computable!
    ... > It means they have the same Turing degree. ... Turing equivalent to a real number b? ... do you mean reduction between two problems ... You demand maximum precision from me, ...
    (sci.math)
  • Re: Random reals are not computable!
    ... > It means they have the same Turing degree. ... Turing equivalent to a real number b? ... do you mean reduction between two problems ... You demand maximum precision from me, ...
    (sci.logic)
Loading