No it doesn't, not for the *PROGRAM* P, which is what H is supposed to
be taking in.
>
> It therefore doesn't specify a complete computation,
SO you ADMIT that the input isn't actually the representation of P(P)?
>
> It knows you screwy and deceptive naming conventions on their ass.
> These hexadecimal bytes are the stipulated as the input to H and H1.
> 558bec8b4508508b4d0851e840feffff83c40885c07402ebfe5dc3
But if it isn't representing P(P), then WHO CARES!!
We are interested in seeing if H can get the right answer to P(P) (or H^
applied to <H^>)
if this input doesn't actually represent P, then what use is it?
>
>> so NO that is not the only thing you're referring to. The H that it
>> calls is a part of it and is therefore immutable. So YES, H is Ha and
>> P is Pa because the fixed algorithm of H aborts and P calls this fixed H.
>>
>
> These are verified facts:
> H(P,P)==false is provably correct.
> Ha(P,P)==true is provably correct.
Since you just said the input doesn't fully specify P, who cares.
we need to give H that ACTUAL representation of the PROGRAM P and the
input to P of that same representation.
>
>> You seem to be using this to say:
>>
>> For each i: because each Hi(Pi,Pi) == false, and because Hn(Pn,Pn)
>> does not halt, then each Hi(Pi,Pi) == false is correct.
>>
>> Each Pi is distinct from each other, and each Hi is distinct from each
>> other. That each Hi is unable to simulate the Pi built from it to a
>> final state proves nothing regarding whether each of them is correct
>> to return false. "Hello world" and Minesweeper are not the same
>> program, so one can't be used to make conclusions about the other.
>>
>>
>>>>
>>>> For a separate H that never aborts which we'll call Hn, and Pn which
>>>> calls that Hn, infinite simulation *does* happens so Ha(Pn,Pn) does
>>>> correctly report non-halting. Your error is that you think this has
>>>> anything to do with Ha(Pa,Pa) which is the case that matters.
>>>>
>>>>>>>
>>>>>>> 558bec8b4508508b4d0851e840feffff83c40885c07402ebfe5dc3
>>>>>>>
>>>>>>> _P()
>>>>>>> [000009d6](01) 55 push ebp
>>>>>>> [000009d7](02) 8bec mov ebp,esp
>>>>>>> [000009d9](03) 8b4508 mov eax,[ebp+08]
>>>>>>> [000009dc](01) 50 push eax // push P
>>>>>>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>> [000009e0](01) 51 push ecx // push P
>>>>>>> [000009e1](05) e840feffff call 00000826 // call H
>>>>>>> [000009e6](03) 83c408 add esp,+08
>>>>>>> [000009e9](02) 85c0 test eax,eax
>>>>>>> [000009eb](02) 7402 jz 000009ef
>>>>>>> [000009ed](02) ebfe jmp 000009ed
>>>>>>> [000009ef](01) 5d pop ebp
>>>>>>> [000009f0](01) c3 ret // Final state
>>>>>>> Size in bytes:(0027) [000009f0]
>>>>>>>>>
>>>>>>>>> Why is it so hard to understand that H(P,P) must provide the
>>>>>>>>> halt status
>>>>>>>>> of its actual input on the basis of the actual behavior
>>>>>>>>> specified by
>>>>>>>>> this actual input?
>>>>>>>>
>>>>>>>> The *definition* of the problem states that the actual behavior
>>>>>>>> of the actual input to H(P,P) is P(P).
>>>>>>> Whomever wrote that definition also knows that
>>>>>>>
>>>>>>> THIS IS SET IN STONE:
>>>>>>> All deciders only compute the mapping from their input parameters
>>>>>>> to an
>>>>>>> accept/reject state on the basis of the actual properties actually
>>>>>>> specified by this input
>>>>>>
>>>>>> Which in the case of H(P,P) is *defined* to be P(P)
>>>>> In this case it is the same as if {dogs} are defined to be {cats}.
>>>>
>>>> Again, no rebuttal, just a bad analogy.
>>>>
>>>>>>
>>>>>>>
>>>>>>> THIS LOGICALLY FOLLOWS FROM THAT:
>>>>>>> Since a halt decider is a type of decider this means that all halt
>>>>>>> deciders only compute the mapping from their input parameters to an
>>>>>>> accept/reject state on the basis of the actual behavior actually
>>>>>>> specified by this input.
>>>>>>
>>>>>> Which in the case of H(P,P) is *defined* to be P(P)
>>>>>>
>>>>> In this case it is the same as if {dogs} are defined to be {cats}.
>>>>> If anyone assigns non-decider properties to a decider they are
>>>>> wrong in
>>>>> the same way that it is wrong to assign {cat} properties to a {dog}.
>>>>
>>>> And again no rebuttal, just a bad analogy. Given that this is the
>>>> third time you've done this, I'll take this as an admission of defeat.
>>> It is a verified fact that at least Linz claims that H must report on Ĥ
>>> applied to ⟨Ĥ⟩.
>>
>> As it is required to.
>>
>>>
>>>
>>> It is also a verified fact that this same requirement directly
>>> contradicts the definition of decider that must map its actual inputs to
>>> an accept/reject state based on the actual behavior of these actual
>>> inputs.
>>
>> It does not, because the actual behavior of the actual inputs is
>> defined to be the machine that those inputs represent.
>
> I have a guy that I want you to arrest, his name is in my head.
> I am going to write down the name of some other guy, but I want
> you to arrest the guy who is named in my head. I won't tell you
> his name.
Yep, that is an impossible problem, JUST LIKE THE HALTING PROBLEM IS.
>
> All halt deciders only compute the mapping from their inputs to their
> own accept/reject state on the basis of the actual behavior actually
> specified by the correct simulation of this input by the halt decider.
And the ACTUAL BEHAVIOR of their input is DEFINED as the running of the
program that input represents. Just because H can't recreate it doesn't
make that definition untrue, just impossible.
Like you actually thinking.
>
>>
>>>
>>> When the author or a textbook disagrees with computer science
>>> definitions it is not computer science that is on the losing side of
>>> this.
>>
>> It doesn't. You just don't understand the definitions.
>>
>>
>
>