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


Groups > comp.theory > #33694

Re: Refuting the halting problem proofs

Subject Re: Refuting the halting problem proofs
Newsgroups comp.theory
References <17udnVv_WIjVuz39nZ2dnUU7-e3NnZ2d@giganews.com> <87pmxroh9a.fsf@bsb.me.uk> <kvednXSpm864GT39nZ2dnUU7-X-dnZ2d@giganews.com> <PN7oI.60215$7u1.59179@fx12.iad> <nu2dnTxIrra_ujz9nZ2dnUU7-W_NnZ2d@giganews.com>
From Richard Damon <Richard@Damon-Family.org>
Message-ID <xkcoI.76326$RC2.25943@fx27.iad> (permalink)
Organization Forte - www.forteinc.com
Date 2021-05-16 13:08 -0400

Show all headers | View raw


On 5/16/21 10:08 AM, olcott wrote:
> On 5/16/2021 6:58 AM, Richard Damon wrote:
>> On 5/15/21 10:33 PM, olcott wrote:
>>> On 5/15/2021 3:48 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> To overcome the pathological self-reference error of the conventional
>>>>> halting problem proofs we simply define halt decider H such that every
>>>>> input P to halt decider H that itself calls H has the same halting
>>>>> value as the halting value as input P2 adapted from input P where all
>>>>> calls to H have been replaced with calls to Simulate.
>>>>
>>>> What are you going to call this new decision problem?  You've come up
>>>> with classification for encoded TN/input pair that may well be
>>>> decidable.  No one will know until you define it (so we won't ever
>>>> know!), but at least let's have a name for it so we don't confuse it
>>>> with the simple notion of dividing encoded TM/input pairs into those
>>>> that halt and those that don't.
>>>>
>>>
>>> It it the halting problem where there are two choices
>>> (a) Halting
>>> (b) never_halts_unless_aborted == non_halting
>>>
>>> Such that the pathological self-reference halting problem instances
>>> become decidable on the basis of matching the the
>>> [infinitely_nested_simulation] not halting behavior pattern.
>>>
>>
>> And what good is that?
>>
>> Since the original halting problem still exists and is shown to be
>> non-decidable, the proofs that use it still stand.
>>
> 
> Based on my earlier work:
> peteolcott   comp.theory   Mar 11, 2017, 3:13:03 PM
> Infinitely Recursive input on HP Proofs
> https://groups.google.com/g/comp.theory/c/NcFS02hKs1U/m/PlBF-1LRBAAJ
> Copyright 2016 and 2017 Pete Olcott.
> 
> 
> 
> Ĥ.q0  wM  ⊢*  Ĥ.qx  wM  wM  ⊢*  Ĥ.qy  ∞
> Ĥ.q0  wM  ⊢*  Ĥ.qx  wM  wM  ⊢*  Ĥ.qn
> 
> H.qx  wM  wM  ⊢*  H.qy
> H.qx  wM  wM  ⊢*  H.qn
> 
> H applied to input (Ĥ, Ĥ) transitions to H.qn on the basis that
> the behavior of Ĥ matches the [infinitely_nested_simulation]
> not halting behavior pattern.
> 
> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
> 
> 
> 
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
> 
>


But, we still have the fact that when we have that your H will say that
H^(H^) will be non-halting, when we actually run the machine H^(H^) we
find that it halts.

Even you have admitted that,

This means H was wrong, and thus is NOT a counter example.

Only by 'redefining' what YOU mean by Halting, and asking H to answer a
different question can you possibly claim it to be right.

Since it IS a different definintion of the question, your proof has ZERO
bearing on the actual halting problem.


>> Does anyone really want the answer you give, one that is a function of
>> the decider as well as the machine being decided on?
>>
> 
> All of the halting problem instances are such a function.
> 
> 

Not any proper answers. That RIGHT answer to the question of whether
P(I) is a halting computation or not is NOT dependent on what halt
decider you are going to ask.

Yes, different deciders might give different answers if some are right
and some are wrong.

Also, we may have different H^s for different Halt deciders, but these
are supposed to be differet machines, and I think that the H^ built on
Halts was really supposed to be called Halts^, it being the machine
build by the 'hat' formula from Halts.

With YOUR 'definition', suddenly the 'right' answer depends on what halt
decider you are going to ask.

H^ is non-halting to H, but Halting to other deciders

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


Thread

Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 14:52 -0500
  Re: Refuting the halting problem proofs Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-15 20:47 +0000
  Re: Refuting the halting problem proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-15 21:48 +0100
    Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 21:33 -0500
      Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-16 09:08 -0500
        Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:08 -0400
      Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 07:58 -0400
      Re: Refuting the halting problem proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-16 17:42 +0100
        Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-16 12:26 -0500
          Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:46 -0400
          Re: Refuting the halting problem proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 01:58 +0100
  Re: Refuting the halting problem proofs Mr Flibble <flibble@reddwarf.jmc> - 2021-05-15 21:55 +0000
    Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 18:23 -0500
      Re: Refuting the halting problem proofs Mr Flibble <flibble@reddwarf.jmc> - 2021-05-15 23:28 +0000
        Re: Refuting the halting problem proofs (solving the halting problem) olcott <NoOne@NoWhere.com> - 2021-05-16 09:22 -0500
          Re: Refuting the halting problem proofs (solving the halting problem) Mr Flibble <flibble@reddwarf.jmc> - 2021-05-16 15:15 +0000
            Re: Refuting the halting problem proofs (solving the halting problem) olcott <NoOne@NoWhere.com> - 2021-05-16 10:19 -0500
              Re: Refuting the halting problem proofs (solving the halting problem) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:55 +0000
              Re: Refuting the halting problem proofs (solving the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:11 -0400
      Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-15 19:37 -0400
  Re: Refuting the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 05:57 +0200
    Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 23:29 -0500
      Re: Refuting the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 10:11 +0200
        Re: Refuting the halting problem proofs (in C) olcott <NoOne@NoWhere.com> - 2021-05-16 08:43 -0500
          Re: Refuting the halting problem proofs (in C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:16 +0000
            Re: Refuting the halting problem proofs (in C) olcott <NoOne@NoWhere.com> - 2021-05-16 10:25 -0500
              Re: Refuting the halting problem proofs (in C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:57 +0000
              Re: Refuting the halting problem proofs (in C) Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 18:28 +0200
            Re: Refuting the halting problem proofs (in C) olcott <NoOne@NoWhere.com> - 2021-05-16 10:53 -0500
              Re: Refuting the halting problem proofs (in C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:58 +0000
                Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 11:23 -0500
                Re: Refuting the halting problem proofs [ succinct refutation ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 17:26 +0000
                Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 13:33 -0500
                Re: Refuting the halting problem proofs [ succinct refutation ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 18:54 +0000
                Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 14:19 -0500
                Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 16:09 -0400
                Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 15:17 -0500
                Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 16:42 -0400
                Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 16:20 -0500
                Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 17:30 -0400
                Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 16:07 -0400
              Re: Refuting the halting problem proofs (in C) Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:17 -0400
          Re: Refuting the halting problem proofs (in C) Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 18:02 +0200

csiph-web