Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: dbush <dbush.mobile@gmail.com>
Newsgroups: comp.theory
Subject: Re: Every sufficiently competent C programmer knows --- Semantic
 Property reiterated
Date: Thu, 13 Mar 2025 14:03:56 -0400
Organization: A noiseless patient Spider
Lines: 38
Message-ID: <vqv6mb$3kfru$2@dont-email.me>
References: <vqntaq$1jut5$1@dont-email.me> <vqp388$1tvqa$1@dont-email.me>
 <vqpdv9$202b2$2@dont-email.me> <vqperb$20c9k$2@dont-email.me>
 <E6mcnWv3nMa66036nZ2dnZfqnPWdnZ2d@brightview.co.uk>
 <vqpv2u$23vhr$1@dont-email.me>
 <Ny-dnRlMHcVpA036nZ2dnZfqnPqdnZ2d@brightview.co.uk>
 <878qp9gckd.fsf@bsb.me.uk> <vquvvs$3dmpj$2@dont-email.me>
 <vqv061$3clv8$3@dont-email.me> <vqv1ne$3dmpj$3@dont-email.me>
 <vqv216$3clv8$4@dont-email.me> <vqv3hg$3dmpj$4@dont-email.me>
 <vqv3t3$3clv8$5@dont-email.me> <vqv5dl$3dmpj$5@dont-email.me>
 <vqv5gh$3j2v7$1@dont-email.me> <vqv5vm$3kabb$1@dont-email.me>
 <vqv630$3kfru$1@dont-email.me> <vqv6j2$3km67$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Thu, 13 Mar 2025 19:03:55 +0100 (CET)
Injection-Info: dont-email.me; posting-host="a54c008eec5b2f1783ae744a985360b6";
	logging-data="3817342"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/CSLap+oJXQEMx6qWK4Cya"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:MOz/LzwmHVj5xnmGrtM3jfVc9dY=
In-Reply-To: <vqv6j2$3km67$1@dont-email.me>
Content-Language: en-US
Bytes: 2988

On 3/13/2025 2:02 PM, olcott wrote:
> On 3/13/2025 12:53 PM, dbush wrote:
>> On 3/13/2025 1:51 PM, olcott wrote:
>>> On 3/13/2025 12:43 PM, dbush wrote:
>>>>
>>>> It is by the stipulated definition of a solution to the halting 
>>>> problem:
>>>>
>>>>
>>>> Given any algorithm (i.e. a fixed immutable sequence of 
>>>> instructions) X described as <X> with input Y:
>>>>
>>>> A solution to the halting problem is an algorithm H that computes 
>>>> the following mapping:
>>>>
>>>> (<X>,Y) maps to 1 if and only if X(Y) halts when executed directly
>>>> (<X>,Y) maps to 0 if and only if X(Y) does not halt when executed 
>>>> directly
>>>>
>>>
>>> WHEN THE STIPULATED DEFINITION OF [HALT DECIDER]
>>> CONTRADICTS THE STIPULATED DEFINITION OF [DECIDER]
>>> IT IS WRONG.
>>>
>>
>> Then it's a good thing we're talking about a solution to the halting 
>> problem instead of a decider.
> 
> In other words you have no idea that the halting
> problem requires a halt decider and a halt decider
> must be a decider. Your ignorance is not my mistake.
> 

Your claim was that something that satisfies the definition of a 
solution to the halting problem doesn't satisfy the definition of a 
decider.  We fixed that by not calling it a decider.

Happy?