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


Groups > sci.logic > #172349

Re: Necessary sequence of halt decider's inference chain

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-10 17:06 +0000
Organization A noiseless patient Spider
Message-ID <87mv0gn593.fsf@bsb.me.uk> (permalink)
References (2 earlier) <0a8ef82a-f27d-4632-8f1c-45cd2b472392@googlegroups.com> <87fu69c058.fsf@bsb.me.uk> <2vWdnW0EN54oGuPHnZ2dnUU7-RPNnZ2d@giganews.com> <87sha9ngsu.fsf@bsb.me.uk> <htGdnTKFV8y4iOLHnZ2dnUU7-bHNnZ2d@giganews.com>

Cross-posted to 2 groups.

Show all headers | View raw


Pete Olcott <Pete@NoEmail.address> writes:

> On 2/10/2018 6:57 AM, Ben Bacarisse wrote:
>> Pete Olcott <Pete@NoEmail.address> writes:
>>
>>> On 2/9/2018 3:40 PM, Ben Bacarisse wrote:
>>>> peteolcott <peterolcott2@gmail.com> writes:
>>>> <snip>
>>>>> I provided this concrete example to correctly refute Ben's claim
>>>>> that there is no specific sequence of syntactic logical consequence
>>>>> required when evaluating a pair of David Hilbert finite strings in
>>>>> the language or Turing Machine descriptions.
>>>>
>>>> I could never make that claim because it's just a word salad to me.
>>>
>>> You have to actually look at the words of the original post BEFORE
>>> providing your rebuttal.
>>
>> Eh?  Quote where I said what you claim or shut up.
>>
>>>> A
>>>> more honest way to contest someone's claims is by quoting their words.
>>>
>>> This is the whole thing about the sequ3ence that H must follow to
>>> evaluate the halting behavior of H^.
>>
>> I am accusing you of misrepresenting what I said.  Most people
>> consider this morally wrong as well as a terrible way to conduct a
>> discussion.
>>
>>>> If you think I'm wrong, quote me and explain why.
>>> Here is why: http://www.liarparadox.org/H_evaluates_S.pdf
>>
>> Quote me.  Posting links to more junk does not excuse your dishonesty.
>>
>>>> Don't just make stuff
>>>> up.  (At the very least, if you quote what I said that makes you think I
>>>> made the above claim, I might stand a chance of finding out what that
>>>> apparently random assemblage of words means.  I've long since given up
>>>> asking you to define your terms.)
>>>>
>>>
>>> This is the whole thing about the necessary sequence that H must follow
>>> to evaluate the halting behavior of H^. You said that it should be
>>> free to do anything.
>>
>> .... provided it behaves as specified.  You ignore that, probably because
>> you don't know what the notation means, though you copy it out enough
>> times.
>>
>>> I proved by a concrete example that no halt decider is free at all. It
>>> is strictly bound by the syntactic logical consequence defined by the
>>> input strings within the formal language of Turing machine
>>> Descriptions.
>>
>> Nope.
>>
>>> The concrete example challenges you to come up with a counter-example
>>> such that H decides [S] "ENN" without following every state transition
>>> that [S] would make.
>>
>> There is no machine in the class denoted by H.  Learn what a counter
>> example is before asking for one.  Normally, I'd give you an analogy for
>> this absurd request, but you are not engaging with any technical remarks
>> anymore so I don't see the point.
>>
>
> It is always the case that every halt decider must trace the precise
> sequence of state transitions of its input TMD up to the point where
> this TMD halts or demonstrates non halting behavior.

Every halt decider must behave /as if/ it can trace the precise sequence
of state transitions of its input TMD up to the point where this TMD
halts or demonstrates non halting behaviour.  Any machine that actually
does this will not be a halt decider.

You used to talk about evaluating and tracing and even (once or twice)
about universal TMs so this distinction is important.  You need to be
clear that "tracing" is just a metaphor.

I have invented a clever encoding for TMs and inputs as binary sequences
(zeros and ones) with the useful property the if you treat the sequence
as a number and factor it, those numbers with an odd number of prime
factors always represent halting computations and those with an even
number of primes factor always represent non-halting computations.  My
halt decider therefore just does a little basic arithmetic.  Is it
"tracing the precise sequence of state transitions of its input TMD up
to the point where this TMD halts or demonstrates non halting
behaviour"?

> A halt decider performs a mathematical proof of syntactic logical
> consequence from its input strings to its final halt decision states.

Yes.  We call that deciding correctly.

> It cannot skip any steps along the way.

You have no idea what steps it takes to do the job, but yes, it must do
them all, obviously.

> 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 a finite number of steps, agreed?

> You have disagreed with this and now H [S] "ENN"proves that you have
> always been wrong about this. I am not talking about simulation of the
> TMD, I have disavowed this many times.
>
> An execution trace is like a step-by-step debug trace. It can break out of
> the "debugger" at any time. It does break out of the debugger as soon as it
> detects halting or non-halting behavior, but it cannot break out before this.
>
> Definition of Turing Machine H (state transition sequence)
> H.q0 Wm W ⊢* H.qy
> H.q0 Wm W ⊢* H.qn

No.  Stop using this notation until you have learned it.

> Definition of Turing Machine Ĥx (state transition sequence)
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qy // NO LOOP
> Ĥx.q0 Wm ⊢* Ĥx.qx Wm Wm ⊢* Ĥx.qn // NO LOOP HERE EITHER

No.  Stop using this notation until you have learned it.

> H [Ĥx] [Ĥx]
>
> After thousands of hours of very careful study I can now finally
> see that H would transition to its state H.qn indicating that [Ĥx]
> is an incorrect Turing Machine Description.

There is no machine in the class H.  As it happens, since you are
misuing the notation, there are actually lots of machine in the class
you are calling H but that's just because you don't know what the
notation means.  I don't know which I should respond to.

> It was the 3000 hours that I spent working on the Liar Paradox
> formulating a whole new branch of mathematics in the process that
> lead me to this key insight.

Yes, it's led you astray because they are very different.  I can't do
anything about that now.  I don't think I can even stop you wasting more
time.

> Since I have explained this to you it should only take paying very
> close attention to what I am saying to confirm that what I say is
> necessarily correct.

Paying close attention to what I have explained has not had that
effect on you.  Why do you think the reverse would be any better?

> At H.qx [Ĥx] [Ĥx2] H would be required to trace the state transitions
> of [Ĥx] until [Ĥx] reaches [Ĥx].qx

No machine in the class H has a state called qx.  At least not in any of
the material you have posted here.  qx was your name for a state in H^
and later H^x.

> which would require [Ĥx] to trace the state transitions
> of [Ĥx2] until [Ĥx2] reaches [Ĥx2].qx
>
> At this point H decides** that [Ĥx] is not a correct TMD thus transitions
> to its own state of H.qn.

H has no state qx.

> ** detects the pathological self-reference(olcott 2004) of its input.

Obviously wrong, though it might be a typo.  Then it would be wrong for
some other reason.

> Copyright 2004, 2015, 2016, 2017, 2018 Pete Olcott

BTW, do you have permission to use the diagrams from Linz's book?  Maybe
you don't need it.  I don't know US copyright law.

-- 
Ben.

Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


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