Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: Refutation of the Halting Problem Assuming the Self-Referential
 Paradox is a Category Error --- Linz Proof
Date: Sat, 26 Apr 2025 16:34:28 -0500
Organization: A noiseless patient Spider
Lines: 45
Message-ID: <vujjh5$35hcg$8@dont-email.me>
References: <HLbPP.1552551$Kb9a.668758@fx16.ams4>
 <vujj1c$35hcg$5@dont-email.me> <vujj9t$32om9$4@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 26 Apr 2025 23:34:30 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="9742630c956e796e93c0a1f147f3a807";
	logging-data="3327376"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+UeYfz9xvRFmfPu1U4n/YN"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:dQ9sQKlHq6ccf4gMz1U5Zc8UqS0=
Content-Language: en-US
In-Reply-To: <vujj9t$32om9$4@dont-email.me>
X-Antivirus: Norton (VPS 250426-4, 4/26/2025), Outbound message
X-Antivirus-Status: Clean

On 4/26/2025 4:30 PM, dbush wrote:
> On 4/26/2025 5:26 PM, olcott wrote:
>> On 4/26/2025 3:56 PM, Mr Flibble wrote:
>>> Refutation of the Halting Problem Assuming the Self-Referential 
>>> Paradox is
>>> a Category Error in All Computational Models and the Mathematical 
>>> Universe
>>> Hypothesis is True
>>>
>>
>> Yes and you are one of three people in the world that knows this.
>> You acquired expertise about this in about a year where most
>> people are indoctrinated into "received view" by mindless conformity.
>> Even Christ knew that people are sheep.
>>
>> The other thing about the Halting Problem is that
>> a simulating halt decider proves that the contradictory
>> part has always been unreachable code.
>>
>> When we apply the finite string transformation rules
>> specified by the Turing Machine language to the input
>> to the Linz proof 
> 
> Which starts with the assumption that an H exists that computes the 
> following mapping:
> 
> 
> 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
> 
> 

THAT IS NOT ALLOWED because that cannot possibly be derived
by applying the finite string transformation rules specified
by the x86 language to the input to HHH(DD).

-- 
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer