Sujet : Re: 195 page execution trace of DDD correctly simulated by HH0
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory sci.logicDate : 25. Jun 2024, 23:38:13
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v5fdc5$1nsua$3@dont-email.me>
References : 1 2 3 4 5 6 7 8
User-Agent : Mozilla Thunderbird
On 6/25/2024 3:44 PM, joes wrote:
Am Mon, 24 Jun 2024 16:04:00 -0500 schrieb olcott:
On 6/24/2024 2:36 PM, joes wrote:
AFACT HH1 is the same as HH0, right? What happens when HH1 tries to
simulate a function DD1 that only calls HH1?
HH1 terminates, right?
I am going to have to go through my code and standardize my names.
Yes, please.
H(P,P) was the original name. Then I had to make a one parameter
version, a version that is identical to H, except P does not call it and
then versions using different algorithms. People have never been able to
understand the different algorithm.
Can you explain them?
I can't do that now because I have to change too much of
the code and I can't use the names that are in code in my
paper because they are too complex.
H0/H1 in my brand new paper are HHH/HHH1 in my code for input
DDD. H in my paper is HH in my code, there is an HH1 in my code
that is not referenced in my paper.
There are a bunch of functions that use the 0,1,2 to
mean number of parameters.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer