Liste des Groupes | Revenir à c theory |
On 4/29/2025 3:23 PM, Richard Heathfield wrote:Presumably you mean that the Turing machine on tape P, given tape D as input, doesn't halt.On 29/04/2025 20:57, olcott wrote:int DD()On 4/29/2025 10:33 AM, Fred. Zwarts wrote:>
<snip>
>>makes it impossible for H to see the behaviour of P(D).>
The behaviour of P(D) does not change, but H does not see it.
H MUST REPORT ON THE BEHAVIOR THAT IT DOES SEE
H has the whole P tape and the whole D tape at its disposal. There is nothing it can't inspect.
>
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
When P has a pathological relationship
to H, the input to H(P,D) DOES NOT HALT.
Absolutely.Not being able to see how P behaves in simulation is no excuse for getting the answer wrong.THEN...
I am thinking of the sum of two integers
not telling you what these integers are
is no excuse for you not providing their correct sum.
I'm ignoring most of your nonsense, if that's what you mean.If because of limitations in H it fails to spot behaviour that would have changed its report on P(D), that just means that H is broken.You are simply not bothering to pay complete attention.
>
But don't bother trying to fix it. Turing has already proved that you can't.
>
Les messages affichés proviennent d'usenet.