I think we are saying the same thing and misunderstanding each other.  I
mearly meant a very simple machine that obviously can't pass the Turing Test
(such as the one I described) is still a Turing Machine.

Jason

----- Original Message -----
From: "Wouter van Ooijen" <wouter@VOTI.NL>
To: <PICLIST@MITVMA.MIT.EDU>
Sent: Wednesday, June 30, 2004 8:37 AM
Subject: Re: [OT:] Turing Machines


> > A Finite State Machine can be considered a Turing Machine
> > with no tape, so
> > I've defined a TM that decides if a string is odd or even; it
> > accepts iff
> > the string is even.
>
> A Turing machine can definitely do this, but a Computer Science a Turing
> machine is a well-defined entity that can do much more than just what
> you state.
>
> Wouter van Ooijen
>
> -- -------------------------------------------
> Van Ooijen Technische Informatica: www.voti.nl
> consultancy, development, PICmicro products
>
> --
> http://www.piclist.com hint: PICList Posts must start with ONE topic:
> [PIC]:,[SX]:,[AVR]: ->uP ONLY! [EE]:,[OT]: ->Other [BUY]:,[AD]: ->Ads
>
>

--
http://www.piclist.com hint: PICList Posts must start with ONE topic:
[PIC]:,[SX]:,[AVR]: ->uP ONLY! [EE]:,[OT]: ->Other [BUY]:,[AD]: ->Ads