Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: olcott Newsgroups: comp.theory Subject: Re: HHH(DD) --- COMPUTE ACTUAL MAPPING FROM INPUT TO OUTPUT --- Using Finite String Transformations Date: Thu, 17 Apr 2025 13:30:04 -0500 Organization: A noiseless patient Spider Lines: 54 Message-ID: References: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Thu, 17 Apr 2025 20:30:05 +0200 (CEST) Injection-Info: dont-email.me; posting-host="9e54186204e3f985b1887a8e149a0720"; logging-data="1271167"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+qGHsKZACxElZwETeHxJsT" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:SsAnDLU9IYKumKC0Ys2s05G6lBA= X-Antivirus-Status: Clean X-Antivirus: Norton (VPS 250417-2, 4/17/2025), Outbound message In-Reply-To: Content-Language: en-US Bytes: 3821 On 4/17/2025 6:49 AM, Alan Mackenzie wrote: > olcott wrote: >> On 4/16/2025 1:09 PM, Alan Mackenzie wrote: >>> Mr Flibble wrote: >>>> On Wed, 16 Apr 2025 13:29:18 +0100, Richard Heathfield wrote: > >>>>> The question is whether a universal termination analyser can be >>>>> constructed, and the answer is that it can't. > >>>> Aren't you kind of putting the cart before the horse with such an >>>> assertion? Maybe the prior art you are basing that assertion on is wrong? > >>> You're speaking from ignorance of mathematics. The halting problem has >>> been unequivocally proven. It is a simple theorem, only slightly more >>> complicated than 2 + 2 = 4. > >>> We're not talking about "prior art", or anything like that. We're >>> talking rigorous mathematics. We're talking about absolute truth, >>> something that Peter Olcott does not understand. You don't need to join >>> him. > >>>> /Flibble > > >> Moronically stupid "rigorous mathematics" that is far >> too stupid to know that unless the finite string input >> input is transformed by finite string transformation >> operations into outputs that you are doing the computer >> science stupidly incorrectly. > > That isn't even a well formed sentence. > >> All of logic, reasoning and computation boils down to >> finite string transformations on inputs deriving outputs. > > That's a big assertion, one you have not proved. It is one you can't > prove, even were it true, since you don't understand the concept of > proof. > When a categorically exhaustive search is made it is self-evident that all computation, logic, and human reasoning has as its barest possible essence transforming input finite strings into outputs via finite string transformations. >> -- >> Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius >> hits a target no one else can see." Arthur Schopenhauer > -- Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer