Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Newsgroups | comp.theory |
| Subject | Re: Refuting the halting problem proofs by deciding the previously undecidable input (V7) |
| Date | 2020-11-14 01:48 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <87mtzkn1xr.fsf@bsb.me.uk> (permalink) |
| References | (4 earlier) <xsKdnfrzZrqzKzPCnZ2dnUU7-R3NnZ2d@giganews.com> <87a6vlnns8.fsf@bsb.me.uk> <oa6dncC29b13UDPCnZ2dnUU7-cnNnZ2d@giganews.com> <87v9e8nb1v.fsf@bsb.me.uk> <UKKdnZM2Yp8dkTLCnZ2dnUU7-X_NnZ2d@giganews.com> |
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.
> 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 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.
> 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.
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.
--
Ben.
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
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
csiph-web