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
Subject: Re: Defining a correct simulating halt decider
Date: Sat, 7 Sep 2024 10:34:11 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <bdb5393b4d3bd3fc539eddcce69ed75f31ca074f@i2pn2.org>
References: <vb4plc$2tqeg$1@dont-email.me> <vb6o5t$3a95s$1@dont-email.me>
 <vb71a3$3b4ub$4@dont-email.me> <vbbmuc$8nbb$1@dont-email.me>
 <vbcbe4$bdtb$3@dont-email.me> <vbeoge$q2ph$1@dont-email.me>
 <vbeprp$punj$7@dont-email.me>
 <c600a691fab10473128eed2a1fad2a429ad4733f@i2pn2.org>
 <vbh2sp$19ov0$1@dont-email.me> <vbhm3c$1c7u5$12@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 7 Sep 2024 14:34:11 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1176478"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <vbhm3c$1c7u5$12@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 4196
Lines: 72

On 9/7/24 9:57 AM, olcott wrote:
> On 9/7/2024 3:29 AM, Mikko wrote:
>> On 2024-09-07 05:12:19 +0000, joes said:
>>
>>> Am Fri, 06 Sep 2024 06:42:48 -0500 schrieb olcott:
>>>> On 9/6/2024 6:19 AM, Mikko wrote:
>>>>> On 2024-09-05 13:24:20 +0000, olcott said:
>>>>>> On 9/5/2024 2:34 AM, Mikko wrote:
>>>>>>> On 2024-09-03 13:00:50 +0000, olcott said:
>>>>>>>> On 9/3/2024 5:25 AM, Mikko wrote:
>>>>>>>>> On 2024-09-02 16:38:03 +0000, olcott said:
>>>>>>>>>
>>>>>>>>>> A halt decider is a Turing machine that computes the mapping from
>>>>>>>>>> its finite string input to the behavior that this finite string
>>>>>>>>>> specifies.
>>>>>>>>>
>>>>>>>>> A halt decider needn't compute the full behaviour, only whether
>>>>>>>>> that behaviour is finite or infinite.
>>>>>>>>>
>>>>>>>> New slave_stack at:1038c4 Begin Local Halt Decider Simulation
>>>
>>>>>>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>>>>>>>>
>>>>>>>> Hence  HHH(DDD)==0 is correct
>>>>>>>
>>>>>>> Nice to see that you don't disagree with what said.
>>>>>>> Unvortunately I can't agree with what you say.
>>>>>>> HHH terminates,
>>>>>>> os DDD obviously terminates, too. No valid
>>>>>>
>>>>>> DDD emulated by HHH never reaches it final halt state.
>>>>>
>>>>> If that iis true it means that HHH called by DDD does not return and
>>>>> therefore is not a ceicder.
>>>> The directly executed HHH is a decider.
>>> What does simulating it change about that?
>>
>> If the simulation is incorrect it may change anything.
>>
> PATHOLOGICAL RELATIONSHIPS CHANGE BEHAVIOR
> PATHOLOGICAL RELATIONSHIPS CHANGE BEHAVIOR
> PATHOLOGICAL RELATIONSHIPS CHANGE BEHAVIOR
> PATHOLOGICAL RELATIONSHIPS CHANGE BEHAVIOR
> PATHOLOGICAL RELATIONSHIPS CHANGE BEHAVIOR
> 

No, the behavior was always there.

The D that calls H and does the opposite has FIXED behavior for a given 
H, and it doesn't matter if we ask H or H1 what that behavior is, it is 
always the same, because it was determined by what that PARTICULAR H 
that it was built on did with that input.

The fact that H can't get the right answer doesn't change what the right 
answer is.

You are just proving you are nothing but a stupid liar that doesn't knpw 
what he is talking about.

Since you can't show the actual step where HHH CORRECTLY emulates an 
instruction to get different behavior, you statement is just a 
PATHOLOGICAL LIE.

The fact that is seems you don't even TRY to find the answer, proves you 
are just intentionally ignorant and don't care about what is true.

The fact that you think that a "Call" instruction can do anything but 
enter into the function called, just proves you are totally ignorant, 
and the fact that you think the x86 language says that a call HHH does 
ANYTHING but actualy execute the instructions in HHH just shows that you 
are nothing but an ignorant liar.

Sorry, that is the facts, something you seem to be allergic to.