Sujet : Re: I have always been correct about emulating termination analyzers --- PROOF
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 21. Oct 2024, 09:41:04
Autres entêtes
Organisation : -
Message-ID : <vf5430$sjvj$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
User-Agent : Unison/2.2
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.
-- Mikko
…