Re: The philosophy of computation reformulates existing ideas on a new basis --- EQUIVOCATION

On 11/3/24 5:11 PM, olcott wrote:

On 11/3/2024 4:04 PM, joes wrote:

Am Sun, 03 Nov 2024 09:16:39 -0600 schrieb olcott:

On 11/3/2024 8:32 AM, joes wrote:

Am Sat, 02 Nov 2024 20:33:40 -0500 schrieb olcott:

On 11/2/2024 8:22 PM, Richard Damon wrote:

On 11/2/24 9:00 PM, olcott wrote:

On 11/2/2024 7:52 PM, Richard Damon wrote:

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

On 11/2/2024 7:21 PM, Richard Damon wrote:

On 11/2/24 5:13 PM, olcott wrote:

On 11/2/2024 3:24 PM, Richard Damon wrote:

On 11/2/24 12:56 PM, olcott wrote:

On 11/2/2024 10:44 AM, Richard Damon wrote:

On 11/2/24 8:24 AM, olcott wrote:

>

Of course, that is for this exact input, which uses the copy of
H that does abort and return.
>

No it is not.
     when HHH simulates DDD(), it's analyzing an "idealized"
     version of DDD() where nothing stops the recursion.

In other words you are admitting that it isn't actually looking
at the input it was given.

ChatGPT (using its own words) and I both agree that HHH is
supposed to predict the behavior of the infinite emulation on the
basis of its finite emulation.

LLMs literally string words they have previously seen together.
>

Yes, but that behavior is DEFINED by the actual behavior of the
actual machine.

No it is not. It is never based on the actual behavior of the actual
machine for any non-terminating inputs.

Haha what? It absolutely is. For a nonterminating input a halting
decider must return that it doesn't halt.

>
>

Then you don't undetstand the requirement for something to be a
semantic property.

The actual behavior specified by the finite string input to HHH does
include HHH emulating itself emulating DDD such that this DD *not some
other DDD somewhere else*

Especially not some DDD that calls a non-aborting simulator HHH1.

*HHH1 has identical source code to HHH*

Ok great, let's just exchange them then. How does HHH1 simulate
EEE(){HHH1(EEE);} and FFF(){HHH(DDD);}?
>

DDD emulated by HHH CANNOT POSSIBLY reach its own return instruction.
DDD emulated by HHH1 DOES REACH its own return instruction.

Hm, the program under test is the same here. The difference must be in
the testing program.
>

 It is the fact that in all of the conventional HP proofs
the input does call its own decider. Maybe you didn't
know that?
 

No, but the family you are thinking of has the program the input represents call the decider it is designed to foil. NOT "its own" as it doesn't "own" that decider, so when you hypothosize changing that decider to one that doesn't abort, the input still calls the one that does.
That is ONE SPECIFIC program, that doesn't change if we give this to a different decider, like you hypothitical non-aborting version.
A given input only prove ONE decider wrong, but we show we can build such an input for ANY decider, these EVERY decider has an input it gets wrong.
This sophistication seems beyond your logical processing ability.