| Deutsch English Français Italiano |
|
<104iiu3$v7he$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: nntp.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: "Fred. Zwarts" <F.Zwarts@HetNet.nl> Newsgroups: comp.theory,sci.logic Subject: Re: My reviewers think that halt deciders must report on the behavior of their caller Date: Tue, 8 Jul 2025 09:55:46 +0200 Organization: A noiseless patient Spider Lines: 79 Message-ID: <104iiu3$v7he$1@dont-email.me> References: <101nq32$99vd$1@dont-email.me> <101od0p$i3m6$2@dont-email.me> <1049edr$10io1$2@dont-email.me> <a25b36c514731c7946fc2fb5e003c4dda451452e@i2pn2.org> <1049jhv$11mmt$2@dont-email.me> <89d2edbab76401270efa67a8fbc135d5c47fefab@i2pn2.org> <104bjmr$1hqln$16@dont-email.me> <3f64fdd81d67415b7b0e305463d950c0c71e2db7@i2pn2.org> <EKKdnXZfl9Qpf_T1nZ2dnZfqlJ-dnZ2d@giganews.com> <9dcab3b82e32f9eb8473f8bc5361ab2fbef8b8f8@i2pn2.org> <104cud2$1r72a$2@dont-email.me> <a346224cd5d8b4001580eb6e5ff8783e58c9b7f5@i2pn2.org> <104e46s$28pqb$2@dont-email.me> <960c2417e6f691b2b12703506c207990df5b39ab@i2pn2.org> <104el09$2dpog$1@dont-email.me> <1ca786773f9ff02718c66e082bbc4182b36732ab@i2pn2.org> <104fduv$2n8gq$2@dont-email.me> <4cb5d16be8d1e6549823f35081050e7dad462da2@i2pn2.org> <104gi8j$2uc68$2@dont-email.me> <152859a4a4ef31aa45580e873eb6970c34b97ef9@i2pn2.org> <104hmb5$35gkb$1@dont-email.me> <f12be9e3474cf08b01ae1a4381f77205bbac1da3@i2pn2.org> <104i15g$36mma$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Tue, 08 Jul 2025 07:55:48 +0000 (UTC) Injection-Info: dont-email.me; posting-host="23af68631546830f6619c79ff9a75cfc"; logging-data="1023534"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19dZIrpbusqFjwiI1VpWA/x" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:tmhNNDMQSeRYA6XN4kulBKuac6s= Content-Language: nl, en-GB In-Reply-To: <104i15g$36mma$2@dont-email.me> Op 08.jul.2025 om 04:52 schreef olcott: > On 7/7/2025 9:24 PM, Richard Damon wrote: >> On 7/7/25 7:47 PM, olcott wrote:>> >>> That Turing machines cannot take directly executing Turing >>> Machines as inputs entails that these directly executed >>> machines are outside of the domain of every Turing machine >>> based halt decider. >> >> But they can take the finite-stringt encoding of those machines. >> > > Yes. > >> I guess you idea of Turing Machine is so limited that you think they >> can't do arithmatic, as you can't actually put a "Number" as the >> input, only the finite-string encoding of a number, which puts it >> outside the domain of them. >> > > No one here has any understanding of the philosophy of > computation. They can only memorize the rules and have > no idea about the reasoning behind these rules. > >>> >>> That you cannot understand that is a truism is only your >>> own lack of understanding. >> >> But it isn't a truism, it is just a stupid lie that ignores that >> almost everything done with programs is via an "encoding" for the input. >> > > Gross ignorance about the reasoning behind the rules > of computation would tell you that. > >>> >>> https://www.liarparadox.org/Peter_Linz_HP_317-320.pdf >>> *Here is the Linz proof corrected to account for that* >>> >>> *adapted from bottom of page 319* >>> When Ĥ is applied to ⟨Ĥ⟩ >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.∞ >>> ⟨Ĥ⟩ ⟨Ĥ⟩ simulated by Ĥ.embedded_H reaches >>> its simulated final halt state of ⟨Ĥ.qn⟩ >>> >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>> ⟨Ĥ⟩ ⟨Ĥ⟩ simulated by Ĥ.embedded_H cannot possibly >>> reach its simulated final halt state of ⟨Ĥ.qn⟩ >>> >>> >> >> Which is just an admission of your lying strawman, as the question is >> NOT about the (partial) simulation done by your H / embedded_H, but >> about the direct execution of the input H^ (H^) as that is what the >> input to H is encoding. >> > > Because no Turing machine can take a directly executed > Turing machine as an input, directly executed Turing > machines have always been outside of the domain of every > Turing machine based decider. > > "the direct execution of the input H^ (H^)" has always been > out-of-scope for every Turing machine based halt decider. > That no one bothered to notice this ever before > *DOES NOT MAKE ME WRONG* That is your misconception. No one ever asked to take the direct execution as input. You are fighting windmills again, which is not a rebuttal. A decider must report on its input. If exactly this same input is proven to specify a halting program, then the decider must report that it halts. Whether this proof is by direct execution, by a correct simulation, or by other means, is irrelevant, although the proof by direct execution is of course the easiest to understand. In this case the input of HHH has been proven to specify a halting program by direct execution. HHH does not need to know that, but when it does a correct analysis it must come to the same conclusion. If not, then HHH is wrong as a self-evident fact.