Sujet : Re: DDD correctly emulated by HHH is Correctly rejected as non-halting V2
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 15. Jul 2024, 14:39:07
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v738pr$mjis$15@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
User-Agent : Mozilla Thunderbird
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.
at least to the
extent that it says that the given input cannot be processed.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer