Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.theory > #25219 > unrolled thread

Refuting the halting problem proofs by deciding the previously undecidable input (V7)

Started byolcott <NoOne@NoWhere.com>
First post2020-11-13 09:14 -0600
Last post2020-11-13 14:18 -0700
Articles 14 on this page of 34 — 5 participants

Back to article view | Back to comp.theory


Contents

  Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 09:14 -0600
    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-13 15:51 +0000
      Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 10:09 -0600
        Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Richard Damon <Richard@Damon-Family.org> - 2020-11-13 11:24 -0500
          Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 10:37 -0600
            Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-13 17:56 +0000
              Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 12:18 -0600
                Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-13 22:31 +0000
                  Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 16:45 -0600
                    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Richard Damon <Richard@Damon-Family.org> - 2020-11-13 17:56 -0500
                      Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 17:02 -0600
                        Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Richard Damon <Richard@Damon-Family.org> - 2020-11-13 18:59 -0500
                          Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 18:21 -0600
                            Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Richard Damon <Richard@Damon-Family.org> - 2020-11-13 20:54 -0500
                              Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 20:35 -0600
                                Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Richard Damon <Richard@Damon-Family.org> - 2020-11-13 22:39 -0500
                                  Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) [ counter-example? ] olcott <NoOne@NoWhere.com> - 2020-11-13 22:11 -0600
                                    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) [ counter-example? ] olcott <NoOne@NoWhere.com> - 2020-11-13 22:22 -0600
                                    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) [ counter-example? ] Richard Damon <Richard@Damon-Family.org> - 2020-11-14 09:33 -0500
                    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-14 01:48 +0000
                      Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 20:24 -0600
                        Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-14 15:09 +0000
                      Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) [ counter-example? ] olcott <NoOne@NoWhere.com> - 2020-11-13 23:44 -0600
                        Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) [ counter-example? ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-14 14:54 +0000
        Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-13 17:39 +0000
          Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 12:14 -0600
            Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-13 22:12 +0000
              Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 16:32 -0600
                Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-14 01:56 +0000
                  Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) olcott <NoOne@NoWhere.com> - 2020-11-13 21:23 -0600
                    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-14 14:54 +0000
    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Jeff Barnett <jbb@notatt.com> - 2020-11-13 11:34 -0700
      Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2020-11-13 20:45 +0000
        Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) Jeff Barnett <jbb@notatt.com> - 2020-11-13 14:18 -0700

Page 2 of 2 — ← Prev page 1 [2]


#25264

Fromolcott <NoOne@NoWhere.com>
Date2020-11-13 20:24 -0600
Message-ID<ALednbGGZ4p8ojLCnZ2dnUU7-QvNnZ2d@giganews.com>
In reply to#25261
On 11/13/2020 7:48 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 11/13/2020 4:31 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 11/13/2020 11:56 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 11/13/2020 10:24 AM, Richard Damon wrote:
>>>>>>> On 11/13/20 11:09 AM, olcott wrote:
>>>>>>>> On 11/13/2020 9:51 AM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> When-so-ever UTM halt decider H decides that:
>>>>>>>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>>>>>         and
>>>>>>>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>>>>> then H has made a correct not-halting decision on this input.
>>>>>>>>>>
>>>>>>>>>> Since it does divide all of its inputs into {halting and
>>>>>>>>>> not-halting}** it is a halt decider.
>>>>>>>>>
>>>>>>>>> No, that's not what the halting problem is about.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Sure it is:
>>>>>>>>
>>>>>>>>        **The Halting problem is a problem in computer science.
>>>>>>>>        The problem is looking at a computer program and finding
>>>>>>>>        out if the program is going to run forever or not. We say
>>>>>>>>        that a program "solves the halting problem" if it can
>>>>>>>>        look at any other program and tell if that other program
>>>>>>>>        will run forever or not.
>>>>>>>>        https://simple.wikipedia.org/wiki/Halting_problem
>>>>>>>>
>>>>>>>> Glancing at a few of my words for the purpose of contriving some sort of
>>>>>>>> rebuttal has not ultimately been a very effective strategy for you.
>>>>>>>>
>>>>>>>
>>>>>>> The key differencne between that and what you say is that this
>>>>>>> definition is based on the ACTUAL behavior of the actual program, and
>>>>>>> not on what some program did or did not do while analyising the program.
>>>>>>>
>>>>>>> YOUR definition focuses on what the decider did, not what the program
>>>>>>> under test does, and if there is a possible difference, you resolve it
>>>>>>> by focusing on the decider, and NOT on the actual program. Thus, you
>>>>>>> program is NOT a true Halting Decider.
>>>>>>>
>>>>>>
>>>>>> Since H does divide all of its inputs into {halting and not-halting}
>>>>>> it is a halt decider.
>>>>>
>>>>> It does not, as you yourself have told us.  Given
>>>>>
>>>>> void H_Hat(u32 P) { if (H(P, P)) while (1); }
>>>>>
>>>>>> 08 bool H(u32 P, u32 I)
>>>>>> 09 {
>>>>>> 10   bool Halted  = false;
>>>>>> 11   bool Aborted = false;
>>>>>> 12   while (!Halted && !Aborted)
>>>>>> 13   {
>>>>>> 14     Halted  = DebugStep(P, I);
>>>>>> 15     Aborted = Needs_To_Be_Aborted();
>>>>>> 16   }
>>>>>> 17   return !Aborted;
>>>>>> 18 }
>>>>>
>>>>> You have confirmed that H(H_Hat, H_Hat) is false and that H_Hat(H_hat)
>>>>> is a finite computation.
>>>>
>>>> When anyone cites what is purported to be a counter-example to a halt
>>>> decider correctly deciding its inputs and this "counter-example" is not
>>>> an input to this halt decider they commit the straw-man error of
>>>> reasoning.
>>>
>>> I gave a counter example to H being a halt decider.  It is the pair
>>> (H_Hat, H_Hat).  It is "input" (at least as close as your code has to
>>> such a thing) to the halt decider H.
>>
>>> H gives the wrong answer
>>> (according to you).
>>
>> You know that I never said that.
> 
> If you say, as you have, that H(H_Hat, H_Hat) is false, and that
> H_Hat(H_Hat) halts, you are telling the world that H is getting it wrong
> on the plain facts of the matter.
> 

