Jason S wrote: > 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. No, it isn't. A Turing Machine has an infinite tape and an infinite state space, and can compute anything that's computable. A Turing machine can be programmed to do what your simple machine does, but not vice versa. -- Dave Tweed -- http://www.piclist.com hint: PICList Posts must start with ONE topic: [PIC]:,[SX]:,[AVR]: ->uP ONLY! [EE]:,[OT]: ->Other [BUY]:,[AD]: ->Ads