Re: Proof that H(D,D) meets its abort criteria --self-evident truth--

On 3/16/24 9:42 PM, olcott wrote:

On 3/16/2024 11:28 PM, Richard Damon wrote:

On 3/16/24 9:13 PM, olcott wrote:

On 3/16/2024 10:57 PM, Richard Damon wrote:

On 3/16/24 7:52 PM, olcott wrote:

On 3/16/2024 9:43 PM, Richard Damon wrote:

On 3/16/24 5:50 PM, olcott wrote:

On 3/16/2024 7:21 PM, Richard Damon wrote:

On 3/16/24 8:29 AM, olcott wrote:

On 3/15/2024 11:29 PM, Richard Damon wrote:

On 3/15/24 8:45 PM, olcott wrote:

H(D,D) fails to make the required mistake of reporting on what it does not see.

>
But it DOES make a mistake, because it does answer the question correctly.
>
You are just PROVING you think lying is ok.
>
You TOTALLY don't understand the meaning of truth.
>
You are REALLY just a Pathological Liar, as you have no concept of real truth,
>

>
The original halt status criteria has the impossible requirement
that H(D,D) must report on behavior that it does not actually see.
Requiring H to be clairvoyant is an unreasonable requirement.
*The criteria shown below eliminate the requirement of clairvoyance*
>
(a) If simulating halt decider H correctly simulates its input D until
H correctly determines that its simulated D would never stop running
unless aborted then
>
*H correctly simulates its input D until*
Means H does a correct partial simulation of D until H correctly
matches the recursive simulation non-halting behavior pattern.
>
>

>
But turning out to be impposible, doesn't make it incorrect or invalid.

>
*You seems to be ridiculously disingenuous about the self-evident truth*
For every possible way that H can be encoded and D(D) calls H(D,D) either H(D,D) aborts its simulation or D(D) never stops running.
>
>

>
And you are incredably stupid to not see this doesn't prove what you need it to.
>
Yes, if you define H to not abort, the we get a non-haltig D(D), but H doesn't answwer.
>
But, if you define H to abort, then,

>
We see that you changed the subject away from:
[Proof that H(D,D) meets its abort criteria]
>

>
Nope.

>
H is an algorithm that simulates its input and correctly
determines whether or not it needs to abort this simulation.
That is all that this thread's H does.
>
>
>

And what defines "Need"?
>

It is the set of every implementation of its spec:
(a) H(D,D) Simulate input.
(b) Determine if it needs to stop simulating its input to prevent
the simulated D(D) from never halting.
 

And thus not a specific algorithm?
Again, HOW do you determine NEED?
That is not an algorithmic step.
We can only verify that in retrospect.
And we can't "change" H to do that, since each H does what it does, and since each H generates a DIFFERENT input, we need to verify each individually.
For that Hs that Halt, we will see that all of them abort. The only way to see if that abort was needed, we need to hypothectically look at the correct simulation of that input to see if it halts, which it does, and thus H didn't NEED to abort, so those elements failed to meet the requirements.
WE then seem to end up with an empty set of Hs