Path: ...!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail From: Richard Damon Newsgroups: comp.theory Subject: Re: Turing Machine computable functions apply finite string transformations to inputs Date: Mon, 28 Apr 2025 22:07:27 -0400 Organization: i2pn2 (i2pn.org) Message-ID: References: <0a2eeee6cb4b6a737f6391c963386745a09c8a01@i2pn2.org> <4818688e0354f32267e3a5f3c60846ae7956bed2@i2pn2.org> <65dddfad4c862e6593392eaf27876759b1ed0e69@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Tue, 29 Apr 2025 02:07:49 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="2331913"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird X-Spam-Checker-Version: SpamAssassin 4.0.0 Content-Language: en-US In-Reply-To: Bytes: 4324 Lines: 62 On 4/28/25 12:38 PM, olcott wrote: > On 4/28/2025 10:41 AM, dbush wrote: >> On 4/28/2025 11:35 AM, olcott wrote: >>> On 4/28/2025 10:18 AM, dbush wrote: >>>> On 4/28/2025 11:01 AM, olcott wrote: >>>>> On 4/28/2025 2:33 AM, Richard Heathfield wrote: >>>>>> On 28/04/2025 07:46, Fred. Zwarts wrote: >>>>>> >>>>>> >>>>>> >>>>>>> So we agree that no algorithm exists that can determine for all >>>>>>> possible inputs whether the input specifies a program that >>>>>>> (according to the semantics of the machine language) halts when >>>>>>> directly executed. >>>>>>> Correct? >>>>>> >>>>>> Correct. We can, however, construct such an algorithm just as long >>>>>> as we can ignore any input we don't like the look of. >>>>>> >>>>> >>>>> The behavior of the direct execution of DD cannot be derived >>>>> by applying the finite string transformation rules specified >>>>> by the x86 language to the input to HHH(DD). This proves that >>>> >>>> The assumption that an H exists that meets the below requirements is >>>> false, as shown by Linz and others: >>>> >>> >>> I have just proved that those requirements are stupidly wrong >> >> Category error.  The mapping exists > > Computable functions are the formalized analogue > of the intuitive notion of algorithms, in the > sense that a function is computable if there > exists an algorithm that can do the job of the > function, i.e. > *given an input of the function domain* > *it can return the corresponding output* > https://en.wikipedia.org/wiki/Computable_function No, that is not a "analogue". > > There is a mapping from the input to HHH(DD) by applying > the finite string transformation rules specified by the > x86 language to this DD input that derives: > *no correctly emulated DD ever reaches its final halt state* No, since HHH(DD) returns 0, per your stipulations, the transformation of the full code of the input reaches a final state. HHH, because it doesn't follow those rules, just gives up too soon, and you prove that you are just an ignorant pathologocial liar. > > How long do you think that you can get away with > disagreeing with the x86 language before you begin > to look very stupid? > You are the one disregaring the x86 language, as you demonstrate by not answering the refutation shoing your error.