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 <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: HHH(DD) --- COMPUTE ACTUAL MAPPING FROM INPUT TO OUTPUT --- Using
 Finite String Transformations
Date: Mon, 21 Apr 2025 18:35:16 -0500
Organization: A noiseless patient Spider
Lines: 90
Message-ID: <vu6knm$394oo$1@dont-email.me>
References: <vsnchj$23nrb$2@dont-email.me> <vtmgen$gs48$1@dont-email.me>
 <vtmh1n$2a90$3@dont-email.me> <vto4vh$23i07$1@dont-email.me>
 <vto7qu$267in$1@dont-email.me> <k%RLP.1232047$Xb1.539402@fx05.ams4>
 <vtorpb$2uac$1@news.muc.de> <vtp32o$2vb5o$1@dont-email.me>
 <vtqpt5$17ns$1@news.muc.de> <vtrhbc$16pbv$2@dont-email.me>
 <vtrk7l$t44$1@news.muc.de> <vtrmfa$1be3n$1@dont-email.me>
 <vtvkgo$vjvi$1@dont-email.me> <vu2042$34l74$1@dont-email.me>
 <vu519u$1s5f9$1@dont-email.me> <vu6aha$2vn05$3@dont-email.me>
 <vu6dk4$2fq2$1@news.muc.de>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 22 Apr 2025 01:35:19 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="5a4ab167e532bd8e1990aea1c05779e2";
	logging-data="3445528"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+Hf0mbaHptdOS3edCfWX5m"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:rh1Nzz9v7Rq2MtDsqt0pA2KN3Wg=
In-Reply-To: <vu6dk4$2fq2$1@news.muc.de>
Content-Language: en-US
X-Antivirus-Status: Clean
X-Antivirus: Norton (VPS 250421-6, 4/21/2025), Outbound message
Bytes: 5428

On 4/21/2025 4:33 PM, Alan Mackenzie wrote:
> olcott <polcott333@gmail.com> 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 <polcott333@gmail.com> wrote:
>>>>>>>> On 4/17/2025 6:49 AM, Alan Mackenzie wrote:
>>>>>>>>> olcott <polcott333@gmail.com> wrote:
>>>>>>>>>> On 4/16/2025 1:09 PM, Alan Mackenzie wrote:
>>>>>>>>>>> Mr Flibble <flibble@red-dwarf.jmc.corp> 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.

> An example of computation not based on string transformation is the
> differential analyser.  In this device, rotating disks engage with wheels
> by friction, these wheels being at varying distances from the centre of
> the disk.  The amount of rotation of the wheel was an integral (do you
> even know what this means?) of one quantity with respect to another.  The
> output from one wheel could be fed as an input to another disk, and so
> on.
> 
> Another example is the slide rule.
> 
> There have been several/many types of analogue computers over the decades
> and centuries, though these have now largely been superseded by digital
> computers.  Analog computations don't involve string manipulation.
> 
>> -- 
>> 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