Sujet : Re: DDD specifies recursive emulation to HHH and halting to HHH1
De : F.Zwarts (at) *nospam* HetNet.nl (Fred. Zwarts)
Groupes : comp.theoryDate : 30. Mar 2025, 15:09:14
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vsbjaa$1hblk$3@dont-email.me>
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
User-Agent : Mozilla Thunderbird
Op 29.mrt.2025 om 22:07 schreef olcott:
On 3/29/2025 3:45 PM, Fred. Zwarts wrote:
Op 29.mrt.2025 om 20:03 schreef olcott:
On 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.
A termination analyzer cannot reject itself,
but it can report that it failed to do a correct analysis. That is what HHH does when it fails to reach the end of the simulation of a program that has an end as proven by direct execution and world-class simulators.