Like I said you know that I never said that.

>> The H that I defined gives the correct answer.
> 
> As you know, false is the wrong answer for a finite computation.  We
> have entered a Big Brother world where truth has changed its meaning.
> "Halting" is no longer about the actual program in question but by
> assessing different program:
> 
>> H(H_Hat, H_Hat) decides not-halting and all of the not-halting
>> decisions can be easily verified as definitely correct by this
>> process:
> 
> Unfortunately (as you know perfectly well) they must be verified
> according to whether they are or are not finite computations, not by the
> process of constructing a slightly different computation and assessing
> that instead.

When-so-ever a UTM halt decider H makes its not-halting decision by 
ceasing to simulate its input (<P>,I) the correctness of a not-halting 
decision is verified when the input (<P>,I) fails to terminate after the 
halt decider has had its halt deciding capability disabled.

>> When simply removing the halt deciding capability of H (on line 15)
>> results in the infinite execution of all of these inputs this proves
>> beyond all doubt what-so-ever that H did decide all of these
>> not-halting inputs correctly.
> 
> Yes, these other computations, with different embedded H functions,
> might indeed behave differently, but as written above, H_Hat(H_Hat) is a
> finite computation yet H(H_Hat, H_Hat) reports otherwise.
> 
>>> If you are saying that some other function is in fact a halt decider,
>>> please actually show it, and I will give you the counter example to it
>>> being one.  The same counter-example does not apply to all deciders,
>>> though they often look similar.
>>
>> It seems that you only have rhetoric and misunderstandings.
> 
> Unfortunately you have been clear.  You know, from two years ago, that
> being clear can only lead to trouble, and so it has this time around
> too.  There is no confusion at all about the facts here:
> 
> (a) H(H_Hat, H_Hat) == false.
> 
> (b) H_Hat(H_hat) is a finite computation.
> 
> (c) You say false from this H is correct because a different
>      computation, where a different H is embedded in H_Hat, makes
>      H_Hat(H_hat) a non-finite computation.

You already know that the above is not a valid counter-example:

Anyone can know with complete certainty entirely based on the meaning of 
the words that every counter-example proving that a decider decides its 
inputs incorrectly must itself be an input to this decider that this 
decider decides incorrectly.

Anything short of this is mere rhetorical double-talk.

You persist in this rhetorical double-talk because you are out of 
options to show that I am incorrect and your only focus is on rebuttal 
not mutual understanding.

>> The halt decider defined above cannot be fooled by the conventional
>> halting problem trick so I have at least refuted the conclusion of all
>> of these proofs.
> 
> H gets the example I gave wrong.  False is the wrong answer for a finite
> computation.  You are just too cowardly to say so, or to admit to your
> Orwellian tactic of redefining what the right answer is.

You already know that the above is not a valid counter-example:

Anyone can know with complete certainty entirely based on the meaning of 
the words that every counter-example proving that a decider decides its 
inputs incorrectly must itself be an input to this decider that this 
decider decides incorrectly.

Anything short of this is mere rhetorical double-talk.

You persist in this rhetorical double-talk because you are out of 
options to show that I am incorrect and your only focus is on rebuttal 
not mutual understanding.

> I know why you can't admit it -- it would mean 16 or more years down the
> tube -- but you should know that by now you look very foolish indeed.
> You can not dispute the facts (a) or (b) -- because you yourself
> provided them -- but neither can you admit what those facts mean.
> 
> You can only restate, again and again, your redefinition of what the
> right answer is, whilst trying to suggest that it's the "proper" meaning
> of the term.  Saying that explicitly would simply be the end of the
> matter because no one cares about your definition.
  The one thing that is very good about everyone trying everything that 
they possibly can to prove that I am wrong is that my prose argument has 
become enormously more clear than it was even one month ago.

To get an article published the prose portion must be very very clear. 
This would not have been possible without the last 30 days of review.

-- 
Copyright 2020 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#25276

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2020-11-14 15:09 +0000
Message-ID<87361cm0uy.fsf@bsb.me.uk>
In reply to#25264
I have replied to you later reply, but there are a few point in this one
that I want to pick up on...

Facts not in dispute:

void H_Hat(u32 P) { if (H(P, P)) while (1); }

bool H(u32 P, u32 I)
{
  bool Halted  = false;
  bool Aborted = false;
  while (!Halted && !Aborted)
  {
    Halted  = DebugStep(P, I);
    Aborted = Needs_To_Be_Aborted();
  }
  return !Aborted;
}

You have confirmed that H(H_Hat, H_Hat) is false and that H_Hat(H_hat)
is a finite computation.

olcott <NoOne@NoWhere.com> writes:

> When-so-ever a UTM halt decider H makes its not-halting decision by
> ceasing to simulate its input (<P>,I) the correctness of a not-halting
> decision is verified when the input (<P>,I) fails to terminate after
> the halt decider has had its halt deciding capability disabled.

No.  That's your silly redefinition of the halting problem.  The halting
problem is about the code exactly as written.

> You persist in this rhetorical double-talk because you are out of
> options to show that I am incorrect and your only focus is on rebuttal
> not mutual understanding.

This must be pure projection.  I am not the one writing fuddled
sentences like this:

  "Anyone can know with complete certainty entirely based on the meaning
  of the words that every counter-example proving that a decider decides
  its inputs incorrectly must itself be an input to this decider that
  this decider decides incorrectly."

you are.  I am simply stating facts you have presented: (a) that
H(H_Hat, H_Hat) is false and (b) that H_Hat(H_Hat) is a finite
computation.  I can't see how you can see this as rhetoric.

