Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| Subject | Re: Infinitely Recursive input on HP Proofs |
|---|---|
| Newsgroups | comp.theory |
| References | (6 earlier) <_yhoI.542847$nn2.449398@fx48.iad> <EsCdnduL051HNTz9nZ2dnUU7-d_NnZ2d@giganews.com> <HojoI.604824$%W6.542760@fx44.iad> <daudnYwj2vzXUzz9nZ2dnUU7-XPNnZ2d@giganews.com> <ngloI.149087$gq3.16218@fx04.iad> |
| From | olcott <NoOne@NoWhere.com> |
| Date | 2021-05-16 22:23 -0500 |
| Message-ID | <lO2dncjmT5ftfDz9nZ2dnUU7-IWdnZ2d@giganews.com> (permalink) |
On 5/16/2021 10:18 PM, Richard Damon wrote: > On 5/16/21 10:01 PM, olcott wrote: >> On 5/16/2021 8:11 PM, Richard Damon wrote: >>> On 5/16/21 7:21 PM, olcott wrote: >>>> On 5/16/2021 6:05 PM, Richard Damon wrote: >>> >>>>> >>>>> But you can't use a 'Falsism' to change the facts about the definition. >>>>> >>>>> And, as I have said, there IS no pathological self-reference in the >>>>> problem. >>>>> >>>>> YOU create the self-reference by not implementing the required copy >>>>> operation. In actuality the Linz proof has no real self-reference, just >>>>> two copies of what just happens to be the same thing. >>>>> >>>> >>>> I am referring to the complete Peter Linz version where a copy <is> >>>> made. >>>> >>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ >>>> Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn >>>> >>>> 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. >>>> >>>> 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. >>>> >>>> >>>> >>> Key point to notice is that Linz's description doesn't have ANY >>> self-reference, or even things done via a 'reference' >>> >>> EVERYTHING is done with a copy, and there is no references to be self. >> >> The computation Ĥ(<Ĥ>) has no self-reference in the exactly same way >> that all entirely black cats are only rainbow colored and not black at all. > > Please show where in a proper encoding of H^(H^) you ever have something > generate an actual reference to something. PLEASE. > http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf > H^ has a COPY OF (not a reference to) H within it. > > It is given a DESCRIPTION OF (not a reference to) H^ > > No reference in sight! > I have provided the full reference at least 50 times now. > YOU fail to copy Halts, and make H_Hat use a reference to it, but that > is actually in violation to the structure described in Linz. > > Turing Machines do not DO 'references'. > I changed the subject from the x86utm H_Hat C/x86 computation to the actual Linz: Ĥ(Ĥ) a few messages ago and you didn't notice. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll 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