Re: Hypothetical possibilities

Liste des GroupesRevenir à theory 
Sujet : Re: Hypothetical possibilities
De : F.Zwarts (at) *nospam* HetNet.nl (Fred. Zwarts)
Groupes : comp.theory
Date : 21. Jul 2024, 12:25:59
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v7inno$1uji$3@dont-email.me>
References : 1 2 3 4 5 6
User-Agent : Mozilla Thunderbird
Op 20.jul.2024 om 22:08 schreef olcott:
On 7/20/2024 3:03 PM, Alan Mackenzie wrote:
[ Followup-To: set ]
>
In comp.theory Fred. Zwarts <F.Zwarts@hetnet.nl> wrote:
>
[ .... ]
>
Olcott could not point to an error, but prefers to ignore it. So, I will
repeat it, until either an error is found, or olcott admits that HHH
cannot possibly simulate itself correctly.
>
This has the disadvantage of making your posts boring to read.  All but
one poster on this newsgroup KNOW that Olcott is wrong, here.
>
Continually repeating your argument won't get him to admit he's wrong.
Richard has been trying that for much longer than you have, with the
same lack of success.  Olcott's lack of capacity for abstract reasoning,
combined with his ignorance, combined with his arrogance, prevent him
learning at all.
>
May I suggest that you reconsider your strategy of endless repetition?
>
Thanks!
>
 So you are going to stupidly disagree with this?
 void DDD()
{
   HHH(DDD);
   return;
}
 It *is* a fact that no DDD correctly simulated by any
pure function HHH ever reaches its own return instruction.
Which proves that these simulations are incorrect.
DDD is a misleading and unneeded complication. It is easy to eliminate DDD:
        int main() {
          return HHH(main);
        }
This has the same problem. This proves that the problem is not in DDD, but in HHH, which halts when it aborts the simulation, but it decides that the simulation of itself does not halt.
It shows that HHH cannot possibly simulate itself correctly.
HHH is simply unable to decide about finite recursions.
void Finite_Recursion (int N) {
   if (N > 0) Finite_Recursion (N - 1);
}
It decides after N recursions that there is an infinite recursion, which is incorrect.
Olcott's HHH is programmed to abort the simulation after N cycles of recursive simulations. Therefore, it is incorrect to abort the simulation of HHH when the simulated HHH has performed only N-1 cycles, because that changes the behaviour of HHH.
Since the simulated HHH always runs one cycle behind the simulating HHH, it is clear that HHH can never simulate enough cycles for a correct simulation, as is required by the x86 language.
Therefore, the simulation is incorrect according to the criteria olcott stipulated.
The conclusion is simple:
HHH cannot possibly simulate itself correctly.
No matter how much olcott wants it to be correct, or how many times olcott repeats that it is correct, it does not change the fact that such a simulation is incorrect, because it is unable to reach the end.
Olcott's own claim that the simulated HHH does not reach its end confirms it. The trace he has shown also proves that HHH cannot reach the end of its own simulation. So, his own claims prove that it is true that HHH cannot possibly simulate itself up to the end, which makes the simulation incorrect.
Sipser would agree that this incorrect simulation cannot be used to detect a non-halting behaviour.
Olcott does not know how to point to an error in this explanation, but prefers to ignore it. He even consistently removes it from the citations. So, I will repeat it, until either an error is found, or olcott admits that HHH cannot possibly simulate itself correctly.

Date Sujet#  Auteur
10 Nov 24 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal