Path: ...!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: DDD incorrectly emulated by HHH is INCorrectly rejected as
 non-halting V2
Date: Mon, 15 Jul 2024 22:19:49 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <8d0fab68763bd35da54668a298476702839f0577@i2pn2.org>
References: <v6rg65$32o1o$3@dont-email.me>
 <97e0632d0d889d141bdc6005ce6e513c53867798@i2pn2.org>
 <v6sdlu$382g0$1@dont-email.me> <v6td3a$3ge79$1@dont-email.me>
 <v6tp1j$3imib$2@dont-email.me> <v6trdu$3irhh$1@dont-email.me>
 <v6tu01$3imib$11@dont-email.me>
 <a177dd76613794d6bb877c65ffe6c587a8f31bc1@i2pn2.org>
 <v6tvpv$3imib$14@dont-email.me>
 <091e8b7baeea467ee894b1c79c8943cb9773adb7@i2pn2.org>
 <v6u346$3khl8$1@dont-email.me>
 <16ac79611a441e7e01119631051f69119eee958a@i2pn2.org>
 <v6v06i$3pivt$1@dont-email.me>
 <23cb2d2401b87bf4f6a604aa1a78b93ffc9a29bc@i2pn2.org>
 <v6v2t1$3pmjn$3@dont-email.me>
 <3fc6548531f91ed14a27420caf9679a634573ed0@i2pn2.org>
 <v70lmo$61d8$1@dont-email.me> <v72lf4$k738$1@dont-email.me>
 <v738pr$mjis$15@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 16 Jul 2024 02:19:49 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="3273011"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <v738pr$mjis$15@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
Bytes: 2990
Lines: 35

On 7/15/24 9:39 AM, olcott wrote:
> On 7/15/2024 3:09 AM, Mikko wrote:
>> On 2024-07-14 14:00:55 +0000, olcott said:
>>
>>> According to the theory of computation the DDD that calls
>>> HHH(DDD) is not in the domain of HHH.
>>
>> The theory of computation does not say what the domain of HHH is.
> 
> Sure it does. Where the Hell have you been?
> It says that the halting problem is defined in terms
> of finite strings that encode Turing machines.
> 
>> Unless the specificaiton of HHH says otherwise HHH should be able
>> to handle every input that can be given to it, 
> 
> No halt decider is allowed to report on the computation
> that it is contained within for several different reasons
> one of them is that computations are not finite strings.

Only in the sense that you can't ask: Does the program that called you halt?

There is NO rule that says you can't ask does the machine DDD that just 
happens to call a copy of HHH halt.

After all, *ALL* machines is *ALL* machines. Remember ALL instances of a 
given machine behave the same, so you aren't asking about the DDD that 
is calling THIS HHH, but about all DDD that call the HHH that has the 
same code as this one.

> 
>> at least to the
>> extent that it says that the given input cannot be processed.
>>
>