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


Groups > comp.theory > #25116

Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4)

From Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups comp.theory
Subject Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4)
Date 2020-11-11 01:40 +0000
Organization A noiseless patient Spider
Message-ID <877dqswu19.fsf@bsb.me.uk> (permalink)
References <p8-dnR1l3oGjsDbCnZ2dnUU7-SXNnZ2d@giganews.com>

Show all headers | View raw


olcott <NoOne@NoWhere.com> writes:

> 01 void H_Hat(u32 P)
> 02 {
> 03   if (H(P, P))
> 04     HERE: goto HERE;
> 05   else
> 06     HALT
> 07 }
>
> 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 }
>
> When-so-ever a halt decider correctly determines that its input would
> never halt unless forced to halt by this halt decider this halt
> decider has made a correct not-halting determination.

No.  The correct answer as to the halting of the computation
H_Hat(H_Hat) is based on whether H_Hat(H_Hat) is or is not a halting
computation.  There is no subjunctive here.  It is or it is not a finite
computation.  What it /would/ do, under some other circumstance, is
irrelevant.

> Unless H forces its input to halt: H(H_Hat, H_Hat) its first parameter
> specifies infinite recursion at its line 03.

You tell us here that H(H_Hat, H_Hat) is false.  But H_Hat(H_Hat) is a
halting computation if H(H_Hat, H_Hat) is false.  That's the wrong
answer.

You have now asserted that the answer to some other question is the
right one for the halting question many, many times.  The only thing
available for sane people to do is point out that, on the plain facts of
the matter, H(H_Hat, H_Hat) gives the wrong answer.  I don't think any
innocent readers will read your "when-so-ever" pompous guff as anything
more than an evasion.  You have nothing.  You had nothing two years ago.
You had nothing in 2004.

-- 
Ben.

Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-10 18:15 -0600
  Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-11-10 16:30 -0800
    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-10 18:56 -0600
  Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-11 01:40 +0000
    Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-10 20:04 -0600
      Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-11 15:32 +0000
        Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-11 09:37 -0600
          Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-11 20:14 +0000
        Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-11-11 08:00 -0800
          Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-11 10:04 -0600
          Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-11 17:21 +0000

csiph-web