Re: Liar detector: Peter Olcott --- Ben's agreement

Liste des GroupesRevenir à theory 
Sujet : Re: Liar detector: Peter Olcott --- Ben's agreement
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theory sci.logic
Date : 10. Jul 2024, 03:51:40
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <b41a3dfce421d48635e133a0ef8824fc438dde36@i2pn2.org>
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 25 26 27 28 29 30 31 32
User-Agent : Mozilla Thunderbird
On 7/9/24 10:06 AM, olcott wrote:
On 7/9/2024 3:56 AM, Fred. Zwarts wrote:
Op 08.jul.2024 om 19:36 schreef olcott:
On 7/8/2024 11:16 AM, Fred. Zwarts wrote:
You believe that two equals infinity.
>
void Infinite_Loop()
{
   HERE: goto HERE;
}
>
void Infinite_Recursion()
{
   Infinite_Recursion();
}
>
void DDD()
{
   HHH(DDD);
}
>
Two cycles is enough to correctly determine that none
of the above functions correctly emulated by HHH can
possibly halt.
>
That you don't see this is ignorance or deception.
>
>
The first two irrelevant examples cannot halt, but they differ fundamentally from DDD, because DDD, like Finite_Recursion, halts after N repetitions.
>
 *I have never explained this issue to Ben this clearly before*
Ben seems to believe that HHH must report that it need not
abort the emulation of DDD because AFTER HHH has already
aborted this emulation DDD does not need to be aborted.
 
Because it does, since this HHH DOES abort its emulation, it turns out that a complete emulation of this input could be done, which is the definition of not needing to abort the emulation.
Remember, you can't change the input when you talk about it, and that includes the copy of the ORIGINAL HHH that it calls. So any "alternate" HHH you want to talk about needs to have a different name and at a different address. That is a limitation of the format you put your program into.

Date Sujet#  Auteur
3 Jul 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal