From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.7 required=5.0 tests=BAYES_00,MSGID_RANDY
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,54e6f3bfd18d2769
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2000-10-30 18:00:18 PST
Path: 
 supernews.google.com!sn-xit-02!supernews.com!sienna.impulse.net!63.208.208.143.MISMATCH!feed2.onemain.com!feed1.onemain.com!europa.netcrusader.net!128.230.129.106!news.maxwell.syr.edu!nntp2.deja.com!nnrp1.deja.com!not-for-mail
From: Robert Dewar <robert_dewar@my-deja.com>
Newsgroups: comp.lang.ada
Subject: Re: Pointer function parameter
Date: Tue, 31 Oct 2000 01:48:49 GMT
Organization: Deja.com - Before you buy.
Message-ID: <8tl8dv$ldu$1@nnrp1.deja.com>
References: <Pine.LNX.4.10.10010191126450.17222-100000@lexis.di.fct.unl.pt>
 <cJGH5.335638$i5.5078954@news1.frmt1.sfba.home.com>
 <8ss92s$6fs$1@nnrp1.deja.com> <39F473DD.1CBAE902@cepsz.unizar.es>
 <wcczojupbc4.fsf@world.std.com> <39F5A744.CB20A0FD@cepsz.unizar.es>
 <wccwveqqrmd.fsf@world.std.com> <oHgL5.18$pq3.3347@news.flash.net>
 <87d7gikvnd.fsf@deneb.enyo.de>
NNTP-Posting-Host: 205.232.38.240
X-Article-Creation-Date: Tue Oct 31 01:48:49 2000 GMT
X-Http-User-Agent: Mozilla/4.61 [en] (OS/2; I)
X-Http-Proxy: 1.0 x68.deja.com:80 (Squid/1.1.22) for client 205.232.38.240
X-MyDeja-Info: XMYDJUIDrobert_dewar
Xref: supernews.google.com comp.lang.ada:1648
Date: 2000-10-31T01:48:49+00:00
List-Id: <comp.lang.ada>

In article <87d7gikvnd.fsf@deneb.enyo.de>,
  Florian Weimer <fw@deneb.enyo.de> wrote:
> "Ken Garlington" <Ken.Garlington@computer.org> writes:
>
> > : Oh, one last thing: a TM cannot "exist".  (Does that fall
under your
> > : definition of "do ANYTHING"?)  A TM has an infinitely long
tape, whereas
> > : we can only build machines with finite memories.

It is not true that a TM has an infinitely long tape (that's
a meaningless idea really), it has a sufficiently long tape.

And yes, we can build such a machine, we just keep building
more and more tape as it is needed :-)

That way we can keep the TM computing for as long as we like.


Sent via Deja.com http://www.deja.com/
Before you buy.