Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #171063 > unrolled thread
| Started by | George Greene <greeneg@email.unc.edu> |
|---|---|
| First post | 2018-01-25 20:26 -0800 |
| Last post | 2018-02-03 17:00 -0800 |
| Articles | 20 on this page of 118 — 9 participants |
Back to article view | Back to sci.logic
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-25 20:26 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-25 21:49 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-26 04:10 -0800
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-26 11:37 -0600
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-26 15:12 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-26 05:34 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-26 20:33 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-27 05:05 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-27 06:57 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-27 13:53 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 20:24 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-27 13:03 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 21:58 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-29 19:02 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-29 20:11 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 08:49 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 09:43 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:07 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 17:41 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 18:40 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 19:17 -0800
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:20 -0600
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-30 21:21 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-29 21:21 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 08:58 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 03:16 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:14 -0600
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 22:37 -0800
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:53 -0600
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-31 19:38 -0800
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:42 -0600
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 18:08 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 21:57 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 16:21 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 01:44 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:11 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 01:54 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 21:15 -0600
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 19:36 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 21:13 +0000
Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 21:30 +0000
Re: Infinitely Recursive input on HP Proofs Andy Walker <anw@cuboid.co.uk> - 2018-02-03 18:17 +0000
Re: Infinitely Recursive input on HP Proofs Andy Walker <anw@cuboid.co.uk> - 2018-02-03 18:42 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 12:46 -0800
Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-03 20:53 -0600
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 19:51 -0800
Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-05 18:56 -0600
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 17:22 -0800
Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-05 20:45 -0600
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 21:45 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-06 15:34 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 08:02 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 01:51 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 10:23 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 01:52 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 17:19 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-06 17:59 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 19:02 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-07 20:57 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 22:39 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-06 23:14 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-08 03:45 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-06 22:28 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 03:31 +0000
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-06 17:54 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 02:13 +0000
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 03:49 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-06 22:48 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 16:27 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-07 23:22 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-08 21:05 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-08 18:44 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-09 11:08 +0000
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-11 08:44 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-11 08:47 -0800
Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-11 17:55 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-12 20:39 -0600
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-08 03:41 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-08 03:43 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 18:56 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-07 20:50 -0800
Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-06 20:13 -0600
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-05 17:45 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-04 17:01 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 16:44 -0800
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-05 17:42 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-05 18:09 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 21:50 -0800
Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:57 -0600
Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-01 11:02 -0800
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 19:10 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 01:51 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:24 -0600
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 17:34 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 02:04 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 21:31 -0600
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 19:43 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 21:38 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-02 17:54 -0600
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-02 16:08 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 00:51 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-03 00:38 -0600
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-02 23:05 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 13:37 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-03 14:27 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 23:49 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 16:03 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-04 00:44 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 17:11 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-04 01:27 +0000
Re: Infinitely Recursive input on HP Proofs Newberry <newberryxy@gmail.com> - 2018-02-03 18:01 -0800
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 20:44 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-04 02:32 -0800
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-03 16:47 -0800
Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 14:12 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 19:27 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 02:13 +0000
Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-03 17:00 -0800
Page 4 of 6 — ← Prev page 1 2 3 [4] 5 6 Next page →
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-02-06 23:14 -0800 |
| Message-ID | <75771241-6867-4973-ad1b-104c32953f20@googlegroups.com> |
| In reply to | #172069 |
On Wednesday, February 7, 2018 at 4:39:31 PM UTC+10, peteolcott wrote: > On Wednesday, February 7, 2018 at 12:28:25 AM UTC-6, graham...@gmail.com wrote: > > On Wednesday, February 7, 2018 at 2:31:22 PM UTC+10, Pete Olcott wrote: > > > On 2/6/2018 9:31 PM, Ben Bacarisse > > > wrote: > > > > > > > > > > > > peteolcott <peter...@gmail.com> writes: > > > > > > > > > > > > On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote: > > > > > > > > > peteolcott writes: > > > <snip> > > > > > > > > > H simply recognizes the Pathological-Self-Reference(Olcott 2004) > > > of [H^][H^] and transitions to its ((qn)) state indicating that > > > it rejects the input on the basis that it specifies an infinitely > > > recursive evaluation sequence. > > > > > > > > > There is a theorem that proves this is not possible. Inputs with what > > > you call PSR are not a decidable set. No TM can spot them all. > > > > > > > > > Try and provide a single counter-example that meets this spec: > > > > > > An expression of language (formal or otherwise) has the property > > > of Pathological Self-Reference(Olcott 2004) when-so-ever the > > > self-reference of this expression prevents this expression > > > from being evaluated as True or False. > > > > > > > > > That's a definition (albeit not a very good one). Do you even know what > > > a counter example is? How can there be a counter example to a > > > definition? > > > > > > > > > > > > You claim that it has been proven to be undecidable so it should not > > > be very hard for someone understanding this proof to come up with a > > > single valid counter-example that refutes my claim to be able to > > > always detect and report PSR. > > > > > > > > > Oh dear. Of course I can't. > > > > > > I wrote, and re-wrote, and then re-wrote again several answers to this > > > but in the end I lost heart and I've just deleted the text. You don't > > > know what a counter example is, or what a decidable set is, and I don't > > > think I have the ability (and certainly not the inclination) to teach > > > you what they are. > > > > > > I've told you why your objection to the classic halting theorem proof is > > > wrong. I don't think I can do more. > > > > > > I will however, retract my claim about PSR not being decidable. I fear > > > it is a movable feast and it seems likely to me (from the current rather > > > vague wording) that there are no examples of it relating to halting. > > > That would make TMD/input pairs with PSR trivially decidable. Then > > > again, maybe it means something else when applied to halting problems > > > and it really isn't decidable. I can't tell and I don't care. > > > > > > I will say only this: if Rice's theorem would apply to it then it is not > > > decidable. > > > > > > <snip> > > > > > > > > > Definition of Turing Machine Ĥx (Ĥ - loop) > > > > > > q0 Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qy > > > > > > q0 Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qn > > > > > > > > > > > > H [Ĥx][Ĥx] Specifies Pathological > > > self-reference > > > > > > > > > > > > Yes but its a REQUIREMENT of HALT to input every possible program. > > > > [Ĥx][Ĥx] is not a possible program is is extremely subtle gibberish > that is so subtle that no one noticed the gibberish aspect of it > for many decades. > > > > > There is an ABSTRACTION using the HYPOTHESIS in the COUNTER EXAMPLE but > > > > > > 1 ASSUME HALT EXISTS > > 2 H^ EXISTS FOLLOWS > > > > > > > > SO YOU AGREE HALT DOES NOT EXIST ? > > No I do not, The proof is incorrect. > > Notice that I am not talking about Ĥ anymore. I am talking about Ĥx. its a notation I'm not going to enter in to All your Quirgles begin by ASSUMING HALT() ! End Of Story! ASSUME ADD(A,B) ---1-2---->(qA)---3---->(qY) DOUBLE THE INPUT ---2---->(qD)----2-2----->(qA)-----4-----(qY) if qD exists ...... so does H^
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-02-08 03:45 -0800 |
| Message-ID | <ecde667b-832a-42f5-829b-bfcf4cba0229@googlegroups.com> |
| In reply to | #172069 |
On Wednesday, February 7, 2018 at 1:39:31 AM UTC-5, peteolcott wrote: > [Ĥx][Ĥx] is not a possible program NOBODY ALLEGES that [Ĥx][Ĥx] is a possible program! NOBODY EVER SAID that! So you canNOT win an argument rebutting a point that has not even been asserted! DAMN, you're stupid! In the cases of the machines with two parameters, the string [H^] -- JUST ONE copy of it, NOT TWO -- is alleged to be the string describing a program -- it describes H^. The second copy IS SOMETHING ELSE. The two together ARE NOT EVEN ALLEGED to define a "program"! You still haven't even figured out the DIFFERENCE BETWEEN a "program" and a TM!
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-02-06 22:28 -0800 |
| Message-ID | <5c18fe87-84a5-4927-994d-f7d8f0074687@googlegroups.com> |
| In reply to | #172036 |
On Wednesday, February 7, 2018 at 2:31:22 PM UTC+10, Pete Olcott wrote: > On 2/6/2018 9:31 PM, Ben Bacarisse > wrote: > > > > peteolcott <peter...@gmail.com> writes: > > > > On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote: > > > peteolcott writes: > <snip> > > > H simply recognizes the Pathological-Self-Reference(Olcott 2004) > of [H^][H^] and transitions to its ((qn)) state indicating that > it rejects the input on the basis that it specifies an infinitely > recursive evaluation sequence. > > > There is a theorem that proves this is not possible. Inputs with what > you call PSR are not a decidable set. No TM can spot them all. > > > Try and provide a single counter-example that meets this spec: > > An expression of language (formal or otherwise) has the property > of Pathological Self-Reference(Olcott 2004) when-so-ever the > self-reference of this expression prevents this expression > from being evaluated as True or False. > > > That's a definition (albeit not a very good one). Do you even know what > a counter example is? How can there be a counter example to a > definition? > > > > You claim that it has been proven to be undecidable so it should not > be very hard for someone understanding this proof to come up with a > single valid counter-example that refutes my claim to be able to > always detect and report PSR. > > > Oh dear. Of course I can't. > > I wrote, and re-wrote, and then re-wrote again several answers to this > but in the end I lost heart and I've just deleted the text. You don't > know what a counter example is, or what a decidable set is, and I don't > think I have the ability (and certainly not the inclination) to teach > you what they are. > > I've told you why your objection to the classic halting theorem proof is > wrong. I don't think I can do more. > > I will however, retract my claim about PSR not being decidable. I fear > it is a movable feast and it seems likely to me (from the current rather > vague wording) that there are no examples of it relating to halting. > That would make TMD/input pairs with PSR trivially decidable. Then > again, maybe it means something else when applied to halting problems > and it really isn't decidable. I can't tell and I don't care. > > I will say only this: if Rice's theorem would apply to it then it is not > decidable. > > <snip> > > > Definition of Turing Machine Ĥx (Ĥ - loop) > > q0 Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qy > > q0 Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qn > > > > H [Ĥx][Ĥx] Specifies Pathological > self-reference Yes but its a REQUIREMENT of HALT to input every possible program. There is an ABSTRACTION using the HYPOTHESIS in the COUNTER EXAMPLE but 1 ASSUME HALT EXISTS 2 H^ EXISTS FOLLOWS SO YOU AGREE HALT DOES NOT EXIST ?
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-02-07 03:31 +0000 |
| Message-ID | <87k1vpiifx.fsf@bsb.me.uk> |
| In reply to | #172036 |
peteolcott <peterolcott2@gmail.com> writes: > On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote: >> peteolcott writes: >> <snip> >> > H simply recognizes the Pathological-Self-Reference(Olcott 2004) >> > of [H^][H^] and transitions to its ((qn)) state indicating that >> > it rejects the input on the basis that it specifies an infinitely >> > recursive evaluation sequence. >> >> There is a theorem that proves this is not possible. Inputs with what >> you call PSR are not a decidable set. No TM can spot them all. > > Try and provide a single counter-example that meets this spec: > > An expression of language (formal or otherwise) has the property > of Pathological Self-Reference(Olcott 2004) when-so-ever the > self-reference of this expression prevents this expression > from being evaluated as True or False. That's a definition (albeit not a very good one). Do you even know what a counter example is? How can there be a counter example to a definition? > You claim that it has been proven to be undecidable so it should not > be very hard for someone understanding this proof to come up with a > single valid counter-example that refutes my claim to be able to > always detect and report PSR. Oh dear. Of course I can't. I wrote, and re-wrote, and then re-wrote again several answers to this but in the end I lost heart and I've just deleted the text. You don't know what a counter example is, or what a decidable set is, and I don't think I have the ability (and certainly not the inclination) to teach you what they are. I've told you why your objection to the classic halting theorem proof is wrong. I don't think I can do more. I will however, retract my claim about PSR not being decidable. I fear it is a movable feast and it seems likely to me (from the current rather vague wording) that there are no examples of it relating to halting. That would make TMD/input pairs with PSR trivially decidable. Then again, maybe it means something else when applied to halting problems and it really isn't decidable. I can't tell and I don't care. I will say only this: if Rice's theorem would apply to it then it is not decidable. <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-02-06 17:54 -0800 |
| Message-ID | <d4bf0820-fae9-47b3-b291-32dd251ef23d@googlegroups.com> |
| In reply to | #172009 |
On Tuesday, February 6, 2018 at 10:34:06 AM UTC-5, Ben Bacarisse wrote: > only an indirect proof is possible This is arguably Just Never the case, for Any proposition. There might be no "linear" proof -- you might have to split in into two cases -- but two direct proofs make a bigger direct proof, not an indirect one. Basically, since an indirect proof (of ~P) is of the form P->(Q/\~Q), the conditional here proved is logically equivalent to its contrapositive, which invites you to derive ~P *directly* from a *tautology* -- the contrapositive of the indirect conditional is (QV~Q)->~P. In other words, IF YOU CAN FIND THE *RIGHT* Q, you can prove, by 2 cases, both Q->~P *and* ~Q->~P. The combination of these is a direct proof, not an indirect one. Of course, the only practical way to find the right Q may be to seek the indirect proof first. That would then raise the question as to whether, once it's found, it can or cannot "always" be transformed into its "direct contrapositive" version. For an affirmative answer to that question, see https://people.mpi-inf.mpg.de/~jblanche/redirect.pdf
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-02-07 02:13 +0000 |
| Message-ID | <87po5him1l.fsf@bsb.me.uk> |
| In reply to | #172043 |
George Greene <greeneg@email.unc.edu> writes: > On Tuesday, February 6, 2018 at 10:34:06 AM UTC-5, Ben Bacarisse wrote: >> only an indirect proof is possible > > This is arguably Just Never the case, for Any proposition. It looks like I used a technical term by mistake. I meant that nothing can be proved about PO's undefined term. Until PO defines PSR, all that can be said is that whatever it is there is not decider for it. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-02-07 03:49 +0000 |
| Message-ID | <878tc5ihmn.fsf@bsb.me.uk> |
| In reply to | #172009 |
peteolcott <peterolcott2@gmail.com> writes: <snip> > Sure this is Rice's claim: > Rice's theorem states that all non-trivial, semantic properties of > programs are undecidable. > > Since it can be reduced to the HP then: > > It becomes a false claim when the key semantic property that prevents > all other semantic properties from being evaluated is itself correctly > evaluated. What? The validity of a theorem is not contingent on random words you post on Usenet. It's validity depends on the published proofs. They are correct. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-02-06 22:48 -0600 |
| Message-ID | <Y9-dnar38MuLGOfHnZ2dnUU7-dvNnZ2d@giganews.com> |
| In reply to | #172053 |
On 2/6/2018 9:49 PM, Ben Bacarisse wrote: > peteolcott <peterolcott2@gmail.com> writes: > <snip> >> Sure this is Rice's claim: >> Rice's theorem states that all non-trivial, semantic properties of >> programs are undecidable. >> >> Since it can be reduced to the HP then: >> >> It becomes a false claim when the key semantic property that prevents >> all other semantic properties from being evaluated is itself correctly >> evaluated. > > What? The validity of a theorem is not contingent on random words you > post on Usenet. It's validity depends on the published proofs. They > are correct. > The validity of any theorem is ultimately dependent upon all of the details of the underlying semantics. The reason that my approach seems so weird is that I go directly to this underlying semantics not bothering to carefully learn all of the conventional misconceptions along the way. I don't even bother to get the terminology correctly because much of this terminology has built in misconceptions and inherent arbitrary limitations. To formulate how analytical Truth really works I had to totally scrap all of the conventional terms of the art and rebuild them from scratch. http://liarparadox.org/index.php/2018/02/04/truex-and-unprovablex-is-impossible/ The foundation of math known as the Axiom is at best only half-baked. -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-02-07 16:27 +0000 |
| Message-ID | <87a7wkhiiw.fsf@bsb.me.uk> |
| In reply to | #172057 |
Pete Olcott <Pete@NoEmail.address> writes: > On 2/6/2018 9:49 PM, Ben Bacarisse wrote: >> peteolcott <peterolcott2@gmail.com> writes: >> <snip> >>> Sure this is Rice's claim: >>> Rice's theorem states that all non-trivial, semantic properties of >>> programs are undecidable. >>> >>> Since it can be reduced to the HP then: >>> >>> It becomes a false claim when the key semantic property that prevents >>> all other semantic properties from being evaluated is itself correctly >>> evaluated. >> >> What? The validity of a theorem is not contingent on random words you >> post on Usenet. It's validity depends on the published proofs. They >> are correct. > > The validity of any theorem is ultimately dependent upon all of the > details of the underlying semantics. No. > The reason that my approach > seems so weird is that I go directly to this underlying semantics > not bothering to carefully learn all of the conventional misconceptions > along the way. That not why it's weird, it's why its irrelevant. But if you want to write puff pieces about the meaning of these theorems go ahead. No one cares. (That is what you were doing a few years ago.) Recently, some people got confused and thought you were interested in understanding the proof of this theorem, but apparently not. <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-02-07 23:22 -0600 |
| Message-ID | <crCdndSyp_U_Q-bHnZ2dnUU7-dfNnZ2d@giganews.com> |
| In reply to | #172097 |
On 2/7/2018 10:27 AM, Ben Bacarisse wrote: > Pete Olcott <Pete@NoEmail.address> writes: > >> On 2/6/2018 9:49 PM, Ben Bacarisse wrote: >>> peteolcott <peterolcott2@gmail.com> writes: >>> <snip> >>>> Sure this is Rice's claim: >>>> Rice's theorem states that all non-trivial, semantic properties of >>>> programs are undecidable. >>>> >>>> Since it can be reduced to the HP then: >>>> >>>> It becomes a false claim when the key semantic property that prevents >>>> all other semantic properties from being evaluated is itself correctly >>>> evaluated. >>> >>> What? The validity of a theorem is not contingent on random words you >>> post on Usenet. It's validity depends on the published proofs. They >>> are correct. >> >> The validity of any theorem is ultimately dependent upon all of the >> details of the underlying semantics. > > No. > So for example if the semantic consequence of a famous theorem is contradictory, then you are saying that all is well because it is only the syntax that counts? >> The reason that my approach >> seems so weird is that I go directly to this underlying semantics >> not bothering to carefully learn all of the conventional misconceptions >> along the way. > > That not why it's weird, it's why its irrelevant. > > But if you want to write puff pieces about the meaning of these theorems > go ahead. No one cares. (That is what you were doing a few years ago.) > http://liarparadox.org/index.php/2018/02/08/the-nature-of-truth-in-plain-english/ By doing it this way I am reformulating the essential nature of truth such that my reformulation eliminates all of the extremely subtle semantic incoherence that was expressly defined to form the essential nature of the existing terms of the art. > Recently, some people got confused and thought you were interested in > understanding the proof of this theorem, but apparently not. > > <snip> > -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-02-08 21:05 +0000 |
| Message-ID | <878tc3dwfe.fsf@bsb.me.uk> |
| In reply to | #172135 |
Pete Olcott <Pete@NoEmail.address> writes: > On 2/7/2018 10:27 AM, Ben Bacarisse wrote: >> Pete Olcott <Pete@NoEmail.address> writes: >> >>> On 2/6/2018 9:49 PM, Ben Bacarisse wrote: >>>> peteolcott <peterolcott2@gmail.com> writes: >>>> <snip> >>>>> Sure this is Rice's claim: >>>>> Rice's theorem states that all non-trivial, semantic properties of >>>>> programs are undecidable. >>>>> >>>>> Since it can be reduced to the HP then: >>>>> >>>>> It becomes a false claim when the key semantic property that prevents >>>>> all other semantic properties from being evaluated is itself correctly >>>>> evaluated. >>>> >>>> What? The validity of a theorem is not contingent on random words you >>>> post on Usenet. It's validity depends on the published proofs. They >>>> are correct. >>> >>> The validity of any theorem is ultimately dependent upon all of the >>> details of the underlying semantics. >> >> No. > > So for example if the semantic consequence of a famous theorem > is contradictory, then you are saying that all is well because > it is only the syntax that counts? For the theorem to be a theorem, yes. That's not to say the semantics don't count for other reasons. For example, there are "machines" (models of computation, TM variations and so on) for which halting is decidable. These crop up in textbooks and are of theoretical interest but they don't "model" the sort of program we write. Turing machines (and all the other equivalent models) are so extensively studied because the semantics match the semantics of the program we actually write (except when a program runs out of storage, of course). All of this nonsense could end right here if you said that you now see that a proof is an essentially syntactic construct and that, therefore, you accept the proof. You can then "reformulate the essential nature of truth" so that these (syntactic) facts about TMs not longer trouble you. >>> The reason that my approach >>> seems so weird is that I go directly to this underlying semantics >>> not bothering to carefully learn all of the conventional misconceptions >>> along the way. >> >> That not why it's weird, it's why its irrelevant. >> >> But if you want to write puff pieces about the meaning of these theorems >> go ahead. No one cares. (That is what you were doing a few years ago.) > > http://liarparadox.org/index.php/2018/02/08/the-nature-of-truth-in-plain-english/ > > By doing it this way I am reformulating the essential nature of truth > such that my reformulation eliminates all of the extremely subtle > semantic incoherence that was expressly defined to form the essential > nature of the existing terms of the art. You reformulation of truth is of no interest to me, particularly if you keep it way from Usenet. I have always tried to limit my posts to correcting errors in the posts you make. That is the extent of my interest. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-02-08 18:44 -0600 |
| Message-ID | <I5adnfULwsiUcuHHnZ2dnUU7-b3NnZ2d@giganews.com> |
| In reply to | #172181 |
On 2/8/2018 3:05 PM, Ben Bacarisse wrote: > Pete Olcott <Pete@NoEmail.address> writes: > >> On 2/7/2018 10:27 AM, Ben Bacarisse wrote: >>> Pete Olcott <Pete@NoEmail.address> writes: >>> >>>> On 2/6/2018 9:49 PM, Ben Bacarisse wrote: >>>>> peteolcott <peterolcott2@gmail.com> writes: >>>>> <snip> >>>>>> Sure this is Rice's claim: >>>>>> Rice's theorem states that all non-trivial, semantic properties of >>>>>> programs are undecidable. >>>>>> >>>>>> Since it can be reduced to the HP then: >>>>>> >>>>>> It becomes a false claim when the key semantic property that prevents >>>>>> all other semantic properties from being evaluated is itself correctly >>>>>> evaluated. >>>>> >>>>> What? The validity of a theorem is not contingent on random words you >>>>> post on Usenet. It's validity depends on the published proofs. They >>>>> are correct. >>>> >>>> The validity of any theorem is ultimately dependent upon all of the >>>> details of the underlying semantics. >>> >>> No. >> >> So for example if the semantic consequence of a famous theorem >> is contradictory, then you are saying that all is well because >> it is only the syntax that counts? > > For the theorem to be a theorem, yes. > > That's not to say the semantics don't count for other reasons. For > example, there are "machines" (models of computation, TM variations and > so on) for which halting is decidable. These crop up in textbooks and > are of theoretical interest but they don't "model" the sort of program > we write. Turing machines (and all the other equivalent models) are so > extensively studied because the semantics match the semantics of the > program we actually write (except when a program runs out of storage, of > course). > > All of this nonsense could end right here if you said that you now see > that a proof is an essentially syntactic construct and that, therefore, > you accept the proof. You can then "reformulate the essential nature of > truth" so that these (syntactic) facts about TMs not longer trouble you. > Because a proof is a syntactic construct and very little semantics has ever been fully formalized syntactic formal proofs can have very large inference gaps. This causes syntactic proofs to form conclusions that contradict the results derived though semantic inference chains. I have recently shown that it is impossible for any language (formal or otherwise to have any statements of this language that cannot be proved or disproved within this language. ∀L ∈ Formal_Systems ∀Y ⊆ WFF(L) ∀X Statement(L,Y,X) → ( Provable(L, Y, X) ∨ Refutable(L, Y, X) ) I provide a sketch of the reasoning that supports the above formal statement below, very informally. I wrote it so that non technical people could verify my proof. >>>> The reason that my approach >>>> seems so weird is that I go directly to this underlying semantics >>>> not bothering to carefully learn all of the conventional misconceptions >>>> along the way. >>> >>> That not why it's weird, it's why its irrelevant. >>> >>> But if you want to write puff pieces about the meaning of these theorems >>> go ahead. No one cares. (That is what you were doing a few years ago.) >> >> http://liarparadox.org/index.php/2018/02/08/the-nature-of-truth-in-plain-english/ >> >> By doing it this way I am reformulating the essential nature of truth >> such that my reformulation eliminates all of the extremely subtle >> semantic incoherence that was expressly defined to form the essential >> nature of the existing terms of the art. > > You reformulation of truth is of no interest to me, particularly if you > keep it way from Usenet. I have always tried to limit my posts to > correcting errors in the posts you make. That is the extent of my > interest. > http://liarparadox.org/index.php/2018/02/08/the-nature-of-truth-in-plain-english/ The Nature of Analytic Truth in Plain English A Statement in English is only known to be True when it is established to be a Verified Fact. Analytical expressions of language are completely verified as True entirely based on the meaning of their words. A Base analytical fact is an expression of language defined to be True. To prove that an expression of language is an Analytical Fact we confirm that there is a correct line-of-reasoning from one or more Base Analytical Facts that make this expression necessarily True. Since every Statement of language must be True or False and this is verified by proving that the statement is a Analytical Fact or contradicts an Analytical Fact all Statements of language can always be proved or disproved. --------------------------------------------------- This is the ultimate foundation of all analytic Truth: Some expressions of language are defined to be True. ∀L ∈ Formal_Systems ∀X ∈ Base_Analytical_Fact(L) → True(X) As a David Hilbert Formalist approach Base Analytical Facts are members of a set of set of finite strings that have been defined to have the semantic property of True. An expression X of language L (formal or natural) is only verified to be a statement of L iff there exists a chain-of-inference from (one or more) base analytical fact(s) confirming that X is necessarily True or necessarily False in L. Copyright 2017, 2018 Pete Olcott -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-02-09 11:08 +0000 |
| Message-ID | <87372actdi.fsf@bsb.me.uk> |
| In reply to | #172193 |
Pete Olcott <Pete@NoEmail.address> writes: > On 2/8/2018 3:05 PM, Ben Bacarisse wrote: >> Pete Olcott <Pete@NoEmail.address> writes: >> >>> On 2/7/2018 10:27 AM, Ben Bacarisse wrote: >>>> Pete Olcott <Pete@NoEmail.address> writes: >>>> >>>>> On 2/6/2018 9:49 PM, Ben Bacarisse wrote: >>>>>> peteolcott <peterolcott2@gmail.com> writes: >>>>>> <snip> >>>>>>> Sure this is Rice's claim: >>>>>>> Rice's theorem states that all non-trivial, semantic properties of >>>>>>> programs are undecidable. >>>>>>> >>>>>>> Since it can be reduced to the HP then: >>>>>>> >>>>>>> It becomes a false claim when the key semantic property that prevents >>>>>>> all other semantic properties from being evaluated is itself correctly >>>>>>> evaluated. >>>>>> >>>>>> What? The validity of a theorem is not contingent on random words you >>>>>> post on Usenet. It's validity depends on the published proofs. They >>>>>> are correct. >>>>> >>>>> The validity of any theorem is ultimately dependent upon all of the >>>>> details of the underlying semantics. >>>> >>>> No. >>> >>> So for example if the semantic consequence of a famous theorem >>> is contradictory, then you are saying that all is well because >>> it is only the syntax that counts? >> >> For the theorem to be a theorem, yes. >> >> That's not to say the semantics don't count for other reasons. For >> example, there are "machines" (models of computation, TM variations and >> so on) for which halting is decidable. These crop up in textbooks and >> are of theoretical interest but they don't "model" the sort of program >> we write. Turing machines (and all the other equivalent models) are so >> extensively studied because the semantics match the semantics of the >> program we actually write (except when a program runs out of storage, of >> course). >> >> All of this nonsense could end right here if you said that you now see >> that a proof is an essentially syntactic construct and that, therefore, >> you accept the proof. You can then "reformulate the essential nature of >> truth" so that these (syntactic) facts about TMs not longer trouble you. > > Because a proof is a syntactic construct and very little semantics > has ever been fully formalized syntactic formal proofs can have very > large inference gaps. No. In particular there is no inference gap in the theorem you are struggling with here. Just accept the theorem for what it is (a valud inference chain) and then you can pontificate to your heart's content that it does not mean what it seems to mean because you've "reformulated truth". > This causes syntactic proofs to form conclusions that contradict the > results derived though semantic inference chains. You mean that some theorems seem contradict what you believe about God. Your starting point here is religious conviction but you prefer to call it a "semantic inference chain". > I have recently shown that it is impossible for any language (formal > or otherwise to have any statements of this language that cannot be > proved or disproved within this language. No you haven't. It's possible that you can show that it is POimpossible for any POlanguage (POformal or otherwise) to have any POstatements of this POlanguage that cannot be POproved or POdisproved within this POlanguage, but that would not do because no one would care. The only way you can get people to care it to incorrectly use the words everyone else uses. The rest of the post is waffle that you are much better at. Provided you don't try to address technical questions about well-established proofs, you can post as much waffle as you like. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-02-11 08:44 -0800 |
| Message-ID | <25055a77-f635-428d-9364-6e70a9d758ab@googlegroups.com> |
| In reply to | #172193 |
On Thursday, February 8, 2018 at 7:45:05 PM UTC-5, Pete Olcott wrote: > Because a proof is a syntactic construct Progress. THANK YOU. Finally. > and very little semantics has ever been fully formalized That is horse-shit -- there are tons and tons of books on that. Unfortunately for us, you have only read a tiny sliver of them, yet you somehow think this makes you an authority. > syntactic formal proofs can have very large inference gaps. They canNOT have inference gaps AT ALL, you moron! That is BECAUSE they are PURELY syntactic! THERE ARE NEVER ANY gaps! If the inference rule says that this conclusoin follows from these premises, THEN *IT*DOES*, automatically, WITHOUT ANY gaps, JUST BECAUSE the rule *SAID*SO*! ALL these rules ARE WHOLLY self-justifying IF they are semantically sound! AND EVEN WHEN THEY ARE NOT semantically sound, they STILL DON'T HAVE ANY "inference" GAPS! They just PRODUCE WHAT THEY PRODUCE! If you don't like it, THEY DON'T *CARE*!
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-02-11 08:47 -0800 |
| Message-ID | <2939fd34-c8fe-4702-a5d4-b6a104116dc0@googlegroups.com> |
| In reply to | #172193 |
On Thursday, February 8, 2018 at 7:45:05 PM UTC-5, Pete Olcott wrote: > The Nature of Analytic Truth in Plain English Other people have already written books on this subject. > > A Statement in English is only known to be True WHOA, hoss. EVERY *analytic* truth is known to be true already, BECAUSE it is analytic. > when it is established > to be a Verified Fact. Analytic truth and "verified fact" are complete opposites. "Well, either 9t's raining or it's not raining." is an analytic truth. One or the other of them (at a given time and place) is a fact, REGARDLESS of whether it's verified or not. After it's verified, it can become known, but it WAS TRUE BEFORE that.
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2018-02-11 17:55 +0000 |
| Message-ID | <p5q03b$jnh$1@news.albasani.net> |
| In reply to | #172193 |
Pete Olcott wrote: > Because a proof is a syntactic construct and very little semantics > has ever been fully formalized Not so. See, for starters, Tarski, /Concept of truth in formalized languages/ in /Logic semantics metamathematics/, ed. Corcoran, OUP; and Carnap, /Logical syntax of language/, RKP. > syntactic formal proofs can have very > large inference gaps.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-02-12 20:39 -0600 |
| Message-ID | <oaKdnXv8Y4tx0h_HnZ2dnUU7-LPNnZ2d@giganews.com> |
| In reply to | #172439 |
On 2/11/2018 11:55 AM, Peter Percival wrote: > Pete Olcott wrote: > > >> Because a proof is a syntactic construct and very little semantics >> has ever been fully formalized > > Not so. See, for starters, Tarski, /Concept of truth in formalized languages/ in /Logic semantics metamathematics/, ed. Corcoran, OUP; and Carnap, /Logical syntax of language/, RKP. > Of all the semantics that exists including the exhaustively complete meaning of every word of every human language hardly any has been formalized. When we get to the formalization of the semantics of formal languages there are key gaps as proven by the existence of many paradoxes. Some of those key gaps allow the mistakes of the Halting Problem proofs and the 1931 Incompleteness Theorem to slip through as undetected errors. >> syntactic formal proofs can have very >> large inference gaps. > -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-02-08 03:41 -0800 |
| Message-ID | <200cdb90-3ee6-45c8-ae21-8b38776b777a@googlegroups.com> |
| In reply to | #172057 |
On Tuesday, February 6, 2018 at 11:48:29 PM UTC-5, Pete Olcott wrote: > I don't even bother to get the terminology correctly because You're a dumbass. Next. > much of this terminology has built in > misconceptions and inherent arbitrary limitations. You can't know that unless you first understand at least the broad outlines of the terminology. You don't even know what a counter-example is. You don't know what they MEAN by "semantic property of a TM" in the way that YOU (that's really YOUR terminology -- WE do NOT put it THAT way, normally) are using it. ALL THEY MEAN by "semantic property of a TM" is THE LANGUAGE that the TM accept-halts on. There are many different TMs that accept the same language. It is THIS FACT that makes your notion of pathological SELF reference irrelevant -- in general, a machine CAN'T TELL whether some code-string is describing a machine that is "the same" IN THE REELVANT WAY because the relevant way would be the described machine ACCEPTING THE SAME LANGUAGE AS the evaluating machine. They could have very different machine descriptions YET STILL ACCEPT THE SAME LANGUAGE, still compute THE SAME FUNCTION. What any machine P would have to be able to do, in order TO NOTICE THAT its input-strings were creating self-reference (pathological or otherwise), would be to DETERMINE WHETHER one of them (that was being interpreted as a code-string of a TM) described a machine that ACCEPTED THE SAME LANGUAGE as P. P is unable to do this -- EVERY tm is a "counter-example" to your claim that TMs can do this, except TMs accepting one of the two TRIVIAL languages (accepting the empty set or the universal set).
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-02-08 03:43 -0800 |
| Message-ID | <acba4d19-e0af-42c8-bc7e-6bcd48d9a945@googlegroups.com> |
| In reply to | #172057 |
On Tuesday, February 6, 2018 at 11:48:29 PM UTC-5, Pete Olcott wrote: > To formulate how analytical Truth really works You are not an authority and analytic -- NOT ANLAYTICAL -- truth IS ALREADY defined. YOU DON'T KNOW HOW ANYthing "already works"! What "already works" is BY DEFINITION what is ALREADY WORKED OUT, IN the literature! If you want to take a different approach then THE FIRST thing you have to say is "this is my new different innovative approach to the field, with my newer better terminology", NOT "this is the way concept X really works", especially given that you loudly and publicly prove that you DON'T UNDERSTAND concept X!
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-02-06 18:56 -0800 |
| Message-ID | <f50d3a7e-1497-4d54-ba4b-a8df4cb92a8a@googlegroups.com> |
| In reply to | #172009 |
On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote: > peteolcott writes: > <snip> > > H simply recognizes the Pathological-Self-Reference(Olcott 2004) > > of [H^][H^] and transitions to its ((qn)) state indicating that > > it rejects the input on the basis that it specifies an infinitely > > recursive evaluation sequence. > > There is a theorem that proves this is not possible. Inputs with what > you call PSR are not a decidable set. No TM can spot them all. > Sure this is Rice's claim: Rice's theorem states that all non-trivial, semantic properties of programs are undecidable. Since it can be reduced to the HP then: It becomes a false claim when the key semantic property that prevents all other semantic properties from being evaluated is itself correctly evaluated.
[toc] | [prev] | [next] | [standalone]
Page 4 of 6 — ← Prev page 1 2 3 [4] 5 6 Next page →
Back to top | Article view | sci.logic
csiph-web