Re: Can someone please verify the execution trace of this?

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*
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer