Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: Mikko Newsgroups: comp.theory Subject: Re: HHH(DD) --- COMPUTE ACTUAL MAPPING FROM INPUT TO OUTPUT --- Using Finite String Transformations Date: Tue, 22 Apr 2025 12:16:16 +0300 Organization: - Lines: 74 Message-ID: References: <63af93cb608258cc3e12b9bab3a2efa0b7ee7eee@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Tue, 22 Apr 2025 11:16:17 +0200 (CEST) Injection-Info: dont-email.me; posting-host="77e99febd2ea8fbd06e9bc59456aaf8d"; logging-data="316476"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+R8L1Q+voqwcjelkxpoIDk" User-Agent: Unison/2.2 Cancel-Lock: sha1:7L+KUSJSSknmfWoO7oDLkCUHlHg= On 2025-04-21 23:35:16 +0000, olcott said: > On 4/21/2025 4:33 PM, Alan Mackenzie wrote: >> olcott wrote: >>> On 4/21/2025 3:57 AM, Mikko wrote: >>>> On 2025-04-20 05:18:56 +0000, olcott said: >> >>>>> On 4/19/2025 2:48 AM, Mikko wrote: >>>>>> On 2025-04-17 19:57:30 +0000, olcott said: >> >>>>>>> On 4/17/2025 2:19 PM, Alan Mackenzie wrote: >>>>>>>> olcott wrote: >>>>>>>>> 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: >> >>>>>>>> [ .... ] >> >>>>>>>>>>> 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. >> >>>>>>>> It is not at all self-evident. >> >>>>>>> It is self-evident that there are no exceptions to the rule >>>>>>> the all truth that is entirely anchored in fully formalized >>>>>>> semantics an be expressed as finite string transformations >>>>>>> from input finite strings. >> >>>>>> It seems that there is an error above as I can't parse it. But it is >>>>>> not clear how that should be corrected. >> >>>>> All mental, computational or logical reasoning >>>>> boils down to finite string transformation rules >>>>> applied to finite strings deriving finite string >>>>> outputs. >> >>>>> That no counter-example to this rule exists is its proof. >> >>>> Unproven non-existence of counter-examples is not a proof. In particular >>>> mental reasoning is too poorly understood to be sure about anything. >> >>> In other words you cannot find a counter-example. >>> I claim that the entire category of counter-example >>> to the above statement is the empty set. >> >> You're being stupid. Just because you can't think up a counterexample >> doesn't mean other more intelligent people can't. >> >>> When you try and find any computation that is not >>> essentially finite string transformations to finite >>> strings it is self-evident that none can possibly exist. >> >> It's self evident only to the arrogantly stupid. > > All computation is isomorphic to: > Finite string transformations to finite strings. You can say that but you can't prove that. You can't even tell what that isomorfism is or how it applies to a slide rule. -- Mikko