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,FREEMAIL_FROM, 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-08 10:20:13 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!nntp.abs.net!news.voicenet.com!nntp.upenn.edu!msunews!not-for-mail From: "Chad R. Meiners" Newsgroups: comp.lang.ada Subject: Re: Turing-undecidable languages (OT) Date: Wed, 8 May 2002 13:18:25 -0400 Organization: Michigan State University Message-ID: References: <7mWB8.6827$0z6.115522658@newssvr21.news.prodigy.com> Reply-To: "Chad R. Meiners" NNTP-Posting-Host: arctic.cse.msu.edu X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Xref: archiver1.google.com comp.lang.ada:23729 Date: 2002-05-08T13:18:25-04:00 List-Id: "Dmitry A. Kazakov" 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 clear that Turing Machines will oracles can solve the halting problem. The problem of course is building the oracle.