Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Newsgroups | sci.logic, comp.theory |
| Subject | Re: Necessary sequence of halt decider's inference chain |
| Date | 2018-02-13 04:18 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <87po59h69h.fsf@bsb.me.uk> (permalink) |
| References | (6 earlier) <htGdnTKFV8y4iOLHnZ2dnUU7-bHNnZ2d@giganews.com> <87mv0gn593.fsf@bsb.me.uk> <JdCdna8MAbPHeeLHnZ2dnUU7-aXNnZ2d@giganews.com> <874lmnjyhc.fsf@bsb.me.uk> <eYydnSl6VsUH0x_HnZ2dnUU7-YHNnZ2d@giganews.com> |
Cross-posted to 2 groups.
Pete Olcott <Pete@NoEmail.address> writes:
> On 2/11/2018 10:13 AM, Ben Bacarisse wrote:
>> I had lots of comments but then got to the part where we agree. It
>> seemed silly to reply to all the details before that. The agreement
>> seems significant so I cut the rest to concentrate on this bit:
>>
>> Pete Olcott <Pete@NoEmail.address> writes:
>>> On 2/10/2018 11:06 AM, Ben Bacarisse wrote:
>>>> Pete Olcott <Pete@NoEmail.address> writes:
>> <snip>
>>>>> In the case of halt deciders
>>>>> evaluating finite strings defined within the language or Turing Machine
>>>>> Descriptions this chain of inference must necessarily involve every
>>>>> single state transition of the TMD until this TMD halts or demonstrates
>>>>> non-halting behavior.
>>>>
>>>> But it must do this is [in] a finite number of steps, agreed?
>>>
>>> Yes. So it looks like we are getting somewhere. We are arriving
>>> at mutual understanding.
>>
>> Yes! Whatever the decider does it much be able to make its
>> determination in a finite number of steps. That's key and it's what
>>
>> H.q0 [M] W ⊢* H.qy when M halts on input W
>> H.q0 [M] W ⊢* H.qn when M does not halt on input W
>>
>
> Not quite.
> H.qy if [M] W is a correct TMD that halts on its input
> else
> H.qn
No, that's not the halting problem. That's the PO-halting problem and it
may well have a decider (I'll let you know if tell me what a "correct" TDM
is). If you simply mean the [M] must encode a TM, well that's right
there in the notation. If that is not what you mean, the thread comes
to a screeching halt.
(There is a decider for strings of the form [M] for some TM M so it
makes no difference what version of the HP you consider. If you insist
on the "full" version you have to drop the rather convenient [M]
notation and say
H.q0 V W ⊢* H.qy iff V encodes a machine M that halts on input W
H.q0 V W ⊢* H.qn otherwise)
>> means.
>>
>> H^ (built from H' built from some H meeting this specification) just
>> copies it's input and then (from the state you helpful renamed H^.qx)
>> behaves like H'. H' behaves like H right up until the last extra states
>> that were added to H.
>>
>> So now I can no longer see what part of the proof is bothering you. We
>> have
>
> You have to actually pay very close attention to what I am actually saying
> and not leap ahead to what you think that I am saying.
>
> H' is dead off topic done.
> H^ is dead off topic done.
No, they are how the proof works. You can't tell me what part of the
proof is still giving you trouble if you think two key constructs are
off topic. They are the very core of the proof you claim to reject.
> H^x is H with only the H^ states H^ prepended to H and none of the H'
> states appended.
> I have said this at least 20 times so it is really not that hard to
> get this point.
H^x does not appear in the proof. I asked what part of the proof is
still bothering you. I wrote out the last steps since you have finally
accepted the step that seemed to be holding you up.
>> H^.q0 W |-* H^.qx W W |-* H^.qy oo if W encodes a TM that halts on W
>> H^.q0 W |-* H^.qx W W |-* H^.qn otherwise
>>
>> Set W=[H^] in these lines to get this:
>>
>> H^.q0 [H^] |-* H^.qx [H^] [H^] |-* H^.qy oo
>>
>> if [H^] encodes a TM that halts on [H^] and
>>
>> H^.q0 [H^] |-* H^.qx [H^] [H^] |-* H^.qn
>>
>> otherwise. From this it's clear that H^ [H^] is a computation that does
>> not halt if [H^] encodes a machine that halts on input [H^], or it is a
>> computation that does halt if [H^] doesn't encode a machine that halts
>> on input [H^]. No?
No doubt you read these words very carefully (as you expect me to do
with yours) so I wonder why you were not able to point out the flaw in
the logic. We have what could be called "trace equations" that I don't
think you dispute and they show the behaviour of H^ [H^] (were it to
exist) leads to a contradiction. I really can't see why you still
reject this clear and simple argument, and you are not helping by
refusing to say which step in the chain you dispute.
<snip>
>> For many posts you adamantly refused to accept that H^ always got to
>> state qy or state qn, yet you kept saying that it did using this
>> notation. What possible interpretation can there be other than you did
>> not know what you were writing?
>
> Now that I have fully elaborated all of the nuances it turns out
> that I was right all along. When H performs a debug trace on Ĥx
> it aborts this trace before Ĥx ever gets to Ĥx.qy or Ĥx.qn.
The proof makes no reference H^x. You need to say which step of the
proof is still bothering you. H^ /does/ always get to either qy or qn.
What some other machine might do is irrelevant.
> Ĥx [Ĥx] [Ĥx] specifies the pathological self-reference(Olcott 2004)
> and the halt evaluation is aborted with a transition to H.qn.
Whatever H^x does has no bearing on the key question. Which part of the
proof that you have so very nearly understood do you reject as invalid?
H^x may be how you go on to resolve what you see as a problem, but if
you want to claim that the proof is incorrect you must point out which
step you think does not follow form the previous ones.
>> However, it does not define a Turning machine and you need specify in
>> what cases each line applies.
>>
>> The rest of the post seems odd to me now that you agree that, to be a
>> halt decider, as assumed by the proof, H must make its determination in
>> a finite number of steps. The most helpful reply would be for you to
>> say what part of the proof now bothers you. Maybe you could just mark
>> the part above where you come unstuck?
>
> None of it bothers me, I simply found out where it went wrong, how and why
> it is incorrect.
Of course something about it bothers you -- you don't accept it. You
can just reject it by simply saying you'll simply never believe it, but
no one will take that seriously. You need to point out which step is
the one you don't accept.
> I posted the answer way back in March 11, 2017 @ 3:13 PM in comp.theory.
> All of the HP proofs inherently specify an infinitely recursive
> evaluation sequence because each TM\D must have its own TMD / input
> pair.
That is not a step in the proof. You can't refute a sound proof with
waffle. One of the steps must be wrong. If this notion of "infinitely
recursive evaluation" makes some step of the proof wrong, that's what
you need to point out. Otherwise, whatever it means, it has no bearing
on the argument.
>> <snip>
>>> I am very pleased with the progress that we have made. I think that we
>>> are finally coming to a very significant mutual understanding.
>>
>> Maybe. I am, however, now not sure what part of the proof is bothering
>> you. The most progress would my made were you to simply point out the
>> step in the reasoning you think is wrong.
>
> I have already done that many times in may ways. That is OK that
> you don't get it yet it took me decades and thousands of hours.
Ah, the old, I did it already ploy. So you won't say which step you
think is wrong by simply writing "THIS!!!" under the line you don't
accept? I wrote out the rest of the proof so you could do just that.
>> Take the argument and just
>> put a **THIS!** at the bit you don't accept. I fear that instead of
>> doing that you will write lots of words.
>
> THIS: That all HP proof inherently specify an infinitely recursive
> set of TMD / input pairs because every TMD in this sequence requires
> its own TMD / Input pair.
That's not a step in the proof. I wrote it out for you so you could
very simply say which step you reject.
> I will write it up more formally and publish it to www.researchgate.net.
> The one key piece that is missing is a really good abstract.
You are also missing a valid objection to a sound proof. And knowledge
of all the other proofs of this theorem.
>>> If I am
>>> eventually proved correct I will cite you as my most valuable reviewer
>>> of all Halting Problem related discussions.
>>
>> If you publish anything, I would very much appreciate it if you did not
>> use my name in any way. This includes blog posts and so on. I know I
>> can not stop you, but I hope you will honour this request.
>
> So if I am correct and have correctly refuted the Halting Problem proofs
> you want to remain anonymous?
> Its a little too late for that because of USENET.
I did not say that. I do not want or need to be anonymous here because
here I can defend myself. If you publish a paper I have no right of
reply. You could publish any old rubbish and my name would then be
associated with it. Will you accept my request?
If you answer no other question in the reply, please explicitly answer
this one.
--
Ben.
Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Re: Necessary sequence of halt decider's inference chain George Greene <greeneg@email.unc.edu> - 2018-02-09 11:34 -0800
Re: Necessary sequence of halt decider's inference chain peteolcott <peterolcott2@gmail.com> - 2018-02-09 13:15 -0800
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-09 21:40 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-09 23:48 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 12:57 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-10 09:52 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 17:06 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-11 00:36 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-11 16:13 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-12 20:34 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 04:18 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-13 10:03 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 17:13 +0000
Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-13 16:59 -0800
Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-12 21:36 -0800
csiph-web