> To get an article published the prose portion must be very very
> clear. This would not have been possible without the last 30 days of
> review.

You also have something to say and you don't.  It is beyond parody that
think you have something to publish (and that is rhetoric).

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#25270 — Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) [ counter-example? ]

Fromolcott <NoOne@NoWhere.com>
Date2020-11-13 23:44 -0600
SubjectRe: Refuting the halting problem proofs by deciding the previously undecidable input (V7) [ counter-example? ]
Message-ID<5f6dnU35XvQ68zLCnZ2dnUU7-a_NnZ2d@giganews.com>
In reply to#25261
On 11/13/2020 7:48 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 11/13/2020 4:31 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 11/13/2020 11:56 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 11/13/2020 10:24 AM, Richard Damon wrote:
>>>>>>> On 11/13/20 11:09 AM, olcott wrote:
>>>>>>>> On 11/13/2020 9:51 AM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> When-so-ever UTM halt decider H decides that:
>>>>>>>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>>>>>         and
>>>>>>>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>>>>> then H has made a correct not-halting decision on this input.
>>>>>>>>>>
>>>>>>>>>> Since it does divide all of its inputs into {halting and
>>>>>>>>>> not-halting}** it is a halt decider.
>>>>>>>>>
>>>>>>>>> No, that's not what the halting problem is about.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Sure it is:
>>>>>>>>
>>>>>>>>        **The Halting problem is a problem in computer science.
>>>>>>>>        The problem is looking at a computer program and finding
>>>>>>>>        out if the program is going to run forever or not. We say
>>>>>>>>        that a program "solves the halting problem" if it can
>>>>>>>>        look at any other program and tell if that other program
>>>>>>>>        will run forever or not.
>>>>>>>>        https://simple.wikipedia.org/wiki/Halting_problem
>>>>>>>>
>>>>>>>> Glancing at a few of my words for the purpose of contriving some sort of
>>>>>>>> rebuttal has not ultimately been a very effective strategy for you.
>>>>>>>>
>>>>>>>
>>>>>>> The key differencne between that and what you say is that this
>>>>>>> definition is based on the ACTUAL behavior of the actual program, and
>>>>>>> not on what some program did or did not do while analyising the program.
>>>>>>>
>>>>>>> YOUR definition focuses on what the decider did, not what the program
>>>>>>> under test does, and if there is a possible difference, you resolve it
>>>>>>> by focusing on the decider, and NOT on the actual program. Thus, you
>>>>>>> program is NOT a true Halting Decider.
>>>>>>>
>>>>>>
>>>>>> Since H does divide all of its inputs into {halting and not-halting}
>>>>>> it is a halt decider.
>>>>>
>>>>> It does not, as you yourself have told us.  Given
>>>>>
>>>>> void H_Hat(u32 P) { if (H(P, P)) while (1); }
>>>>>
>>>>>> 08 bool H(u32 P, u32 I)
>>>>>> 09 {
>>>>>> 10   bool Halted  = false;
>>>>>> 11   bool Aborted = false;
>>>>>> 12   while (!Halted && !Aborted)
>>>>>> 13   {
>>>>>> 14     Halted  = DebugStep(P, I);
>>>>>> 15     Aborted = Needs_To_Be_Aborted();
>>>>>> 16   }
>>>>>> 17   return !Aborted;
>>>>>> 18 }
>>>>>
>>>>> You have confirmed that H(H_Hat, H_Hat) is false and that H_Hat(H_hat)
>>>>> is a finite computation.
>>>>
>>>> When anyone cites what is purported to be a counter-example to a halt
>>>> decider correctly deciding its inputs and this "counter-example" is not
>>>> an input to this halt decider they commit the straw-man error of
>>>> reasoning.
>>>
>>> I gave a counter example to H being a halt decider.  It is the pair
>>> (H_Hat, H_Hat).  It is "input" (at least as close as your code has to
>>> such a thing) to the halt decider H.
>>
>>> H gives the wrong answer
>>> (according to you).
>>
>> You know that I never said that.
> 
> If you say, as you have, that H(H_Hat, H_Hat) is false, and that
> H_Hat(H_Hat) halts, you are telling the world that H is getting it wrong
> on the plain facts of the matter.
> 

This is NOT a valid counter-example proving that a decider decides its 
inputs incorrectly:

int main()
   H_Hat(H_Hat);

Because every counter-example proving that a decider decides its inputs 
incorrectly must itself be an input to this decider that this decider 
decides incorrectly.

Can you come up with an actual counter-example?



-- 
Copyright 2020 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#25273 — Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) [ counter-example? ]

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2020-11-14 14:54 +0000
SubjectRe: Refuting the halting problem proofs by deciding the previously undecidable input (V7) [ counter-example? ]
Message-ID<87blg0m1jc.fsf@bsb.me.uk>
In reply to#25270
olcott <NoOne@NoWhere.com> writes:

