In article <oqpv02cq8v.fsf at titan.progiciels-bpi.ca>, =?ISO-8859-1?Q?Fran=E7ois_Pinard?= <pinard at iro.umontreal.ca> wrote: > A "simple" Turing machine has infinite memory. Who has that? :-) Not infinite. Unbounded. Jim Heffeorn Sent via Deja.com http://www.deja.com/ Share what you know. Learn what you don't.