----------------------------------------------------------------------------------
@MSGID: RDRe.15325@fx06.iad>
47cb59d9
@REPLY: 1@dont-email.me> 99b6ea0d
@REPLYADDR Richard Damon
<Richard@Damon-Family.org>
@REPLYTO 2:5075/128 Richard Damon
@CHRS: CP866 2
@RFC: 1 0
@RFC-References: 3@dont-email.me>
1@dont-email.me> 1@dont-email.me> 1@dont-email.me>
1@dont-email.me> 1@dont-email.me> 1@dont-email.me>
1@dont-email.me> 1@dont-email.me> 2@dont-email.me>
1@dont-email.me> 1@dont-email.me> 1@dont-email.me>
1@dont-email.me>
@RFC-Message-ID:
RDRe.15325@fx06.iad>
@TZUTC: -0400
@PID: Mozilla Thunderbird
@TID: FIDOGATE-5.12-ge4e8b94
On 8/18/23 10:18 AM, olcott wrote:
> On 8/18/2023 2:10 AM, Mikko wrote:
>> On 2023-08-17 16:18:36 +0000, olcott said:
>>
>>> On 8/17/2023 10:04 AM, Mikko wrote:
>>>> On 2023-08-17 14:59:45 +0000, olcott said:
>>>>
>>>>> When I prove that you are wrong you simply stop talking because you
>>>>> never wanted any honest dialogue.
>>>>
>>>> You can`t know that until you prove me wrong.
>>>>
>>>> Mikko
>>>>
>>>
>>> // The following is written in C
>>> //
>>> 01 typedef int (*ptr)(); // pointer to int function
>>> 02 int H(ptr x, ptr y) // uses x86 emulator to simulate its input
>>> 03
>>> 04 int D(ptr x)
>>> 05 {
>>> 06 int Halt_Status = H(x, x);
>>> 07 if (Halt_Status)
>>> 08 HERE: goto HERE;
>>> 09 return Halt_Status;
>>> 10 }
>>> 11
>>> 12 void main()
>>> 13 {
>>> 14 H(D,D);
>>> 15 }
>>>
>>> *Execution Trace*
>>> Line 14: main() invokes H(D,D);
>>>
>>> *keeps repeating* (unless aborted)
>>> Line 06: 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 06.
>>>
>>> The lack of a reply showing how D correctly simulated by H can
>>> terminate normally *WILL BE CONSTRUED AS ADMISSION THAT YOU ARE WRONG*
>>
>> It is obvious that D cannot be correctly simuated ad infinitum or to
>> its termination.
>>
>> Mikko
>>
>
> *Thus you agree with this*
> D correctly simulated by H cannot possibly reach past its own line 06.
>
>
Only because there does not exist an H that gives a correct answer and
also correctly simulates the input.
Remember, the ACTUAL question, and not the strawman question you pose,
is about the actual behavior of the machine described by the input. Yes,
that behavior can be shown by an ACTUAL "Correct Simulation" (which
takes infinite time for a non-halting input).
Since every H that gives an answer for this input failed to correctly
simulate its input (since it stops before reaching a final state, and
thus is BY DEFINITION incorrect), and any H that does correctly simulate
this input (and never stops by your argument) fails to give an answer,
no H was able to answer based on ITS "correct simulation"
Since every H just talked about is different, every D that it was
deciding on was different, and thus none of the problems say anything
about any of the other problems you are looking out.
Not unless you are going to try to stipulate that two different things
are actually the same thing, which makes your logic inconsistent (and
exploded).
You are just asserting that you can correctly answer a question about
cats by answering about dogs.
YOU FAIL
--- Mozilla Thunderbird
* Origin: Forte - www.forteinc.com (2:5075/128)
SEEN-BY: 5001/100 5015/255 5019/40 5020/715 848
1042 4441 12000 5030/49 1081
SEEN-BY: 5058/104 5075/128
@PATH: 5075/128 5020/1042 4441