> On 11/13/2020 7:48 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 11/13/2020 4:31 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 11/13/2020 11:56 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 11/13/2020 10:24 AM, Richard Damon wrote:
>>>>>>>> On 11/13/20 11:09 AM, olcott wrote:
>>>>>>>>> On 11/13/2020 9:51 AM, Ben Bacarisse wrote:
>>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>>
>>>>>>>>>>> When-so-ever UTM halt decider H decides that:
>>>>>>>>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>>>>>>         and
>>>>>>>>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>>>>>> then H has made a correct not-halting decision on this input.
>>>>>>>>>>>
>>>>>>>>>>> Since it does divide all of its inputs into {halting and
>>>>>>>>>>> not-halting}** it is a halt decider.
>>>>>>>>>>
>>>>>>>>>> No, that's not what the halting problem is about.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Sure it is:
>>>>>>>>>
>>>>>>>>>        **The Halting problem is a problem in computer science.
>>>>>>>>>        The problem is looking at a computer program and finding
>>>>>>>>>        out if the program is going to run forever or not. We say
>>>>>>>>>        that a program "solves the halting problem" if it can
>>>>>>>>>        look at any other program and tell if that other program
>>>>>>>>>        will run forever or not.
>>>>>>>>>        https://simple.wikipedia.org/wiki/Halting_problem
>>>>>>>>>
>>>>>>>>> Glancing at a few of my words for the purpose of contriving some sort of
>>>>>>>>> rebuttal has not ultimately been a very effective strategy for you.
>>>>>>>>>
>>>>>>>>
>>>>>>>> The key differencne between that and what you say is that this
>>>>>>>> definition is based on the ACTUAL behavior of the actual program, and
>>>>>>>> not on what some program did or did not do while analyising the program.
>>>>>>>>
>>>>>>>> YOUR definition focuses on what the decider did, not what the program
>>>>>>>> under test does, and if there is a possible difference, you resolve it
>>>>>>>> by focusing on the decider, and NOT on the actual program. Thus, you
>>>>>>>> program is NOT a true Halting Decider.
>>>>>>>>
>>>>>>>
>>>>>>> Since H does divide all of its inputs into {halting and not-halting}
>>>>>>> it is a halt decider.
>>>>>>
>>>>>> It does not, as you yourself have told us.  Given
>>>>>>
>>>>>> void H_Hat(u32 P) { if (H(P, P)) while (1); }
>>>>>>
>>>>>>> 08 bool H(u32 P, u32 I)
>>>>>>> 09 {
>>>>>>> 10   bool Halted  = false;
>>>>>>> 11   bool Aborted = false;
>>>>>>> 12   while (!Halted && !Aborted)
>>>>>>> 13   {
>>>>>>> 14     Halted  = DebugStep(P, I);
>>>>>>> 15     Aborted = Needs_To_Be_Aborted();
>>>>>>> 16   }
>>>>>>> 17   return !Aborted;
>>>>>>> 18 }
>>>>>>
>>>>>> You have confirmed that H(H_Hat, H_Hat) is false and that H_Hat(H_hat)
>>>>>> is a finite computation.
<cut>
> This is NOT a valid counter-example proving that a decider decides its
> inputs incorrectly:
>
> int main()
>   H_Hat(H_Hat);
>
> Because every counter-example proving that a decider decides its
> inputs incorrectly must itself be an input to this decider that this
> decider decides incorrectly.

As is the case here: H(H_Hat, H_Hat) incorrectly reports that
H_Hat(H_hat) is not a finite computation.

> Can you come up with an actual counter-example?

You provided it, originally.  I wrote H_Hat above just because you had
not included it.  You simply can't accept that the halting problem is
about the code as written.  You have confirmed that H(H_Hat, H_Hat) is
false and that H_Hat(H_hat) is a finite computation.  That's the wrong
answer.  I am happy to repeat this every time you try to pretend you
don't know this.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#25243

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2020-11-13 17:39 +0000
Message-ID<87ft5dnokk.fsf@bsb.me.uk>
In reply to#25232
olcott <NoOne@NoWhere.com> writes:

> On 11/13/2020 9:51 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> When-so-ever UTM halt decider H decides that:
>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>     and
>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>> then H has made a correct not-halting decision on this input.
>>>
>>> Since it does divide all of its inputs into {halting and
>>> not-halting}** it is a halt decider.
>>
>> No, that's not what the halting problem is about.
>
> Sure it is:
>
>    **The Halting problem is a problem in computer science.
>    The problem is looking at a computer program and finding
>    out if the program is going to run forever or not. We say
>    that a program "solves the halting problem" if it can
>    look at any other program and tell if that other program
>    will run forever or not.
>    https://simple.wikipedia.org/wiki/Halting_problem

<Sigh> H_Hat(H_Hat) is a halting computation (so you tell us).  You also
tell us that H(H_Hat, H_Hat) returns false.  Thus H is not a halting
decider.  Do say if you dispute any of these facts.

(Interested readers will have to go elsewhere to see H and H_Hat because
PO keeps starting new threads with no context -- spamming it's called.)

> Glancing at a few of my words for the purpose of contriving some sort
> of rebuttal has not ultimately been a very effective strategy for you.

If that is what I've been doing, it's working fine, thanks.  I have been
able to keep the record straight with minimal effort.  How is your
strategy working out?  Ready to write the paper that will make you famous?

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#25245

Fromolcott <NoOne@NoWhere.com>
Date2020-11-13 12:14 -0600
Message-ID<U9qdnVAfdo2KUDPCnZ2dnUU7-UnNnZ2d@giganews.com>
In reply to#25243
On 11/13/2020 11:39 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 11/13/2020 9:51 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> When-so-ever UTM halt decider H decides that:
>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>      and
>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>> then H has made a correct not-halting decision on this input.
>>>>
>>>> Since it does divide all of its inputs into {halting and
>>>> not-halting}** it is a halt decider.
>>>
>>> No, that's not what the halting problem is about.
>>
>> Sure it is:
>>
>>     **The Halting problem is a problem in computer science.
>>     The problem is looking at a computer program and finding
>>     out if the program is going to run forever or not. We say
>>     that a program "solves the halting problem" if it can
>>     look at any other program and tell if that other program
>>     will run forever or not.
>>     https://simple.wikipedia.org/wiki/Halting_problem
> 
> <Sigh> H_Hat(H_Hat) is a halting computation (so you tell us).  You also
> tell us that H(H_Hat, H_Hat) returns false.  Thus H is not a halting
> decider.  Do say if you dispute any of these facts.

When-so-ever UTM halt decider H decides that:
(1) its input (<P>,I) would never halt unless H stopped simulating it
   and
(2) its input (<P>,I) would never halt unless H stopped simulating it
then H has made a correct not-halting decision on this input.

Since H does divide all of its inputs into {halting and not-halting} it 
is a halt decider.

// Linz H with some of the ⊢* states shown
08 bool H(u32 P, u32 I)  // Page 318
09 {
10   bool Halted  = false;
11   bool Aborted = false;
12   while (!Halted && !Aborted)
13   {
14     Halted  = DebugStep(P, I);
15     Aborted = Needs_To_Be_Aborted();
16   }
17   return !Aborted;
18 }

When we remove line 15 all of the inputs that would have been decided to 
be not halting prove that they are indeed not halting by the fact that 
they fail to ever halt when line 15 is removed.

When anyone cites what is purported to be a counter-example to a halt 
decider correctly deciding its inputs and this "counter-example" is not 
an input to this halt decider they commit the straw-man error of 
reasoning:  https://en.wikipedia.org/wiki/Straw_man

> (Interested readers will have to go elsewhere to see H and H_Hat because
> PO keeps starting new threads with no context -- spamming it's called.)
> 
>> Glancing at a few of my words for the purpose of contriving some sort
>> of rebuttal has not ultimately been a very effective strategy for you.
> 
> If that is what I've been doing, it's working fine, thanks.  I have been
> able to keep the record straight with minimal effort.  How is your
> strategy working out?  Ready to write the paper that will make you famous?
> 

Getting very close. I want to finish the halt deciding code first. Once 
I have my x86utm system published in code repository and I carefully 
study the three textbooks that I have that discuss the halting problem I 
will be close to being able to write this paper.

This would have never been possible without the reviews from the 
reviewers here acting as the fitness function to the genetic process of 
deriving my results.  https://en.wikipedia.org/wiki/Fitness_function

-- 
Copyright 2020 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#25253

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2020-11-13 22:12 +0000
Message-ID<871rgwoqhu.fsf@bsb.me.uk>
In reply to#25245
olcott <NoOne@NoWhere.com> writes:

> On 11/13/2020 11:39 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 11/13/2020 9:51 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> When-so-ever UTM halt decider H decides that:
>>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>      and
>>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>>> then H has made a correct not-halting decision on this input.
>>>>>
>>>>> Since it does divide all of its inputs into {halting and
>>>>> not-halting}** it is a halt decider.
>>>>
>>>> No, that's not what the halting problem is about.
>>>
>>> Sure it is:
>>>
>>>     **The Halting problem is a problem in computer science.
>>>     The problem is looking at a computer program and finding
>>>     out if the program is going to run forever or not. We say
>>>     that a program "solves the halting problem" if it can
>>>     look at any other program and tell if that other program
>>>     will run forever or not.
>>>     https://simple.wikipedia.org/wiki/Halting_problem
>>
>> <Sigh> H_Hat(H_Hat) is a halting computation (so you tell us).  You also
>> tell us that H(H_Hat, H_Hat) returns false.  Thus H is not a halting
>> decider.  Do say if you dispute any of these facts.
>
> When-so-ever...  <blah, blah, blah>

That is probably the best I'll get.  I will continue to assume that you
don't dispute these facts.

> This would have never been possible without the reviews from the
> reviewers here acting as the fitness function to the genetic process
> of deriving my results.
> https://en.wikipedia.org/wiki/Fitness_function

The analogy is apt.  You do seem to be using tiny random changes along
with random recombination of old ideas to generate posts.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#25255

Fromolcott <NoOne@NoWhere.com>
Date2020-11-13 16:32 -0600
Message-ID<hs6dnUlnV5_1lDLCnZ2dnUU7-enNnZ2d@giganews.com>
In reply to#25253
On 11/13/2020 4:12 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 11/13/2020 11:39 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 11/13/2020 9:51 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> When-so-ever UTM halt decider H decides that:
>>>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>       and
>>>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>> then H has made a correct not-halting decision on this input.
>>>>>>
>>>>>> Since it does divide all of its inputs into {halting and
>>>>>> not-halting}** it is a halt decider.
>>>>>
>>>>> No, that's not what the halting problem is about.
>>>>
>>>> Sure it is:
>>>>
>>>>      **The Halting problem is a problem in computer science.
>>>>      The problem is looking at a computer program and finding
>>>>      out if the program is going to run forever or not. We say
>>>>      that a program "solves the halting problem" if it can
>>>>      look at any other program and tell if that other program
>>>>      will run forever or not.
>>>>      https://simple.wikipedia.org/wiki/Halting_problem
>>>
>>> <Sigh> H_Hat(H_Hat) is a halting computation (so you tell us).  You also
>>> tell us that H(H_Hat, H_Hat) returns false.  Thus H is not a halting
>>> decider.  Do say if you dispute any of these facts.
>>
>> When-so-ever...  <blah, blah, blah>
> 
> That is probably the best I'll get.  I will continue to assume that you
> don't dispute these facts.

Anyone can know with complete certainty entirely based on the meaning of 
the words that every counter-example proving that a decider decides its 
inputs incorrectly must itself be an input to this decider that this 
decider decides incorrectly.

Anything short of this is mere rhetorical double-talk.

>> This would have never been possible without the reviews from the
>> reviewers here acting as the fitness function to the genetic process
>> of deriving my results.
>> https://en.wikipedia.org/wiki/Fitness_function
> 
> The analogy is apt.  You do seem to be using tiny random changes along
> with random recombination of old ideas to generate posts.
> 


-- 
Copyright 2020 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#25263

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2020-11-14 01:56 +0000
Message-ID<87k0uon1k5.fsf@bsb.me.uk>
In reply to#25255
olcott <NoOne@NoWhere.com> writes:

> On 11/13/2020 4:12 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 11/13/2020 11:39 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 11/13/2020 9:51 AM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> When-so-ever UTM halt decider H decides that:
>>>>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>>       and
>>>>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>> then H has made a correct not-halting decision on this input.
>>>>>>>
>>>>>>> Since it does divide all of its inputs into {halting and
>>>>>>> not-halting}** it is a halt decider.
>>>>>>
>>>>>> No, that's not what the halting problem is about.
>>>>>
>>>>> Sure it is:
>>>>>
>>>>>      **The Halting problem is a problem in computer science.
>>>>>      The problem is looking at a computer program and finding
>>>>>      out if the program is going to run forever or not. We say
>>>>>      that a program "solves the halting problem" if it can
>>>>>      look at any other program and tell if that other program
>>>>>      will run forever or not.
>>>>>      https://simple.wikipedia.org/wiki/Halting_problem
>>>>
>>>> <Sigh> H_Hat(H_Hat) is a halting computation (so you tell us).  You also
>>>> tell us that H(H_Hat, H_Hat) returns false.  Thus H is not a halting
>>>> decider.  Do say if you dispute any of these facts.
>>>
>>> When-so-ever...  <blah, blah, blah>
>>
>> That is probably the best I'll get.  I will continue to assume that you
>> don't dispute these facts.
>
> Anyone can know with complete certainty entirely based on the meaning
> of the words that every counter-example proving that a decider decides
> its inputs incorrectly must itself be an input to this decider that
> this decider decides incorrectly.

Anyone can know with complete certainty entirely based on the meaning of
the words that the H_Hat counter-example that proves that H decides its
inputs incorrectly is itself the input to the H that H decides
incorrectly.

I think you could have been clearer, but I could not risk paraphrasing
such a messy sentence.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#25266

Fromolcott <NoOne@NoWhere.com>
Date2020-11-13 21:23 -0600
Message-ID<ZtCdndOV66I90DLCnZ2dnUU7-YHNnZ2d@giganews.com>
In reply to#25263
On 11/13/2020 7:56 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 11/13/2020 4:12 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 11/13/2020 11:39 AM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 11/13/2020 9:51 AM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> When-so-ever UTM halt decider H decides that:
>>>>>>>> (1) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>>>        and
>>>>>>>> (2) its input (<P>,I) would never halt unless H stopped simulating it
>>>>>>>> then H has made a correct not-halting decision on this input.
>>>>>>>>
>>>>>>>> Since it does divide all of its inputs into {halting and
>>>>>>>> not-halting}** it is a halt decider.
>>>>>>>
>>>>>>> No, that's not what the halting problem is about.
>>>>>>
>>>>>> Sure it is:
>>>>>>
>>>>>>       **The Halting problem is a problem in computer science.
>>>>>>       The problem is looking at a computer program and finding
>>>>>>       out if the program is going to run forever or not. We say
>>>>>>       that a program "solves the halting problem" if it can
>>>>>>       look at any other program and tell if that other program
>>>>>>       will run forever or not.
>>>>>>       https://simple.wikipedia.org/wiki/Halting_problem
>>>>>
>>>>> <Sigh> H_Hat(H_Hat) is a halting computation (so you tell us).  You also
>>>>> tell us that H(H_Hat, H_Hat) returns false.  Thus H is not a halting
>>>>> decider.  Do say if you dispute any of these facts.
>>>>
>>>> When-so-ever...  <blah, blah, blah>
>>>
>>> That is probably the best I'll get.  I will continue to assume that you
>>> don't dispute these facts.
>>
>> Anyone can know with complete certainty entirely based on the meaning
>> of the words that every counter-example proving that a decider decides
>> its inputs incorrectly must itself be an input to this decider that
>> this decider decides incorrectly.
> 
> Anyone can know with complete certainty entirely based on the meaning of
> the words that the H_Hat counter-example that proves that H decides its
> inputs incorrectly is itself the input to the H that H decides
> incorrectly.
> 
> I think you could have been clearer, but I could not risk paraphrasing
> such a messy sentence.
> 

Two key points:
(1) This is NOT a valid counter-example proving that a decider decides 
its inputs incorrectly:

int main()
   H_Halt_(H_Hat)

Because every counter-example proving that a decider decides its inputs 
incorrectly must itself be an input to this decider that this decider 
decides incorrectly.

Try and provide and actual counter-example if you can. I believe that 
you already know that you can't.

(2) If a person decides that a car will start when they turn on the 
ignition and the car does start when they turn on the ignition then this 
is a correct car starting decision.

If a UTM halt decider decides that its input would never halt unless it 
stops simulating it and its input never halts when the simulator 
continues to simulate it then the halt decider decision is proved to be 
correct.












-- 
Copyright 2020 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#25274

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2020-11-14 14:54 +0000
Message-ID<878sb4m1j3.fsf@bsb.me.uk>
In reply to#25266
olcott <NoOne@NoWhere.com> writes:

> On 11/13/2020 7:56 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
<cut>
>>> Anyone can know with complete certainty entirely based on the meaning
>>> of the words that every counter-example proving that a decider decides
>>> its inputs incorrectly must itself be an input to this decider that
>>> this decider decides incorrectly.
>>
>> Anyone can know with complete certainty entirely based on the meaning of
>> the words that the H_Hat counter-example that proves that H decides its
>> inputs incorrectly is itself the input to the H that H decides
>> incorrectly.
>>
>> I think you could have been clearer, but I could not risk paraphrasing
>> such a messy sentence.
>
> Two key points: (1) This is NOT a valid counter-example proving that a
> decider decides its inputs incorrectly:
>
> int main()
>   H_Halt_(H_Hat)

It is a counter-example to the claim (if you are making it) that H (the
one called from H_Hat) decides that cases correctly.  Why?  Because
H(H_Hat, H_Hat) is false but H_Halt_(H_Hat) is a finite computation.
You can pretend that these facts don't matter as often as you like, but
they are all that matters.  H must be correct about the H_Hat
constructed from H, and it can't be.  Your H is no exception.

> Because every counter-example proving that a decider decides its
> inputs incorrectly must itself be an input to this decider that this
> decider decides incorrectly.

That is the case here.  The supposed decider, H, is indeed given the
counter-example as input: H(H_Hat, H_Hat).

This is so obviously the case that your convoluted words must be anther
attempt to hide the trickery.

> Try and provide and actual counter-example if you can. I believe that
> you already know that you can't.

You provided the counter-example.  H(H_Hat, H_Hat) is wrong because
H_Hat(H_Hat) is a finite computation.  You don't deny these facts, you
are just trying to come up with some convoluted way to say that these
facts don't matter when in fact they are all the matters.

> (2) If a person decides that a car will start when they turn on the
> ignition and the car does start when they turn on the ignition then
> this is a correct car starting decision.

Yes.

> If a UTM halt decider decides that its input would never halt unless
> it stops simulating it and its input never halts when the simulator
> continues to simulate it then the halt decider decision is proved to
> be correct.

No.  What matters is not what would happen if H were not as written.
What matters is that any H you actually write can be presented with a
counter-example.  You know this.  This is why you are engaging in all
these flights of linguistic gymnastics.

The halting problem is about the actual code as written.  You write any
H, and I will write the problem input for it.  That has already been
done (by you as it happens) for your H.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#25247

FromJeff Barnett <jbb@notatt.com>
Date2020-11-13 11:34 -0700
Message-ID<romjjg$ctl$1@dont-email.me>
In reply to#25219
On 11/13/2020 8:14 AM, olcott wrote:
> 

You have set a new record in speed of muddled thinking, starting flawed 
threads (say flawed threads quickly 10 times), and unrestrained Usenet 
masturbation. Let's review your shotgun approach to initiating flawed 
threads of two sorts. Let R = "Refuting the halting problem proofs by 
..." and V = "Validating that a partial decider ..." with the following 
first message times for each version of each thread:

R1  11/09  8:00 AM
R2  11/09  4:34 PM
R3  11/10  8:52 PM
R4  11/10  5:15 PM
R5  11/11  7:45 AM
V1  11/12  7:43 AM
V2  11/12  7:49 AM
V3  11/12  9:27 AM
R6  11/13  7:28 AM
R7  11/13  8:41 AM

We can learn many thinks looking at the above table of flawed-thread 
start times: 1) Usenet time stamps are slightly screwy - note the order 
between R5 and V1 are as they appear in my reader, 2) PO likes to start 
flawed threads when the sun is rising, 3) with the exception of R3, all 
threads are started during "normal" business hours, 4) multiple threads 
can be started within minutes of each other, here there are ten threads 
initiated in a four day span!

