Re: DDD specifies recursive emulation to HHH and halting to HHH1 --- STA

Liste des GroupesRevenir à theory 
Sujet : Re: DDD specifies recursive emulation to HHH and halting to HHH1 --- STA
De : F.Zwarts (at) *nospam* HetNet.nl (Fred. Zwarts)
Groupes : comp.theory
Date : 03. Apr 2025, 10:02:56
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vslis0$6sgk$3@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
User-Agent : Mozilla Thunderbird
Op 03.apr.2025 om 04:37 schreef olcott:
On 4/2/2025 6:16 AM, Richard Damon wrote:
On 4/1/25 10:37 PM, olcott wrote:
On 4/1/2025 8:13 PM, Richard Damon wrote:
On 4/1/25 7:35 PM, olcott wrote:
On 4/1/2025 5:36 AM, Richard Damon wrote:
On 3/31/25 10:19 PM, olcott wrote:
>
*Simulating termination analyzer Principle*
It is always correct for any simulating termination
analyzer to stop simulating and reject any input
that would otherwise prevent its own termination.
>
>
But DDD doesn't prevent its own terminatation, as it calls an HHH that WILL abort its emulation and return and answer.
>
>
You know that DDD stopping running and DDD reaching its
final halt state are not the same thing you damned liar.
>
>
Right, the DDD who's simulation is stopped hasn't shown non-halting behavior, just not-yet-halted.
>
>
You already admitted that you are lying about this.
DDD emulated by HHH for an infinite number of steps
never reaches its final halt state.
>
But that isn't something that happens with THIS HHH, since it doesn't do that.
>
  When DDD emulated by HHH for an infinite number of steps
never halts then as soon as HHH correctly infers this it
has its basis to reject DDD.
 
Dreaming again of an infinite recursion? Dreams are no substitute for logic. HHH emulates only a finite number of steps. That is exactly what makes it halting and what makes DDD halting.

Date Sujet#  Auteur
28 Mar 26 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal