Liste des Groupes | Revenir à c theory |
On 3/29/2025 3:45 PM, Fred. Zwarts wrote:We can ask whether we can create a hammer that can hit all possible nails on the head. It can be proven that no such hammer exists, because we can always attach a nail to the hammer upside down, so that the hammer cannot hit it on its head.Op 29.mrt.2025 om 20:03 schreef olcott:A termination analyzer cannot reject itself, yet it canOn 3/29/2025 10:23 AM, dbush wrote:>On 3/29/2025 11:12 AM, olcott wrote:>On 3/28/2025 11:00 PM, dbush wrote:>On 3/28/2025 11:45 PM, olcott wrote:>>>
It defines that it must compute the mapping from
the direct execution of a Turing Machine
Which does not require tracing an actual running TM, only mapping properties of the TM described.
The key fact that you continue to dishonestly ignore
is the concrete counter-example that I provided that
conclusively proves that the finite string of machine
code input is not always a valid proxy for the behavior
of the underlying virtual machine.
In other words, you deny the concept of a UTM, which can take a description of any Turing machine and exactly reproduce the behavior of the direct execution.
I deny that a pathological relationship between a UTM and
its input can be correctly ignored.
>
When this pathological relationship changes this behavior
we cannot simply pretend that the behavior is not changed.
>
>
When solving a problem, it is stupid to choose a tool that has a pathological relation with the problem.
reject an input. This input was intentionally defined
to try to fool this termination analyzer.
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
On the other hand when this same input DD is simulated
by the termination analyzer that DD defined a pathological
relationship to IT DOES SPECIFY NON-TERMINATING BEHAVIOR.
Les messages affichés proviennent d'usenet.