Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: olcott Newsgroups: comp.theory Subject: Re: Computable Functions --- finite string transformation rules Date: Sat, 26 Apr 2025 16:15:54 -0500 Organization: A noiseless patient Spider Lines: 73 Message-ID: References: <6d9ae3ac08bbbe4407fc3612441fc2032f949a3d@i2pn2.org> <7ac75991b443ba53d52960ddb1932524dea8e03f@i2pn2.org> <40b048f71fe2ed2a8ef11d2d587c765c8fcbc977@i2pn2.org> <99367baaadfd647c1d75f4236345a3243a439a0b@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sat, 26 Apr 2025 23:15:55 +0200 (CEST) Injection-Info: dont-email.me; posting-host="9742630c956e796e93c0a1f147f3a807"; logging-data="3327376"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19L8YgPcJoaa3yLKehSkWJw" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:2S80QZZKNJkVygB7hWH2j+ZaJbQ= X-Antivirus-Status: Clean X-Antivirus: Norton (VPS 250426-4, 4/26/2025), Outbound message In-Reply-To: Content-Language: en-US On 4/26/2025 3:45 PM, dbush wrote: > On 4/26/2025 4:41 PM, olcott wrote: >> On 4/26/2025 3:23 PM, joes wrote: >>> Am Sat, 26 Apr 2025 14:46:12 -0500 schrieb olcott: >>>> On 4/26/2025 1:22 PM, Fred. Zwarts wrote: >>>>> Op 26.apr.2025 om 19:28 schreef olcott: >>>>>> On 4/26/2025 3:58 AM, Fred. Zwarts wrote: >>>>>>> Op 25.apr.2025 om 23:21 schreef olcott: >>>>>>>> On 4/25/2025 8:56 AM, joes wrote: >>>>>>>>> Am Thu, 24 Apr 2025 19:03:34 -0500 schrieb olcott: >>> >>>>>>>>> The program EE(){ HHH(EE); } also halts and cannot be simulated by >>>>>>>>> HHH. >>>>>>>>> >>>>>>>> HHH cannot possibly do this without violating the rules of the x86 >>>>>>>> language. >>>>>>> HHH already violates the rules of the x86 language by prematurely >>>>>>> aborting the halting program. >>>>>> >>>>>> Everyone claims that HHH violates the rules of the x86 language >>>>>> yet no >>>>>> one can point out which rules are violated >>>>> >>>>> It has been pointed out many times. It is against the rules of the x86 >>>>> language to abort a halting function. >>>> >>>> You remains stupidly wrong about this because you refuse to show what >>>> step of DD is not emulated by HHH according to the finite string >>>> transformation rules specified by the x86 language. >> >>> All instructions after the abort are not emulated. >>> >> >> Still stupidly wrong. >> >> *The best selling author of theory of computation textbooks* >> >> >>      If simulating halt decider H correctly simulates its input D >> >>      until H correctly determines that its simulated D would never >>      stop running unless aborted then >> >>      H can abort its simulation of D and correctly report that D >>      specifies a non-halting sequence of configurations. >> >> > > But not to what you think he agreed to: > I don't give a rat's ass about other people's opinions of what he agreed to. Other people keep trying to dishonesty get away with disagreeing with the finite string transformations specified by the x86 language. This seems to prove that these "other people" are liars. Now that I just came up with the idea that all Turing Machine computable functions must apply finite string transformations to their inputs to derive their outputs The stupid nonsense that HHH must report on the direct execution of DD is conclusively proved to be stupid nonsense. -- Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer