Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Mikko <mikko.levanto@iki.fi>
Newsgroups: comp.theory
Subject: Re: DDD correctly emulated by HHH is Correctly rejected as non-halting V2
Date: Tue, 16 Jul 2024 10:47:08 +0300
Organization: -
Lines: 38
Message-ID: <v758hs$163gs$1@dont-email.me>
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: 8bit
Injection-Date: Tue, 16 Jul 2024 09:47:09 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="99a13b02fce255176e717749a711055d";
	logging-data="1248796"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19c4ntZ1iZC8SPbWd6rO/2B"
User-Agent: Unison/2.2
Cancel-Lock: sha1:vSQRFPaipJkzfuC3YQjl6sm8YUc=
Bytes: 2929

On 2024-07-15 13:39:07 +0000, olcott said:

> 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.

No, it does not. The halting problem is not a part of any theory of
computation. It is a question that one maight expect the theory of
computation to answer.

Note that the halting problem does not specify how Turing machines
should be encoded to finite strings. It meresly requires that the
solution includes encoding rules so that every Turing machine can be
encoded.

>> 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.

The halting problem requires that every Turing machine computation
can be given as input.

A partial halt decider may fail to answer for some computations.

-- 
Mikko