Path: ...!eternal-september.org!feeder2.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: The philosophy of computation reformulates existing ideas on a
 new basis ---
Date: Sun, 27 Oct 2024 17:01:55 -0500
Organization: A noiseless patient Spider
Lines: 36
Message-ID: <vfmd8m$k2m7$1@dont-email.me>
References: <veoift$29dtl$2@dont-email.me> <veoq3j$2aqp2$1@dont-email.me>
 <vf716u$1607j$1@dont-email.me> <vf7ks8$1d1vt$1@dont-email.me>
 <vf8eu5$1h5mj$2@dont-email.me> <vfdk8g$2lgl1$1@dont-email.me>
 <vfdrb8$2mcdg$1@dont-email.me> <vffk1i$33iat$1@dont-email.me>
 <vfgaev$36im7$5@dont-email.me> <vfi743$3kr1e$1@dont-email.me>
 <vfip3l$3ner2$2@dont-email.me>
 <1bc1ab08ec47bf818ddff1d4f63b542ceadd6985@i2pn2.org>
 <vfjokd$3su2f$1@dont-email.me> <vfk3jl$3kr0c$5@i2pn2.org>
 <vfk4lk$3ukdm$1@dont-email.me> <vfl8o9$3mnmt$5@i2pn2.org>
 <vfli1h$fj8s$1@dont-email.me> <vflue8$3nvp8$2@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sun, 27 Oct 2024 23:01:58 +0100 (CET)
Injection-Info: dont-email.me; posting-host="aecb0ee9851572be14adcf8faad49f58";
	logging-data="658119"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/DOtjgv1IRtlFU8Y+HTR6V"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:bIVTJEhNYBQ7IEMvXFBaBIpQc7M=
X-Antivirus-Status: Clean
Content-Language: en-US
X-Antivirus: Norton (VPS 241027-4, 10/27/2024), Outbound message
In-Reply-To: <vflue8$3nvp8$2@i2pn2.org>
Bytes: 3167

On 10/27/2024 12:48 PM, Richard Damon wrote:
> On 10/27/24 10:17 AM, olcott wrote:
>> I am keeping this post in both sci.logic and comp.theory
>> because it focuses on a similar idea to the Curry/Howard
>> correspondence between formal systems and computation.
>>
>> Computation and all of the mathematical and logical operations
>> of mathematical logic can be construed as finite string
>> transformation rules applied to finite strings.
>>
>> The semantics associated with finite string tokens can
>> be directly accessible to expression in the formal language.
>> It is basically an enriched type hierarchy called a knowledge
>> ontology.
>>
>> A computation can be construed as the tape input to a
>> Turing machine and its tape output. All of the cases
>> where the output was construed as a set of final machine
>> states can be written to the tape.
>>
>> I am not sure but I think that this may broaden the scope
>> of a computable function, or not.
> 
> Except that nothing you described related to what a "computabe function" 

I intend to reply to other aspects of your reply later
on as long as your reply to this reply is not lame.

When a Turing machine transforms the contents of its
input tape into the contents of its output tape this
seems to necessarily always be a computable function
no matter what the TM does in-between.

-- 
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer