| Deutsch English Français Italiano |
|
<v38j78$2foi0$13@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.misty.com!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: Richard Damon <richard@damon-family.org> Newsgroups: comp.theory,sci.logic Subject: Re: D correctly simulated by H cannot possibly halt --- templates and infinite sets Date: Wed, 29 May 2024 21:02:32 -0400 Organization: i2pn2 (i2pn.org) Message-ID: <v38j78$2foi0$13@i2pn2.org> References: <v3501h$lpnh$1@dont-email.me> <v362eu$2d367$3@i2pn2.org> <v363js$vg63$2@dont-email.me> <v36803$2d368$3@i2pn2.org> <v368je$100kd$3@dont-email.me> <v36rlr$13000$1@dont-email.me> <v37aa6$159q4$4@dont-email.me> <v38eqb$2foi0$5@i2pn2.org> <v38fl6$1bndb$2@dont-email.me> <v38g36$2foi0$12@i2pn2.org> <v38gpi$1bndb$4@dont-email.me> <v38ibi$2fohv$1@i2pn2.org> <v38ilr$1c8ir$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Thu, 30 May 2024 01:02:32 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="2613824"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird X-Spam-Checker-Version: SpamAssassin 4.0.0 In-Reply-To: <v38ilr$1c8ir$1@dont-email.me> Content-Language: en-US Bytes: 2918 Lines: 48 On 5/29/24 8:53 PM, olcott wrote: > On 5/29/2024 7:47 PM, Richard Damon wrote: >> On 5/29/24 8:21 PM, olcott wrote: >>> On 5/29/2024 7:09 PM, Richard Damon wrote: >>>> On 5/29/24 8:01 PM, olcott wrote: >>>>> On 5/29/2024 6:47 PM, Richard Damon wrote: >>>>>>> *Formalizing the Linz Proof structure* >>>>>>> ∃H ∈ Turing_Machines >>>>>>> ∀x ∈ Turing_Machines_Descriptions >>>>>>> ∀y ∈ Finite_Strings >>>>>>> such that H(x,y) = Halts(x,y) >>>>>>> >>>>>> >>>>>> And since NO H, can get right the H^ built to contradict IT, that >>>>>> claim is proven false. >>>>>> >>>>> >>>>> YOU KEEP TRYING TO GET AWAY WITH CHANGING THE SUBJECT >>>>> THE ABOVE FORMALIZATION IS CORRECT >>>>> >>>> >>>> How? >>>> >>> >>> The above is the question that Linz asks and the he gets >>> an answer of no, no such H exists. >>> >>> >> >> So, you now agree with Linz. Good. >> > > I said that Linz says that. The point is that the Linz > template examines an infinite set of Turing Machine / input > pairs the same way my H/D template references an infinite set > of C function / input pairs. > The difference is, In Linz's formulation, each machine is INDIVIDUALLY EVALUTED with its inputs, and a specific input is shown to exist for each one that makes it wrong. YOU try o merge them all together to claim that since none of them reach a final state in its partial simulation (for those that answer) that means that all the inputs represented non-halting machines, THAT is just invalid logic. You just don't understand how to do logic with qualifiers.