Sujet : Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs +++
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theoryDate : 04. May 2025, 17:21:51
Autres entêtes
Organisation : Fix this later
Message-ID : <vv846v$2aln2$1@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
On 04/05/2025 17:06, olcott wrote:
<snip>
They simply guess that because DD(DD) halts that
DD correctly simulated by HHH must also halt.
It's not a guess. If direct execution halts, so must the simulation. If the simulation produces a different answer than direct execution then the simulation is flawed, and to consider otherwise strongly suggests that you lack the capacity to think logically.
They cannot provide these detailed steps of the
execution trace of each machine instruction
It's not required. Such a trace could at best only show where the simulation fouls up.
BECAUSE THEY KNOW THAT THEY ARE WRONG AND ONLY PLAYING HEAD GAMES.
I am not a psychiatrist, but that smacks of projection.
If I were contracted to write a simulation of P(D) but I presented a program that got a different result to a directly executed P(D), my client would be entitled to ask why and expect an answer he could understand and that made clear logical sense. A simulation that fails to simulate is ipso facto broken.
-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within