Now each of these flawed threads is supposed to introduced the unwashed 
public and duped unwashed scientists - that's us folks - to new truths 
and philosophy of mathematics, logic, and horse sense. (We all know what 
part of any horse exists in these threads and who it is.) Now consider 
PO spewing such revelations minutes a part without even a pause. Is he a 
genius or is this a trick?

Well a quick glance shows no PO-original thought in any of these threads 
and if one examines the content in these flawed threads, one determines 
that PO only has time to copy and paste to turn flawed material into 
flawed threads. And since his brain has been shut down and copy and 
paste only takes one hand, we ask where his attention is and what he's 
doing with the other hand.

He's a happy productive troll who seems to be keeping regular business 
hours, though I haven't checked the time stamps on his flawed messages 
within these flawed threads.
-- 
Jeff Barnett

[toc] | [prev] | [next] | [standalone]


#25251

FromMike Terry <news.dead.person.stones@darjeeling.plus.com>
Date2020-11-13 20:45 +0000
Message-ID<3OqdnaJlnLvIbTPCnZ2dnUU78d_NnZ2d@brightview.co.uk>
In reply to#25247
On 13/11/2020 18:34, Jeff Barnett wrote:
> On 11/13/2020 8:14 AM, olcott wrote:
>>
>
> You have set a new record in speed of muddled thinking, starting flawed
> threads (say flawed threads quickly 10 times), and unrestrained Usenet
> masturbation. Let's review your shotgun approach to initiating flawed
> threads of two sorts. Let R = "Refuting the halting problem proofs by
> ..." and V = "Validating that a partial decider ..." with the following
> first message times for each version of each thread:
>
> R1  11/09  8:00 AM
> R2  11/09  4:34 PM
> R3  11/10  8:52 PM
> R4  11/10  5:15 PM
> R5  11/11  7:45 AM
> V1  11/12  7:43 AM
> V2  11/12  7:49 AM
> V3  11/12  9:27 AM
> R6  11/13  7:28 AM
> R7  11/13  8:41 AM
>
> We can learn many thinks looking at the above table of flawed-thread
> start times: 1) Usenet time stamps are slightly screwy - note the order
> between R5 and V1 are as they appear in my reader,

