Sujet : Re: Peano Axioms anchored in First Grade Arithmetic on ASCII Digit String pairs
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 30. Oct 2024, 11:02:17
Autres entêtes
Organisation : -
Message-ID : <vft079$23tm3$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
User-Agent : Unison/2.2
On 2024-10-27 14:21:25 +0000, olcott said:
On 10/27/2024 3:37 AM, Mikko wrote:
On 2024-10-26 13:17:52 +0000, olcott said:
Just imagine c functions that have enough memory to compute
sums and products of ASCII strings of digits using the same
method that people do.
Why just imagein? That is fairly easy to make. In some other lanugages
(e.g. Python, Javascript) it is alread in the library or as a built-in
feature.
OK next I want to see the actual Godel numbers and the
arithmetic steps used to derive them.
They can be found in any textbook of logic that discusses undecidability.
If you need to ask about details tell us which book you are using.
-- Mikko