Sujet : Re: I have always been correct about emulating termination analyzers --- PROOF
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 21. Oct 2024, 14:52:28
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vf5mat$v6n5$4@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
User-Agent : Mozilla Thunderbird
On 10/21/2024 3:41 AM, Mikko wrote:
On 2024-10-20 15:32:45 +0000, olcott said:
The actual barest essence for formal systems and computations
is finite string transformation rules applied to finite strings.
Before you can start from that you need a formal theory that
can be interpreted as a theory of finite strings.
Not at all. The only theory needed are the operations
that can be performed on finite strings:
concatenation, substring, relational operator ...
The minimal complete theory that I can think of computes
the sum of pairs of ASCII digit strings.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer
…