.. I'm not sure what you're getting at here.  Maybe you've just missed 
that R5 and V1 are on separate days?

(Also, giving us times as shown in your viewer does not help us - UTC 
times would work, or giving the MsgIds for the posts would enable them 
to be uniquely identified.  Also, how could the order your reader 
displays them reflect on screwy "Usenet times"?  If they're shown in the 
wrong order that would be down to your reader, right?)

2) PO likes to start
> flawed threads when the sun is rising, 3) with the exception of R3, all
> threads are started during "normal" business hours, 4) multiple threads
> can be started within minutes of each other, here there are ten threads
> initiated in a four day span!
>
> Now each of these flawed threads is supposed to introduced the unwashed
> public and duped unwashed scientists - that's us folks - to new truths
> and philosophy of mathematics, logic, and horse sense. (We all know what
> part of any horse exists in these threads and who it is.) Now consider
> PO spewing such revelations minutes a part without even a pause. Is he a
> genius or is this a trick?
>
> Well a quick glance shows no PO-original thought in any of these threads
> and if one examines the content in these flawed threads, one determines
> that PO only has time to copy and paste to turn flawed material into
> flawed threads. And since his brain has been shut down and copy and
> paste only takes one hand, we ask where his attention is and what he's
> doing with the other hand.
>

