Path: ...!weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.lang.c,comp.lang.c++
Subject: Re: Can someone please verify the execution trace of this?
Date: Mon, 20 May 2024 14:48:44 -0500
Organization: A noiseless patient Spider
Lines: 65
Message-ID: <v2g9es$59f0$2@dont-email.me>
References: <v2b78t$2vima$1@dont-email.me>
 <v2df79$3ghfd$1@raubtier-asyl.eternal-september.org>
 <v2di7v$3gujt$1@dont-email.me>
 <v2eada$3p6sk$1@raubtier-asyl.eternal-september.org>
 <v2edbr$3pl2i$1@dont-email.me>
 <v2eluk$3r1qu$1@raubtier-asyl.eternal-september.org>
 <v2enl9$3r9t0$1@dont-email.me>
 <v2erbb$3rt3e$1@raubtier-asyl.eternal-september.org>
 <v2fnqq$1hhg$1@dont-email.me>
 <v2fpgi$1vq6$1@raubtier-asyl.eternal-september.org>
 <v2fs3s$2i1u$1@dont-email.me>
 <v2g0fd$3hp3$1@raubtier-asyl.eternal-september.org>
 <v2g0oc$3j0c$1@dont-email.me> <v2g55d$4cjb$1@dont-email.me>
 <v2g7fv$4nu0$4@dont-email.me> <v2g7vf$51fq$1@dont-email.me>
 <v2g882$52r2$1@dont-email.me> <v2g8c6$51fq$2@dont-email.me>
 <v2g8jq$551c$1@dont-email.me> <v2g8s8$51fq$5@dont-email.me>
 <v2g8vg$551c$4@dont-email.me> <v2g96d$51fq$8@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 20 May 2024 21:48:45 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="629f9cefad5d4023792ce8f8ed8d9594";
	logging-data="173536"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19TvOCrjOzJZdsI6IsLTD0C"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:hTu2rjWXlq/xOud0EiLbPuk6Z3w=
Content-Language: en-US
In-Reply-To: <v2g96d$51fq$8@dont-email.me>
Bytes: 3748

On 5/20/2024 2:44 PM, Chris M. Thomasson wrote:
> On 5/20/2024 12:40 PM, olcott wrote:
>> On 5/20/2024 2:38 PM, Chris M. Thomasson wrote:
> [...]
>>> So, your thing will tell me if a program XYZ will halt or not only 
>>> _after_ it simulates to infinity? What am I missing here?
>>
>> *The 100% totally complete every single detail scope of my post*
>> *The 100% totally complete every single detail scope of my post*
>> *The 100% totally complete every single detail scope of my post*
>>
>> typedef int (*ptr)();  // ptr is pointer to int function
>> 00 int H(ptr p, ptr i);
>> 01 int D(ptr p)
>> 02 {
>> 03   int Halt_Status = H(p, p);
>> 04   if (Halt_Status)
>> 05     HERE: goto HERE;
>> 06   return Halt_Status;
>> 07 }
>> 08
>> 09 int main()
>> 10 {
>> 11   H(D,D);
>> 12   return 0;
>> 13 }
>> [...]
>> For every H/D pair of the above template D correctly simulated by pure
>> function (thus computable function) H cannot possibly reach its own
>> final state at line 06 and halt.
>>
>>
> 
> Define H?

I have two fully operational examples of H that have been fully
operational for years. I am not talking about those. I am only
talking this:

typedef int (*ptr)();  // ptr is pointer to int function
00 int H(ptr p, ptr i);
01 int D(ptr p)
02 {
03   int Halt_Status = H(p, p);
04   if (Halt_Status)
05     HERE: goto HERE;
06   return Halt_Status;
07 }
08
09 int main()
10 {
11   H(D,D);
12   return 0;
13 }

Every element of an infinite set of H/D pairs matching the above
template where H correctly simulates 1 to ∞ steps of D thus including
0 to ∞ recursive simulations of H simulating itself simulating D.
*D correctly simulated by H never reaches its own line 06 and halts*


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