Sujet : Re: H(D,D) cannot even be asked about the behavior of D(D) V2 ---ignoring all other replies
De : noreply (at) *nospam* example.com (joes)
Groupes : comp.theory sci.logicDate : 15. Jun 2024, 18:11:20
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v4kef8$2cg4$1@i2pn2.org>
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 30 31 32 33
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Sat, 15 Jun 2024 10:54:54 -0500 schrieb olcott:
On 6/15/2024 10:12 AM, Richard Damon wrote:
On 6/15/24 11:07 AM, olcott wrote:
On 6/15/2024 10:00 AM, Richard Damon wrote:
On 6/15/24 10:37 AM, olcott wrote:
On 6/13/2024 8:24 PM, Richard Damon wrote:
On 6/13/24 11:32 AM, olcott wrote:
*Then do as I originally requested and provide ALL OF THE STEPS*
The mapping, for this H and D, is:
(D,D) -> 1
I am asking for a mapping from the machine language finite string of the
input to H(D,D) to each of the individual steps of the behavior of D(D).
D calls H, which by definition terminates. From its return value we fork
to either enter an endless loop or halt. Then H (which is not allowed to
simulate D if that doesn't halt) gives the result we just used to fork.
-- joes
…