Sujet : Re: ZFC solution to incorrect questions: reject them --discourse context --
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : sci.logic comp.theoryDate : 18. Mar 2024, 08:32:48
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <ut8n6g$27bqb$15@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
User-Agent : Mozilla Thunderbird
On 3/17/24 10:32 PM, olcott wrote:
On 3/17/2024 11:49 PM, immibis wrote:
On 18/03/24 05:40, olcott wrote:
When H1 says YES it is right.
When H says YES it is wrong.
>
Any halt decider is right to say YES on the input (D,D) if and only if D(D) halts.
>
*When H(D,D) says YES D gets stuck at line 05*
Can D correctly simulated by H terminate normally?
01 int D(ptr x) // ptr is pointer to int function
02 {
03 int Halt_Status = H(x, x);
04 if (Halt_Status)
05 HERE: goto HERE;
06 return Halt_Status;
07 }
08
09 void main()
10 {
11 D(D);
12 }
So?
You seemed to have missed the precondition.
For a given H::
A D(D) will only halt if H(D,D) returns 0.
If H(D,D) will return 1, then D(D) will not halt and the correct answer is 0
So, for a GIVEN input D, which means defining it, and thus DEFINING its H, we have a correct answer, which will happen to be the opposite of what that H says.
You don't seem to understand that fundamental principle of Computations, that programs do what they do and only what they do, and we don't have a program until we have defined it. (and any subprograms it uses).
This is what puts H in its bind. It has to be defined first, and then H^/D gets to use its copy of H to defeat H. Sort of like having to opponets play book and signals for the game.