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


Groups > comp.theory > #33743

Re: Infinitely Recursive input on HP Proofs

From Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups comp.theory
Subject Re: Infinitely Recursive input on HP Proofs
Date 2021-05-17 02:19 +0100
Organization A noiseless patient Spider
Message-ID <87bl9a40nr.fsf@bsb.me.uk> (permalink)
References <918df253-d4f0-4370-8f73-88e6690380a1@googlegroups.com> <a4ydnWkMIKhS8Dz9nZ2dnUU7-L3NnZ2d@giganews.com> <87im3i5t12.fsf@bsb.me.uk> <0sCdnWsgz4JPGjz9nZ2dnUU7-RvNnZ2d@giganews.com>

Show all headers | View raw


olcott <NoOne@NoWhere.com> writes:

> On 5/16/2021 3:21 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> Any genius knowing the theory of computation quite well can easily
>>> confirm that Ĥ(Ĥ) specifies the non halting behavior pattern of
>>> [infinitely_nested_simulation] to every simulating halt decider.
>>> This equally applies to all of the halting problem instances.
>>>
>>> Ĥ(Ĥ) is short-hand for:
>>> Now Ĥ is a Turing machine, so that it will have some description in Σ*,
>>> say ŵ. This string, in addition to being the description of Ĥ can also be used
>>> as input string. We can therefore legitimately ask what would happen if Ĥ is
>>> applied to ŵ. (Linz:1990:320)
>>>
>>> Linz, Peter 1990. An Introduction to Formal Languages and
>>> Automata. Lexington/Toronto: D. C. Heath and Company. (315-320)
>>
>> Nonsense.  H is the name given in Linz to a non-existent Turing
>> machine.  H^, derived from it, also does not exit.  Anyone who has read
>> that book should know that H^([H^]) specifies no behaviour at all.
>>
>> You have constructed a poor-man's partial decider that gets the "hat"
>> case wrong, but you can't justify the wrong answer by appeal Linz.
>>
>> Your "infinitely nested simulation" explanation for your decider giving
>> the wrong answer can be put on a more formal basis, but you can't do by
>> re-using the names of nonexistent TM's from Linz.
>>
>
> Well I won't say that you are not a genius or that you don't know the
> theory of computation very well.
>
> The actual Ĥ(<Ĥ>) does specify [infinitely_nested_simulation] to every
> simulating halt decider. This [infinitely_nested_simulation] is more
> complex than the one that Halts recognizes.

No.  H and H^ specify no behaviour.  These lines:

> Ĥ.q0  wM  ⊢*  Ĥ.qx  wM  wM  ⊢*  Ĥ.qy  ∞
> Ĥ.q0  wM  ⊢*  Ĥ.qx  wM  wM  ⊢*  Ĥ.qn

(with the text below) specify the behaviour of no Turing machine.

> The above is adapted from (Linz:1990:319).
> It shows that Turing machine Ĥ copies its input at (q0) and begins
> executing an embedded copy of the original halt decider with this
> input at (qx).
>
> The (qy) state indicates that the halt decider decides that its input
> would halt. The ((qn)) state indicates the input would not halt. The
> appended (qa) and (qb) states cause Ĥ to infinitely loop if the halt
> decider decides that its input would halt.

The above is Linz (except for the altered specification).  But this is
all yours:

> It can be understood from the above specification that when the embedded halt decider @Ĥ.qx bases its halting decision on simulating its input, and it has (Ĥ,  Ĥ) as its input that:
> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with this copy then
> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with this copy then
> Ĥ.q0 would copy its input and then Ĥ.qx would simulate its input with this copy...
> unless and until the halt decider @Ĥ.qx stops simulating its input.
>
> Linz, Peter 1990. An Introduction to Formal Languages and
> Automata. Lexington/Toronto: D. C. Heath and Company.

You should not attribute your junk to Linz.  Linz of course does not
limit how a decider might be written because he wants to make general
claims, not specific ones.

And you want to pretend that the finite nested simulations you show can
be called infinitely nested simulation and no one will notice!  Sorry, I
noticed the last time, and I'm pointing it out again.

> So it seems to be the same as it was more than four years ago you are
> so biased against either me or my position (or both) that you simply
> won't pay enough attention to see that I am right.
>
> The key evidence that I am right and you just don't see it is the lack
> of any correct rebuttal.

Talk junk and I'll correct it -- stop talking junk and I won't have
anything to correct.  Stop saying that a nonexistent TM specifies any
behaviour at all.  Stop saying that Linz's H shows nested simulation
when it's your badly conceived decider uses simulation.  Stop saying
that explicitly finite nested simulation is infinite nested simulation.
Stop saying that whether a computation is finite is more nuanced than it
simply stops running.  Stop saying that the fact that a computation
halts does not entail that it is a halting computation.  Stop pretending
that your silly-not-halting problem is the halting problem.  We are up
to our necks in garbage now.

> That the actual Ĥ(<Ĥ>) does specify [infinitely_nested_simulation] to
> every simulating halt decider can't be refuted simply because <it is>
> the case.

The nonexistent H^ based on the nonexistent H that does not necessarily
simulate anything but which you show performing explicitly finite nested
simulation?  That's the "actual" H^(H^) you claim specifies infinite
nested simulation?

You have lost touch with reality.

-- 
Ben.

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


Thread

Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-16 14:09 -0500
  Re: Infinitely Recursive input on HP Proofs Jeff Barnett <jbb@notatt.com> - 2021-05-16 13:46 -0600
  Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 19:05 -0400
    Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-16 18:21 -0500
      Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 21:11 -0400
        Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-16 21:01 -0500
          Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 23:18 -0400
            Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-16 22:23 -0500
              Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-17 07:11 -0400
              Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-17 07:26 -0400
                Re: Infinitely Recursive input on HP Proofs Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-05-17 05:45 -0700
                Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-17 10:23 -0500
                Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-17 20:41 -0400
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-17 20:27 +0100
                Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-17 14:31 -0500
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 01:38 +0100
                Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-17 19:54 -0500
                Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-17 21:21 -0400
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-20 12:57 +0100
                Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-17 20:43 -0400
      Re: Infinitely Recursive input on HP Proofs André G. Isaak <agisaak@gm.invalid> - 2021-05-16 19:15 -0600
        Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-16 20:34 -0500
          Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 21:55 -0400
  Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 15:56 -0400
  Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-16 21:21 +0100
    Re: Infinitely Recursive input on HP Proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 17:19 -0400
      Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-16 16:37 -0500
    Re: Infinitely Recursive input on HP Proofs olcott <NoOne@NoWhere.com> - 2021-05-16 16:00 -0500
      Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-17 02:19 +0100
        Re: Infinitely Recursive input on HP Proofs (Full Linz text) olcott <NoOne@NoWhere.com> - 2021-05-16 20:54 -0500
          Re: Infinitely Recursive input on HP Proofs (Full Linz text) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 01:57 +0100
            Re: Infinitely Recursive input on HP Proofs (eternally on this point) olcott <NoOne@NoWhere.com> - 2021-05-17 20:34 -0500

csiph-web