Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory,sci.logic
Subject: Re: D(D) simulated by H cannot possibly reach past its own line 03
Date: Sat, 4 May 2024 08:56:38 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <v15ba6$1m58$4@i2pn2.org>
References: <v12pgu$im12$1@dont-email.me> <v13p9h$phf4$1@dont-email.me>
 <v13tia$qers$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 4 May 2024 12:56:38 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="55464"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <v13tia$qers$1@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
Bytes: 3499
Lines: 75

On 5/3/24 7:55 PM, olcott wrote:
> On 5/3/2024 5:42 PM, olcott wrote:
>> On 5/3/2024 8:40 AM, olcott wrote:
>>> 00 int H(ptr x, ptr x)  // ptr is pointer to int function
>>> 01 int D(ptr x)
>>> 02 {
>>> 03   int Halt_Status = H(x, x);
>>> 04   if (Halt_Status)
>>> 05     HERE: goto HERE;
>>> 06   return Halt_Status;
>>> 07 }
>>> 08
>>> 09 void main()
>>> 10 {
>>> 11   H(D,D);
>>> 12 }
>>>
>>> We are examining the behavior of D(D) for every possible H/D pair
>>> where 1 to N steps of D(D) are simulated by H.
>>>
>>> *Execution Trace*
>>> Line 11: main() invokes H(D,D) that simulates D(D)
>>>
>>> *keeps repeating* (unless aborted)
>>> Line 01
>>> Line 02
>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>>>
>>> *Simulation invariant*
>>> D correctly simulated by H cannot possibly reach past its own line 03.
>>>
>>> (a) It is a verified fact that for every possible H/D pair where
>>> 1 to N steps of D(D) are simulated by H that this simulated D(D)
>>> cannot possibly reach past its own line 03.
>>
>> Since everyone is denying these facts on the basis that no one
>> here has a clue about what execution traces are and how they work
>> it makes no sense to go to the next step.
>>
> 
> The next step depends on this prior step and is trivially
> entailed by this prior step. When each D simulated by H
> of the infinite set of H/D pairs cannot possibly reach past
> its own line 03 then it cannot possibly reach its own line
> 06 and halt.
> 
> There is one more software engineering step that depends
> on the above steps and is trivially entailed by the above
> step. After this last software engineering step we begin
> to get into the computer science steps.
> 

And since that step is wrong, you need to go back and fix it.

Your (a) has been proven INCORRECT, and descriptions of TWO DIFFERENT 
methods that an H could use to get past there described.

Your ignoring them just proves you are just a pathological liar.


>>>
>>> (b) Rebuttals must show a counter example where 1 to N steps
>>> of D(D) are simulated by H and the simulated D(D) reaches past
>>> its own line 03.
>>>
>>> *Termination Analyzer H is Not Fooled by Pathological Input D*
>>> https://www.researchgate.net/publication/369971402_Termination_Analyzer_H_is_Not_Fooled_by_Pathological_Input_D
>>>
>>> *Fully operational code implemented in the x86utm operating system*
>>> https://github.com/plolcott/x86utm
>>>
>>>
>>>
>>
>