Re: Hypothetical possibilities --- Complete FAILED Proof -- more details

On 8/2/24 11:30 PM, olcott wrote:

On 8/2/2024 8:19 PM, Mike Terry wrote:

On 02/08/2024 23:42, Ben Bacarisse wrote:

Mike Terry <news.dead.person.stones@darjeeling.plus.com> writes:
>

Of course these traces don't support PO's overall case he is claiming,
because the (various) logs show that DDD halts, and that HHH(DDD) reports
DDD as non-halting, exactly as Linz/Sipser argue. Er, that's about it!

>
PO certainly used to claim that false (non-halting) is the correct
result "even though DDD halts" (I've edited the quote to reflect a name
change).  Unless he's changed this position, the traces do support his
claim that what everyone else calls the wrong answer is actually the
right one.
>

>
So, in your opinion, what do you believe is PO's criterion for "correct result", exactly?  It would be handy if you can give a proper mathematical definition so nobody will have any doubt what it is. Hey, I know you're more than capable of getting a definition right, so let's have that definition!
>
Definition:  A TM P given input I is said to "halt" iff ?????
              or whatever...
>
It's easy enough to say "PO has his own criterion for halting, which is materially different from the HP condition, and so we all agree PO is correct by his own criterion, but that does not say anything about the HP theorem because it is different from the HP definition".
>
But is that /really/ something PO agrees with?  I don't think so somehow, because I'm pretty sure PO believes his claim "refutes" the HP result.  He wouldn't say that if he freely acknowleded that he had invented a completely different definition for halting.  Also, for what you're saying to be the right way of looking at things, PO would have to admit that the HP proof with its standard definition of halting is valid, and that there is nothing wrong with the Linz proof, other than it not applying to his own favourite PO-halting definition.
>
I.e. I think your way of looking at it is a bit "too easy" - but I'd be happy to be convinced! Personally I suspect PO has no such "new and different definition" and that anything along those lines PO is thinking of will be quite incoherent.  No doubt you could make some definition that is at least coherent but we have to ask ourselves - is that definition /really/ what PO is thinking???
>
Nowadays, I think PO's position is more that:
-  yes, DDD() halts when run directly
-  but DDD() when it runs inside HHH simulator /really/ does not halt, in some kind of
    sense that it /really/ has infinite recursion which would never end
    however far it was simulated (because it "exhibits" infinite recursion in some way)
-  and yes, DDD() /does/ halt when simulated within UTM(DDD),
-  but the behaviour of DDD depends on who is simulating it.  It terminates when
    UTM simulates it, but doesn't terminate when HHH simulates it, due to some
    kind of pathelogical relationship specifically with HHH.  This difference in
    simulation is /more/ than one simulator aborting earlier than the other...
>
>
Mike.
>

 There are zero flaws in my logic that DDD correctly emulated
by HHH cannot possibly reach its own return instruction,
thus never halts.
 void DDD()
{
   HHH(DDD);
   return;
}
 Deciders only operate on finite string inputs and never
have operated on executing Turing Machines. This is the
key mistake that everyone including Linz has made.

Right, they can't see the actual Turing Machine, but need to decide on what said machine will do.

 This means that the behavior of DDD emulated by HHH
according to the x86 semantics of DDD and HHH <is> the
deciding factor and the behavior of the directly executed
DDD() has always been moot.

No, it means the behavior of the x86 instructions of DDD as CORRECTLY and fully) emulated determine the behavior of the input. If HHH doesn't do that, it just isn't a correct emulator, and its results are not determinative of the answer.

 Everyone that disagreed that the simulation is correct is
disagreeing with the semantics of the x86 language and
that is not allowed.

Nope, Sine your HHH doesn't correct simulate a call instruction to follow the code in HHH just proves it is wrong. The fact you have been unable to present this trace is evidence of you lies. The only trace into HHH that you have presented is the trace of HHH itself done by your x86UTM, NOT the trace that HHH itself creates

 It is easy to assume that the behavior of the correctly
emulated input must be the same as the direct execution
because this <is> that way that it has worked with every
other computation. This <is> proven to be a false assumption.
 

WRONG, it is the DEFINITION. If you want to claim differently, what is the first instruction that HHH actually correctly emulates that differs from the result of its direcr execution. This has been asked before, and you failure to provide it just proves that is a knowingly false claim, aka a LIE, that you DELIBERATELY are making to prove your bigger lie.
Sorry, YOU are proven to be a false assumption maker, aka a LIAR.