Turing Compliant?

[Charles G Waldman]

jhefferon at my-deja.com writes:
 > 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

Oh goody, it looks like we're about to have another long math
tangent!  

I'd be interested to hear what the difference is, according to you,
between "infinite" and "unbounded".  According to me, they are the
same thing.  "finite"=="bounded" => !finite==!bounded.