Re: At least 100 people kept denying the easily verified fact -- closure

On 6/7/2024 6:57 PM, Richard Damon wrote:

On 6/7/24 7:51 PM, olcott wrote:

On 6/7/2024 6:21 PM, joes wrote:

Am Fri, 07 Jun 2024 17:35:24 -0500 schrieb olcott:
>

On 6/7/2024 5:22 PM, joes wrote:

Am Fri, 07 Jun 2024 17:11:00 -0500 schrieb olcott:

That it is literally impossible to prove that the following is false
conclusively proves that it is true and the proof really need not be
wrapped in any tuxedo.

Why do you care about rebuttals if you don't even consider them possible?
>

>
Until other people understand that I am correct my words are
too difficult to be understood making publication impossible.
>

We can get on to other key points only after we have closure on this
{foundation of simulating halt deciders} point.

What do you need closure for? You only want agreement.

I must get closure on each of the four points of my proof so that I know
that my words can possibly be understood. Without this publication is
hopeless.

Publication IS hopeless. As far as your words can be understood, they are
wrong. You could just post all of them.
>

>
My words only seem wrong on the basis of a false religious
belief of the nature of correct simulation.
>

 Nope, most of your words are just wrong. (at least when you try to talk about the actual theorems you are talking about).
 

That by itself shows a reckless disregard for the truth when
taken within the context that you refuse to even look at the
proof that my most important words are correct.
On 6/5/2024 10:58 PM, Richard Damon wrote:
 > On 6/5/24 11:44 PM, olcott wrote:
 >>
 >> THIS IS ALL THAT YOU WILL EVER GET TO TALK
 >> TO ME ABOUT UNTIL YOU ACKNOWLEDGE THAT
 >> I AM CORRECT OR YOU PROVE THAT I AM INCORRECT
 >
 > But, as I said, I won't acknowledge that you
 > are correct, because I am not willing to put
 > that effort into your worthless claim.
 >
The proof that you refuse to look at proves that my notion of
a simulating halt decider does apply to the halting problem
proofs. There is one more step to make this proof complete.
That you say my "words are just wrong" making sure to not
look at the proof that they are correct <is> actionable.
What would your pastor think about you telling these lies?
Try to show how this DD correctly simulated by any HH ever
stops running without having its simulation aborted by HH.
_DD()
[00001e12] 55         push ebp
[00001e13] 8bec       mov  ebp,esp
[00001e15] 51         push ecx
[00001e16] 8b4508     mov  eax,[ebp+08]
[00001e19] 50         push eax      ; push DD
[00001e1a] 8b4d08     mov  ecx,[ebp+08]
[00001e1d] 51         push ecx      ; push DD
[00001e1e] e85ff5ffff call 00001382 ; call HH
A {correct simulation} means that each instruction of the
above x86 machine language of DD is correctly simulated
by HH and simulated in the correct order.
Anyone claiming that HH should report on the behavior
of the directly executed DD(DD) is requiring a violation
of the above definition of correct simulation.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer