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.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,c42dbf68f5320193
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-05-09 01:52:31 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news.tele.dk!small.news.tele.dk!193.174.75.178!news-fra1.dfn.de!fu-berlin.de!uni-berlin.de!213.54.196.30!not-for-mail
From: Dmitry A.Kazakov <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: Re: Turing-undecidable languages (OT)
Date: Thu, 9 May 2002 22:56:55 +0200
Message-ID: <abddca$h96t0$1@ID-77047.news.dfncis.de>
References: <ab93tl$2etb$1@msunews.cl.msu.edu>
 <ab9fmh$2qh1$1@msunews.cl.msu.edu>
 <ionhduku9trnt8pdm11ovutkp7g8jb0bjd@4ax.com>
 <abbmo6$1osf$1@msunews.cl.msu.edu>
Reply-To: mailbox@dmitry-kazakov.de
NNTP-Posting-Host: 213.54.196.30
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7Bit
X-Trace: fu-berlin.de 1020934348 18127776 213.54.196.30 (16 [77047])
User-Agent: KNode/0.4
Xref: archiver1.google.com comp.lang.ada:23757
Date: 2002-05-09T22:56:55+02:00
List-Id: <comp.lang.ada>

Chad R. Meiners wrote:

> "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> wrote in message
> news:ionhduku9trnt8pdm11ovutkp7g8jb0bjd@4ax.com...
>> Surely but only if Y would do no I/O and thus have no connection to
>> some external sources of knowledge. Consider a program that insolently
>> asks the operator, "hey, maybe you know the answer"? (:-))
> 
> How would that be different from using an oracle? 

It is not different and we are permanently doing so by asking small oracles 
like hardware random generators, timers etc in our programs.

> It is clear that Turing
> Machines will oracles can solve the halting problem.  The problem of
> course is building the oracle.

Yes. The point is that often the term "program" is ill-defined leaving 
enough room for discussions which otherwise would have no place. If I 
correctly understood it, Tom considers a problem regading programs of fixed 
size, while opponents attack him with the results valid for infinite cases.

-- 
Regards,
Dmitry Kazakov
www.dmitry-kazakov.de