Sujet : Re: Two hypothetical possibilities --- HP decision problem instance
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 28. Oct 2025, 16:33:03
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <10dqnnf$1op5o$7@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 30
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Tue, 28 Oct 2025 09:35:40 -0500 schrieb olcott:
On 10/28/2025 3:34 AM, joes wrote:
Am Tue, 21 Oct 2025 18:54:33 -0500 schrieb olcott:
That DD() halts depends on HHH(DD) rejecting its input.
Which it does, therefore DD halts.
D simulated by H cannot possibly reach past its first line.
It totally can if you actually mean the program that calls H which aborts
instead of the incomplete diagonal template.
H simulates D that calls H(D) to simulate D that calls H(D) to simulate
D that calls H(D) to simulate D that calls H(D) to simulate D that calls
H(D) to simulate D until H sees this repeating pattern.
Which already happens after two recursive simulations.
-- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:It is not guaranteed that n+1 exists for every n.
Haut de la page
Les messages affichés proviennent d'usenet.
NewsPortal