He has not posted anything new for quite some time.  Now he is 
effectively just SPAMMING the newsgroups.

He thinks that he can improve his chances of success (with journal peer 
reviewers) if he polishes up his presentation a little.  Hence the 
recent changes in terminology, slight rewordings and so on.  He wants to 
see our response so he can hone his wording to multiple effectiveness!  :)

This reveals one of his Major Delusions - he believes that people do not 
accept his claims due to the way he expresses them: he's not using "the 
right words", "the state of the art terminology" etc..  People dismiss 
him outright just because his way of saying them /sounds/ like "duffer 
utterings", rather than the "unconventional genius" utterings he 
believes them to be!  If only he could express his ideas with longer 
words and more complicated notations!

Of course, the truth is that people reject his claims because they are 
worthless utterings, based on his uneducated child-intuitions, and 
because PO's arguments for them are incoherent or plain wrong.  (His 
delusions somehow hide this state of affairs from him.)  It will make no 
difference whatsoever how he rewords his claims, they're all heading 
straight for the reviewer's waste paper bin!!

Mike.

[toc] | [prev] | [next] | [standalone]


#25252

FromJeff Barnett <jbb@notatt.com>
Date2020-11-13 14:18 -0700
Message-ID<romt7j$im5$1@dont-email.me>
In reply to#25251
On 11/13/2020 1:45 PM, Mike Terry wrote:
> On 13/11/2020 18:34, Jeff Barnett wrote:
>> On 11/13/2020 8:14 AM, olcott wrote:
>>>
>>
>> You have set a new record in speed of muddled thinking, starting flawed
>> threads (say flawed threads quickly 10 times), and unrestrained Usenet
>> masturbation. Let's review your shotgun approach to initiating flawed
>> threads of two sorts. Let R = "Refuting the halting problem proofs by
>> ..." and V = "Validating that a partial decider ..." with the following
>> first message times for each version of each thread:
>>
>> R1  11/09  8:00 AM
>> R2  11/09  4:34 PM
>> R3  11/10  8:52 PM
>> R4  11/10  5:15 PM
>> R5  11/11  7:45 AM
>> V1  11/12  7:43 AM
>> V2  11/12  7:49 AM
>> V3  11/12  9:27 AM
>> R6  11/13  7:28 AM
>> R7  11/13  8:41 AM
>>
>> We can learn many thinks looking at the above table of flawed-thread
>> start times: 1) Usenet time stamps are slightly screwy - note the order
>> between R5 and V1 are as they appear in my reader,
> 
> .. I'm not sure what you're getting at here.  Maybe you've just missed 
> that R5 and V1 are on separate days?

Oops! Part of my confusion was my model that PO was working mindlessly 
and so fast, without thought, that he crossed the speed of light barrier 
and time was moving backwards. The thrill at this discovery so blinded 
me to the truth, that I became careless. I'll try to be more careful in 
the future.

> (Also, giving us times as shown in your viewer does not help us - UTC 
> times would work, or giving the MsgIds for the posts would enable them 
> to be uniquely identified.  Also, how could the order your reader 
> displays them reflect on screwy "Usenet times"?  If they're shown in the 
> wrong order that would be down to your reader, right?)

Depends on whether your viewer orders on sent time, receive time, or 
earliest timestamp in thread. I just reported what I saw. I also believe 
that PO lives in the USA based on the crappy patent he received. As I'm 
sure you are aware receive time is only loosely correlated with send 
time and the correlation is not necessarily monotone. In case you want 
to figure this all out, I'm using TB and my time zone is mountain.

> 2) PO likes to start
>> flawed threads when the sun is rising, 3) with the exception of R3, all
>> threads are started during "normal" business hours, 4) multiple threads
>> can be started within minutes of each other, here there are ten threads
>> initiated in a four day span!
>>
>> Now each of these flawed threads is supposed to introduced the unwashed
>> public and duped unwashed scientists - that's us folks - to new truths
>> and philosophy of mathematics, logic, and horse sense. (We all know what
>> part of any horse exists in these threads and who it is.) Now consider
>> PO spewing such revelations minutes a part without even a pause. Is he a
>> genius or is this a trick?
>>
>> Well a quick glance shows no PO-original thought in any of these threads
>> and if one examines the content in these flawed threads, one determines
>> that PO only has time to copy and paste to turn flawed material into
>> flawed threads. And since his brain has been shut down and copy and
>> paste only takes one hand, we ask where his attention is and what he's
>> doing with the other hand.
>>
> 
> He has not posted anything new for quite some time.  Now he is 
> effectively just SPAMMING the newsgroups.
> 
> He thinks that he can improve his chances of success (with journal peer 
> reviewers) if he polishes up his presentation a little.  Hence the 
> recent changes in terminology, slight rewordings and so on.  He wants to 
> see our response so he can hone his wording to multiple effectiveness!  :)
> 
> This reveals one of his Major Delusions - he believes that people do not 
> accept his claims due to the way he expresses them: he's not using "the 
> right words", "the state of the art terminology" etc..  People dismiss 
> him outright just because his way of saying them /sounds/ like "duffer 
> utterings", rather than the "unconventional genius" utterings he 
> believes them to be!  If only he could express his ideas with longer 
> words and more complicated notations!
> 
> Of course, the truth is that people reject his claims because they are 
> worthless utterings, based on his uneducated child-intuitions, and 
> because PO's arguments for them are incoherent or plain wrong.  (His 
> delusions somehow hide this state of affairs from him.)  It will make no 
> difference whatsoever how he rewords his claims, they're all heading 
> straight for the reviewer's waste paper bin!!

I still hold troll as a real possibility. I hate to consider the amount 
of psychological damage involved if these decades-long behaviors are the 
result of anything other than trolling induced by lonesomeness.
-- 
Jeff Barnett

[toc] | [prev] | [standalone]


Page 2 of 2 — ← Prev page 1 [2]

Back to top | Article view | comp.theory


csiph-web