Re: The philosophy of computation reformulates existing ideas on a new basis ---

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