Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Peano Axioms anchored in First Grade Arithmetic on ASCII Digit
 String pairs
Date: Sun, 27 Oct 2024 13:48:58 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <vfluea$3nvp8$3@i2pn2.org>
References: <ves6p1$2uoln$1@dont-email.me>
 <522ecce215e636ddb7c9a1f75bff1ba466604cc5@i2pn2.org>
 <veuvt9$3hnjq$1@dont-email.me>
 <87634d01e18903c744d109aaca3a20b9ce4278bb@i2pn2.org>
 <vev8gg$3me0u$1@dont-email.me>
 <eb38c4aff9c8bc250c49892461ac25bfccfe303f@i2pn2.org>
 <vf051u$3rr97$1@dont-email.me>
 <e3f28689429722f86224d0d736115e4d1895299b@i2pn2.org>
 <vf1hun$39e3$1@dont-email.me>
 <dedb2801cc230a4cf689802934c4b841ae1a29eb@i2pn2.org>
 <vf1stu$8h0v$1@dont-email.me>
 <592109c757262c48aaca517a829ea1867913316b@i2pn2.org>
 <vf37qt$fbb3$1@dont-email.me> <vf5430$sjvj$1@dont-email.me>
 <vf5mat$v6n5$4@dont-email.me> <vf7jbl$1cr7h$1@dont-email.me>
 <vf8b8p$1gkf5$3@dont-email.me> <vfa8iu$1ulea$1@dont-email.me>
 <vfassk$21k64$4@dont-email.me> <vfdjc7$2lcba$1@dont-email.me>
 <vfdlij$2ll17$1@dont-email.me> <vffj9k$33eod$1@dont-email.me>
 <vfg6j4$36im7$1@dont-email.me> <vfi7ng$3kub8$1@dont-email.me>
 <vfiq60$3ner2$3@dont-email.me> <vfku48$78d0$1@dont-email.me>
 <vfli96$fj8s$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sun, 27 Oct 2024 17:48:58 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="3931944"; mail-complaints-to="usenet@i2pn2.org"
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <vfli96$fj8s$2@dont-email.me>
Bytes: 2801
Lines: 25

On 10/27/24 10:21 AM, olcott wrote:
> 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.
> 

Then do it. His proof detailed exactly how ot do it, he just didn't 
limit himself to Peano, as he wanted to prove it for ANY system that 
meet the minimum requirements.

Of course, the first requirement is to fully understand the Axioms of 
the system you want to use, and how that system derives its needed rules 
of arithmetic from those, at EVERY step in fine detail.

So, why don't you first make a listing of that, then do the encoding step.