Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: olcott Newsgroups: comp.lang.c,comp.lang.c++ Subject: Re: Can someone please verify the execution trace of this? Date: Mon, 20 May 2024 15:10:42 -0500 Organization: A noiseless patient Spider Lines: 131 Message-ID: References: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Mon, 20 May 2024 22:10:43 +0200 (CEST) Injection-Info: dont-email.me; posting-host="629f9cefad5d4023792ce8f8ed8d9594"; logging-data="173536"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/ac//4jKDTbKVqvl5GXzzC" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:Be1oMZaAtGfdS23+eg0xJeIECfY= In-Reply-To: Content-Language: en-US Bytes: 6764 On 5/20/2024 3:04 PM, Chris M. Thomasson wrote: > On 5/20/2024 12:53 PM, olcott wrote: >> On 5/20/2024 2:47 PM, Chris M. Thomasson wrote: >>> On 5/20/2024 12:45 PM, olcott wrote: >>>> On 5/20/2024 2:41 PM, Chris M. Thomasson wrote: >>>>> On 5/20/2024 12:37 PM, olcott wrote: >>>>>> On 5/20/2024 2:32 PM, Chris M. Thomasson wrote: >>>>>>> On 5/20/2024 12:23 PM, Chris M. Thomasson wrote: >>>>>>>> On 5/20/2024 12:15 PM, olcott wrote: >>>>>>>>> On 5/20/2024 1:35 PM, Chris M. Thomasson wrote: >>>>>>>>>> On 5/20/2024 10:20 AM, olcott wrote: >>>>>>>>>>> On 5/20/2024 12:15 PM, Bonita Montero wrote: >>>>>>>>>>>> Am 20.05.2024 um 18:01 schrieb olcott: >>>>>>>>>>>>> On 5/20/2024 10:16 AM, Bonita Montero wrote: >>>>>>>>>>>>>> Am 20.05.2024 um 16:47 schrieb olcott: >>>>>>>>>>>>>> >>>>>>>>>>>>>>> It is a simple question about the behavior of C functions. >>>>>>>>>>>>>>> This group's purpose is the C/C++ language. >>>>>>>>>>>>>> >>>>>>>>>>>>>> Your question is generic to most languages and you're >>>>>>>>>>>>>> not asking how to do that in C or how to improve that. >>>>>>>>>>>>>> And you're asking the same thing for years. >>>>>>>>>>>>>> >>>>>>>>>>>>> >>>>>>>>>>>>> Yes I am very persistent. I keep asking until >>>>>>>>>>>>> I get an answer. >>>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> After some time you should recognize you're doing circles. >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> I am asking a straight forward question that people >>>>>>>>>>> keep ignoring it has nothing to do will my circles: >>>>>>>>>>> Ask until answered stops when answered. >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> Think of your halt decider running a black box program. >>>>>>>>> >>>>>>>>> *It is not even a halt decider in this post it is merely a >>>>>>>>> simulator* >>>>>>>> [...] >>>>>>>> >>>>>>>> Humm... So, what is your main point? You cannot decide if a >>>>>>>> program will halt, _unless_ you code the test program? >>>>>>>> >>>>>>> >>>>>>> Can I create a program that runs in your simulator? Can I call >>>>>>> into a TRNG or something? Create a race condition on purpose? >>>>>>> Check this out: >>>>>>> >>>>>>> https://groups.google.com/g/comp.lang.c++/c/7u_rLgQe86k/m/fYU9SnuAFQAJ >>>>>>> >>>>>>> >>>>>> >>>>>> The entire scope of my 20 year primary research only has >>>>>> the scope of the conventional HP counter-example inputs. >>>>>> >>>>>> I can do this at the Turing Machine level too, yet off-topic >>>>>> for this group. >>>>>> >>>>> >>>>> So, you do not care if the halting problem can be applied to a >>>>> "black box" program? What am I missing here? I must be missing >>>>> something important, right? >>>> >>>> I do not want to discuss things that are off-topic for this >>>> group. I don't want to discuss anything with anyone until >>>> after my claim about the execution trace has been validated. >>>> >>>> I am using categorically exhaustive reasoning that can work >>>> through every possibility that can possibly exist in a feasible >>>> amount of time as long as the category is very very narrow. >>>> >>>> Enlarge the category a tiny little bit and then the time >>>> becomes infeasible. >>>> >>>> THIS IS THE CATEGORY >>>> *D correctly simulated by H never reaches its own line 06 and halts* >>>> >>>> >>> >>> How can I create a program that runs in your simulator? >> That is another different category of question. > > It's been a while since I have used x86 assembly language. But, I can > get back into it, if needed... Here is some of my older code: > > https://web.archive.org/web/20060214112539/http://appcore.home.comcast.net/appcore/src/cpu/i686/ac_i686_masm_asm.html > > I found out that almost everyone is totally clueless about assembly language and that is why it is so important that credible experts confirm what I already know: 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* >> >> If I was not diagnosed with POD24 and instead was 100% totally >> immortal I could not tolerate the change-the-subject rebuttal >> and prove my point in finite time. >> >> *Validation of POD24 as a robust early clinical end point of* >> *poor survival in FL from 5225 patients on 13 clinical trials* >> https://pubmed.ncbi.nlm.nih.gov/34614146/ >> > -- Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer