Re: Who knows that DDD correctly simulated by HHH cannot possibly reach its own return instruction final state?

Liste des GroupesRevenir à ns readers 
Sujet : Re: Who knows that DDD correctly simulated by HHH cannot possibly reach its own return instruction final state?
De : F.Zwarts (at) *nospam* HetNet.nl (Fred. Zwarts)
Groupes : comp.theory
Date : 04. Aug 2024, 07:22:17
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v8n6mq$3tv07$3@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11
User-Agent : Mozilla Thunderbird
Op 03.aug.2024 om 18:35 schreef olcott:
On 8/3/2024 11:32 AM, Richard Damon wrote:
On 8/3/24 12:16 PM, olcott wrote:
On 8/3/2024 11:12 AM, Richard Damon wrote:
On 8/3/24 12:03 PM, olcott wrote:
On 8/3/2024 10:33 AM, Richard Damon wrote:
On 8/3/24 10:26 AM, olcott wrote:
On 8/3/2024 9:04 AM, Fred. Zwarts wrote:
Op 03.aug.2024 om 15:50 schreef olcott:
On 8/3/2024 3:14 AM, Fred. Zwarts wrote:
Op 02.aug.2024 om 22:57 schreef olcott:
Who here is too stupid to know that DDD correctly simulated
by HHH cannot possibly reach its own return instruction?
>
void DDD()
{
   HHH(DDD);
   return;
}
>
>
Which proves that the simulation is incorrect.
>
When are you going to understand that you are not allowed
to disagree with the semantics of the x86 language?
>
>
>
I do not disagree.
When are you going to understand that it is a deviation of the semantics of the x86 language to skip instructions of a halting program,
>
HHH(DDD) simulates DDD that calls HHH(DDD) to repeat the process.
>
If it does this an infinite number of times the simulated DDD
never reaches its own return instruction.
>
If it does this a googolplex number of times the simulated DDD
never reaches its own return instruction.
>
Nope, the PARTIAL SIMULATION of DDD never reaches the return instruction.
>
>
For N = 0; while N <= googolplex; N++
N instructions of DDD correctly emulated by HHH[N] never
reach their own "return" instruction final state.
>
∞ instructions of DDD correctly emulated by HHH[∞] never
reach their own "return" instruction final state.
>
Thus any HHH that takes a wild guess that DDD emulated
by itself never halts is always correct.
>
>
The SIMULATION of DDD never reaches the return instruction.
>
>
Great! Finally.
When we understand that the return instruction is halt state
of DDD then DDD correctly simulated by HHH never halts.
>
No, you are just proving you are incapable of learning.
>
The PARTIAL simulation of DDD done by HHH doesn't reach the return instruction.
>
 ∞ instructions of DDD correctly emulated by HHH[∞] never
reach their own "return" instruction final state.
 So you are saying that the infinite one does?
 
Dreaming again of HHH that does not abort? Dreams are no substitute for facts.
The HHH that aborts and halts, halts. A tautology.
The correct simulation of a halting program halts. A truism.
HHH cannot possibly simulate itself correctly.
I am happy that you were not a member of our team when we developed simulators to check the design of big detector systems.
We knew that a simulation is only correct if it matches the reality. But you seem to think that it is correct that a simulator does not match the reality.

Date Sujet#  Auteur
21 Dec 24 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal