Re: Termination analyzer defined

On 5/10/24 10:59 PM, olcott wrote:

On 5/10/2024 9:39 PM, Richard Damon wrote:

On 5/10/24 10:24 PM, olcott wrote:

On 5/10/2024 9:16 PM, Richard Damon wrote:

On 5/10/24 8:59 PM, olcott wrote:

On 5/10/2024 7:30 PM, olcott wrote:

A termination analyzer is different than a halt decider in that it need
not correctly determine the halt status of every input. For the purposes
of this paper a termination analyzer only needs to correctly determine
the halt status of one terminating input and one non-terminating input.
The computer science equivalent would be a halt decider with a limited
domain that includes at least one halting and one non-halting input.
>
>

>
So all the people that said termination analyzer WAS NOT DEFINED
never meant that termination analyzer WAS NOT DEFINED. They all
meant that it was not defined well enough directly in my paper
even though it it a current term-of-the-art.
>

>
Do you have a reference which uses that definition?
>
Not just something you said yourself?

>
>
Now that I understand that ALL of the people that said my terms
were undefined NEVER meant that they were actually undefined I
can fix this.
>

>
Still don't understand universal qualifiers.

 *ALL D simulated by H*
does not include
*SOME D NEVER simulated by H*
 All cows running around in a pasture includes ZERO dead cows.

But simulating zero steps *IS* simulating ALL your steps simulated correctly.
And, you don't understand that "ALL D Simulated by H" isn't a property of D, or even H, but of problems looked at.
You are just showing you don't understand how english grammer works, because you are too stupid.

 

>
Since SOME people (like me) have said that you didn't define your terms, you can't use vacous meanings.
>
I guess since your replay to asking for a reference was a deflection, you are just admitting that this was just a Olcott invention, like most of your "verified facts" that are just your own made up LIES.
>