Groups | Search | Server Info | Login | Register

Groups > sci.logic > #254450

Re: Termination Analyzer H prevents Denial of Service attacks

Cross-posted to 3 groups.

Show all headers | View raw

On 6/16/23 10:38 AM, olcott wrote:
> On 6/16/2023 6:45 AM, Richard Damon wrote:
>> On 6/15/23 11:39 PM, olcott wrote:
>>> On 6/15/2023 10:17 PM, Richard Damon wrote:
>>>> On 6/15/23 11:00 PM, olcott wrote:
>>>>> On 6/15/2023 9:32 PM, Richard Damon wrote:
>>
>>>>>> But, what EXACTLY is your definition of "Pathologica",
>>>>> We have covered this 10,000 times and you really don't remember or 
>>>>> are you trolling me?
>>>>>
>>>>
>>>> You may think you have, but you actually haven't provided a precice 
>>>> definition that can apply to Turing machines equivalents.
>>>>
>>>> Remember, D is supposed to have its own copy of H, and can't 
>>>> actually call the code in a different machines (thus calling the 
>>>> same address as H doesn't count).
>>>>
>>>> If you are going to conceed a less than turing equivalent system, 
>>>> you have conceeded that you system doesn't meet the requirements.
>>>>
>>>>
>>>> If you want to say you have, give an actual reference to the 
>>>> message, or you are just shown to be the liar you are.
>>>
>>> I have already showed this on the Peter Linz proof hundreds of times.
>>> Even if the input is copied it is still nested simulation that never
>>> stops unless aborted. Peter Linz actually replied to my email recently.
>>>
>>
>> So, you ADMIT that you are a LIAR, and don't know what you are talking 
>> about.
> I have had enough of this. When you call me a liar that makes you a liar
> because what I say that you call a lie is an easily verified fact.
> 
> *Termination Analyzer H prevents Denial of Service attacks*
> https://www.researchgate.net/publication/369971402_Termination_Analyzer_H_prevents_Denial_of_Service_attacks
> 
> on pages 2-3 of the above paper
> 
> When Ĥ is applied to ⟨Ĥ⟩
> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
> 
> Simulation invariant: ⟨Ĥ⟩ correctly simulated by embedded_H never
> reaches its own simulated final state of ⟨Ĥ.qn⟩ and just like H(D,D)
> will never stop running unless its simulation has been aborted.
> 
> 
> 
> 
> Termination Analyzer H prevents Denial of Service attacks
> https://www.researchgate.net/publication/369971402_Termination_Analyzer_H_prevents_Denial_of_Service_attacks
> 
> 

No, I am right and you are wrong, and you just are showing that you 
don't understand what you are talking about.

For instance, your FIRST sentence is based on error.

You say:
When the halting problem is construed as requiring a correct yes/no 
answer to a self-contradictory question it cannot be solved.

But, the answer required is NOT "self-contradictory", as it ALWAYS has a 
definite answer, The problem is your don't understand that your H needs 
to be an actual Turing Machine (or equivalent), and one you fix your H 
into that form, there is a definite answer to the Halting Question for 
the machine H^ built on that H, it is the opposite of whatever your 
claimed "correct" H happens to give. (the key is H^ isn't contradictory 
to ITSELF, it is contradictory to H)

In one sense, your statement has a correct basis, because we can build 
this sort of H^, that cause this sort of contradictory behavior, the 
problem of creating a correct Halt Decider can not be solved, but that 
doesn't negate the problem, but answers it. It is actually inpossible to 
create a correct halt decider, so the "Halting Function" is determined 
to be non-computable.

Then you are wrong in the second sentence:fl
The purpose of solving the halting problem is to determine non-halting 
bugs and non-halting malevolent software.

That is absolutely NOT the purpose of solving the Halting Problem, 
remember, the Halting Problem was create LONG before "Modern" computers 
with their software, so that can't be the actual purpose of it. Its 
purpose goes back to times when mathmeticians were investigating the 
fundamental power of "Computations", the "Mechanical" act of solving a 
problem, which had impact into the field of theorem proving.

Having started with these two errors, you have put yourself into a 
corner, and totally misinterpret the actual requirements and get 
yourself stuck deep in the weeds of errors.

This shows in things like you looking at H as being two totally 
different programs with different behaviors both existing in the same 
problem at the same time (the H that does abort and the H that doesn't) 
which is a actual impossiblity and makes your whole logic just invalid 
and unsound.

Yes, the fact that you have keep on repeating these errors, even after 
having the errors pointed out does confirm that you are the hypocritical 
ignorant pathological lying idiot that I call you.

Hypocritical, because you claim that "Correct Logic" must start from the 
Truth Makers of the system, but you start with a falsehood, that H can 
be two different programs.

Ignorant, because it is clear that you truely don't understand any of 
the basic material of the fields you are talking about.

Pathological (liar), because you lies seem to be based on your inability 
to comprend what is actually true, but are stuck into believing your own 
lies.

(Pathological) Lying: because most of what you say is just incorrect, 
being based on totally incorrect assumptions and logic. It isn't just an 
"Honest Error", but fails the reasonable person test, a reasonable 
person, when given the corrections you have received, whould see they 
are incorrect, instead, you seem to just ignore the corrections, because 
they just don't make sense to you, because you are stuck in your falsehood.

Idiot, because you errors are not just from a lack of knowledge, but are 
also based on totally incorrect reasoning processes.

In short, you have failed to show what you are trying to show, but are 
instead showing how bad you are at understanding anything about what you 
talk about.

Back to sci.logic | Previous | Next — Previous in thread | Find similar

Thread

Termination Analyzer H prevents Denial of Service attacks olcott <polcott2@gmail.com> - 2023-06-15 11:50 -0500
  Re: Termination Analyzer H prevents Denial of Service attacks Richard Damon <Richard@Damon-Family.org> - 2023-06-15 12:57 -0400
    Re: Termination Analyzer H prevents Denial of Service attacks olcott <polcott2@gmail.com> - 2023-06-15 12:31 -0500
      Re: Termination Analyzer H prevents Denial of Service attacks Richard Damon <Richard@Damon-Family.org> - 2023-06-15 15:58 -0400
        Re: Termination Analyzer H prevents Denial of Service attacks olcott <polcott2@gmail.com> - 2023-06-15 15:29 -0500
          Re: Termination Analyzer H prevents Denial of Service attacks Richard Damon <Richard@Damon-Family.org> - 2023-06-15 17:16 -0400
            Re: Termination Analyzer H prevents Denial of Service attacks olcott <polcott2@gmail.com> - 2023-06-15 18:56 -0500
              Re: Termination Analyzer H prevents Denial of Service attacks Richard Damon <Richard@Damon-Family.org> - 2023-06-15 21:41 -0400
                Re: Termination Analyzer H prevents Denial of Service attacks olcott <polcott2@gmail.com> - 2023-06-15 21:00 -0500
                Re: Termination Analyzer H prevents Denial of Service attacks Richard Damon <Richard@Damon-Family.org> - 2023-06-15 22:32 -0400
                Re: Termination Analyzer H prevents Denial of Service attacks olcott <polcott2@gmail.com> - 2023-06-15 22:00 -0500
                Re: Termination Analyzer H prevents Denial of Service attacks Richard Damon <Richard@Damon-Family.org> - 2023-06-15 23:17 -0400
                Re: Termination Analyzer H prevents Denial of Service attacks olcott <polcott2@gmail.com> - 2023-06-15 22:39 -0500
                Re: Termination Analyzer H prevents Denial of Service attacks Richard Damon <Richard@Damon-Family.org> - 2023-06-16 07:45 -0400
                Re: Termination Analyzer H prevents Denial of Service attacks olcott <polcott2@gmail.com> - 2023-06-16 09:38 -0500
                Re: Termination Analyzer H prevents Denial of Service attacks Richard Damon <Richard@Damon-Family.org> - 2023-06-16 19:45 -0400

csiph-web