Liste des Groupes | Revenir à c theory |
Op 19.jul.2025 om 17:50 schreef olcott:I could equally "point out" that all cats are dogs.On 7/19/2025 2:50 AM, Fred. Zwarts wrote:>
No, the error in your definition has been pointed out to you many times.
When the aborting HHH is simulated correctly, without disturbance, it reaches the final halt state.
*Best selling author of theory of computation textbooks*>No rebuttal, but repeated counter-factual claims.
This trivial C function is the essence of my proof
(Entire input to the four chat bots)
>
<input>
typedef void (*ptr)();
int HHH(ptr P);
>
void DDD()
{
HHH(DDD);
return;
}
>
int main()
{
HHH(DDD);
}
>
Termination Analyzer HHH simulates its input until
it detects a non-terminating behavior pattern. When
HHH detects such a pattern it aborts its simulation
and returns 0.
</input>
>No, we see that the detection of non-termination is the input for the chat-box, not its conclusion.
All of the chat bots figure out on their own that the input
to HHH(DDD) is correctly rejected as non-halting.
>Wich is counter-factual, because we know that HHH aborts before this happens.
https://chatgpt.com/c/687aa48e-6144-8011-a2be-c2840f15f285
*Below is quoted from the above link*
>
This creates a recursive simulation chain:
HHH(DDD)
-> simulates DDD()
-> calls HHH(DDD)
-> simulates DDD()
-> calls HHH(DDD)
-> ...
Les messages affichés proviennent d'usenet.