Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.c++ > #87335

Re: Simulating halt decider applied to a simpler input

From olcott <polcott2@gmail.com>
Newsgroups comp.theory, sci.logic, comp.lang.c++
Subject Re: Simulating halt decider applied to a simpler input
Followup-To comp.theory
Date 2022-11-12 08:43 -0600
Organization A noiseless patient Spider
Message-ID <tkobf8$16bfq$2@dont-email.me> (permalink)
References (17 earlier) <2NDbL.106883$U709.73582@fx16.iad> <tkn1i8$1m9b$1@gioia.aioe.org> <yXDbL.106886$U709.39749@fx16.iad> <tkn5on$v3b$1@gioia.aioe.org> <%HNbL.90216$2Rs3.25035@fx12.iad>

Cross-posted to 3 groups.

Followups directed to: comp.theory

Show all headers | View raw


On 11/12/2022 8:02 AM, Richard Damon wrote:
> On 11/11/22 11:00 PM, olcott wrote:
>> On 11/11/2022 8:56 PM, Richard Damon wrote:
>>> On 11/11/22 9:48 PM, olcott wrote:
>>>> On 11/11/2022 8:45 PM, Richard Damon wrote:
>>>>> On 11/11/22 9:35 PM, olcott wrote:
>>>
>>>> Yes and when embedded_H can predict this in a finite number of steps 
>>>> then it is a halt decider for ⟨Ĥ⟩ ⟨Ĥ⟩.
>>>>
>>>
>>> Except that it can't do that since it is shown that H^ <H^> Will halt 
>>> in this case, so it is impossible to correctly predict that a correct 
>>> simulation of the input <H^> <H^> will not halt.
>> A simulating halt decider must correctly predict (in a finite number 
>> of steps whether or not its simulated input would ever stop running if 
>> it never aborted its simulation of its input.
>>
>>
> 
> Right, it must, but it can't. Again, your Egish is lacking because you 
> are too stupid.
> 
> If you claim it can, what pattern did it use to detect this, that ALWAYS 
> shows the program is non-halting?
> 
> I will note that E(E) calling H(E,E) is NOT such a pattern, as E(E) will 
> halt if H(E,E) is defined to abort that simulation and return 0.
void Infinite_Loop()
{
   HERE: goto HERE;
}

It is an easily verified fact that Infinite_Loop correctly simulated by 
H would never reach its own last instruction and terminate normally 
after 1 to ∞ steps of correct simulation.

void E(void (*x)())
{
   H(x, x);
}

It is an easily verified fact that E correctly simulated by H would 
never reach its own last instruction and terminate normally after 1 to ∞ 
steps of correct simulation.


-- 
Copyright 2022 Pete Olcott "Talent hits a target no one else can hit;
Genius hits a target no one else can see." Arthur Schopenhauer

Back to comp.lang.c++ | Previous | NextPrevious in thread | Next in thread | Find similar | Unroll thread


Thread

Simulating halt decider applied to a simpler input olcott <polcott2@gmail.com> - 2022-11-11 09:28 -0600
  Re: Simulating halt decider applied to a simpler input olcott <none-ya@beez-waxes.com> - 2022-11-11 18:05 -0600
  Re: Simulating halt decider applied to a simpler input olcott <polcott2@gmail.com> - 2022-11-12 08:43 -0600
  Re: Simulating halt decider applied to a simpler input olcott <polcott2@gmail.com> - 2022-11-12 09:50 -0600

csiph-web