Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #170480 > unrolled thread
| Started by | George Greene <greeneg@email.unc.edu> |
|---|---|
| First post | 2018-01-18 21:13 -0800 |
| Last post | 2018-01-20 20:47 -0800 |
| Articles | 20 on this page of 35 — 4 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: Refutation of Halting Problem Proof George Greene <greeneg@email.unc.edu> - 2018-01-18 21:13 -0800
Re: Refutation of Halting Problem Proof George Greene <greeneg@email.unc.edu> - 2018-01-20 20:28 -0800
Re: Refutation of Halting Problem Proof George Greene <greeneg@email.unc.edu> - 2018-01-20 20:36 -0800
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-20 21:15 -0800
Re: Refutation of Halting Problem Proof Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-21 12:46 +0000
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-21 07:07 -0800
Re: Refutation of Halting Problem Proof Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-22 01:55 +0000
Re: Refutation of Halting Problem Proof George Greene <greeneg@email.unc.edu> - 2018-01-21 22:17 -0800
Re: Refutation of Halting Problem Proof Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-22 11:48 +0000
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-22 10:42 -0800
Re: Refutation of Halting Problem Proof Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-22 21:17 +0000
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-22 14:23 -0800
Re: Refutation of Halting Problem Proof Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-23 01:50 +0000
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-22 20:50 -0800
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-22 21:10 -0800
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-22 21:14 -0800
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-22 21:46 -0800
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-22 22:02 -0800
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-22 21:18 -0800
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-22 22:20 -0800
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-22 22:57 -0800
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-24 03:06 -0800
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-24 03:21 -0800
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-24 03:26 -0800
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-22 21:12 -0800
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-24 06:53 -0800
Re: Refutation of Halting Problem Proof Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-24 17:36 +0000
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-24 11:53 -0800
Re: Refutation of Halting Problem Proof Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-25 01:50 +0000
Re: Refutation of Halting Problem Proof grahamcooper7@gmail.com - 2018-01-24 19:28 -0800
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-21 07:09 -0800
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-21 07:11 -0800
Re: Refutation of Halting Problem Proof George Greene <greeneg@email.unc.edu> - 2018-01-21 21:57 -0800
Re: Refutation of Halting Problem Proof peteolcott <peterolcott2@gmail.com> - 2018-01-22 14:25 -0800
Re: Refutation of Halting Problem Proof George Greene <greeneg@email.unc.edu> - 2018-01-20 20:47 -0800
Page 1 of 2 [1] 2 Next page →
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-01-18 21:13 -0800 |
| Subject | Re: Refutation of Halting Problem Proof |
| Message-ID | <fadfb1cd-cdaf-4164-9b11-4d6ac0d9bd1a@googlegroups.com> |
On Wednesday, January 17, 2018 at 10:02:54 PM UTC-5, Pete Olcott wrote: > http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ > > > The above link contains a state transition diagram corresponding to > the definition shown below. > > > > Definition of Turing Machine Ĥ > (state transition sequence) > > q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ qy ∞ > > q0 ŵ ⊢* Ĥ qx ŵ ŵ ⊢* Ĥ y1 qn y2 > > > > Turing Machine Ĥ is applied to a Turing Machine description of > itself ŵ. > > Would > Ĥ transition to its state (qy) or ((qn)) on ŵ ? > > > > > To answer this question we perform an execution trace on Ĥ. > > (1) Ĥ makes a copy of its input, for clarity we will call this copy > ŵ2. > > (2)(3) The first thing that ŵ would do is make a copy of its input, for clarity we will call this copy ŵ3 at state qx.begins to evaluate what ŵ would do on its input ŵ2 at state qx NO, Ĥ DOES *NOT* DO THAT. The definition says INSTEAD that Ĥ then begins TO BEHAVE EXACTLY AS H' would, on the (ŵ,ŵ2) string-pair. YOU ALSO MAY not say that "ŵ would do" something -- ŵ IS A STRING -- it CAN'T *do* anything EXCEPT SIT THERE AND GET PARSED. What might DO something might be THE PROGRAM or algorithm that ŵ is the code-string for, in other words, Ĥ . But because you still can't tell whether Ĥ is a machine or a program running on a machine, you can't even parse THAT. One and the same string can be written on MANY DIFFERENT blackboards. One and the same program can be run on MANY DIFFERENT computers. One and the same subroutine can be invoked by MANY DIFFERENT programs, or many DIFFERENT TIMES, with DIFFERENT PARAMETERS OR ARGUMENTS, in THE SAME program. You are still not clear in your own mind whether a TM should be thought of as a PC, a matrix, a graph, a program, an algorithm, or a subroutine. You have seen the definition but YOU DON'T KNOW WHICH of the above this definition implies a TM to be. So, getting back to the execution-trace of Ĥ, the next thing Ĥ ACTUALLY does IS WHATEVER H' would do with the input (ŵ,ŵ2). Your claim could still be salvaged if the first thing H' wanted to do was analyze the program coded by string ŵ, AND H' DOES INDEED WANT TO DO THAT, but the question IS HOW? And according TO THE DEFINITION OF H', H' decides what to do with its (program-string,input-string) pair by FIRST ASKING WHAT H would do with them: H' is determined to do the opposite of what H does. If H says that the machine whose code-string is ŵ will halt on input-string ŵ2, then H' will loop. If H says this call will loop then H' will halt returning true. H' DOES NOT try DIRECTLY to analyze the behavior of the machine-named/coded-by ŵ : it instead CALLS H and LETS H do that. So your claim COULD STILL be salvaged if the first thing H wanted to do with its (ŵ,ŵ2) input-pair was "begin to evaluate what ŵ would do on its input ŵ2", and H DOES INDEED WANT TO DO THAT, but the question IS HOW? You note, > (3) The first thing that ŵ would do is make a copy of its input, > for clarity we will call this copy ŵ3 at state qx. AND YES, that IS the first thing that Ĥ -- NOT ŵ -- the MACHINE NAMED/CODED by ŵ, which is Ĥ -- would do, BUT THAT IS NOT WHAT HAPPENS here. H *MAY*NOT* begin its analysis of whether the machine named/coded by ŵ halts (or not) on ŵ2 BY ACTUALLY STARTING TO RUN Ĥ(ŵ2), because H *IS*REQUIRED*TO*ALWAYS*HALT*. IT CAN'T just INVOKE the-machine-coded-by-ŵ because IT DOESN'T KNOW whether that call will halt OR NOT. If it turns out that that call/invocation LOOPS then *H*WILL*LOOP*TOO*, which IS NOT ALLOWED. So H *CAN'T* just begin making another copy w3 -- IT HAS to do something ELSE -- it has to (at least at first) ANALYZE INSTEAD OF EXECUTE the code-string ŵ. Now, of course, if H already knew that Ĥ(ŵ2) would halt, then it could safely begin to emulate it, but since the ONLY thing that this analysis by H *IS*TRYING* to compute is WHETHER THIS CALL HALTS, if H ALREADY KNEW that, then it wouldn't NEED to emulate H^-as-encoded-by-w^ --IT COULD JUST RETURN TRUE IMMEDIATELY. So it wouldn't emulate/execute Ĥ(ŵ2) again in that case EITHER. In other words, IN NO case is the next thing that H^ does "make a 3rd copy of its input". So there is no infinite regress here. Weirdly, however, I now know why H^ was created, because if you try to ask "what happens if you call H' on two copies of ITS code-string", you DO get an infinite regress from the doubling (or a failure to have a long- enough input-string). Perhaps Linz's H^ work- around (for avoiding that) is better than mine, but given the level of confusion it has caused Peter, I still don't like it.
[toc] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-01-20 20:28 -0800 |
| Message-ID | <3aedc537-d3e3-4247-8f62-a904de1263df@googlegroups.com> |
| In reply to | #170480 |
On Friday, January 19, 2018 at 11:28:19 AM UTC-5, Pete Olcott wrote: > To answer this question we perform an execution trace on Ĥ. > > (1) Ĥ makes a copy of its input, for clarity we will call this copy > ŵ2. Right. > > (2)(3) The first thing that ŵ would do is make a copy of its input, NO, ŵ NEVER DOES ANYthing because IT CAN'T "do" anything because it is A STRING, NOT a TM. It is the code-string FOR a TM, but the-TM-that-ŵ-is-the-code-string-for IS Ĥ, which is why it should have been called h^, NOT ŵ. > for clarity we will call this copy ŵ3 THIS NEVER HAPPENS, DUMBASS. ŵ, after doubling its input, according to the definition, DOES EXACTLY WHAT H' would do with the ŵ ŵ2 input-pair. H' wants to know whether the TM-described-by-ŵ would or would not halt on the input ŵ2 (which equals ŵ, which equals h^) but in order to figure this out H' DOES NOT start EXECUTING Ĥ (which you are wrongly calling ŵ) again! H' INSTEAD *CALLS*H* -- or emulates H, i.e., behaves exactly as H would behave -- on this input pair! And H doesn't re-execute Ĥ(ŵ3) like you wrongly think it does EITHER, because it doesn't DARE, because it doesn't know whether that call will or won't halt, and H ALWAYS HAS to halt.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-01-20 20:36 -0800 |
| Message-ID | <12d693bb-3284-44c3-95b4-f6ea952ded44@googlegroups.com> |
| In reply to | #170480 |
On Friday, January 19, 2018 at 11:28:19 AM UTC-5, Pete Olcott wrote: > The author made a mistake on this part, anyone knowing finite state > machines WHICH*DOES*NOT* include YOU! NOBODY CALLS a TM "a finite state machine" around here! THAT term is generally RESERVED for finite state machines that are NOTHING BUT a finite-state-machine and are NOT supplemented/augmented by any kind ADDITINONAL capabilities, like INFINITE extra storage from a stack or a tape! If it's ONLY a finite state machine then it can ONLY parse/recognize/accept A REGULAR language and TMs are much MORE COMPLICATED AND POWERFUL THAN than that (than "finite state machines"), DESPITE the fact that they have a finite number of states! They have MORE THAN JUST their states and that is why NOBODY CALLS them anything as lame as "finite state machines" -- they ALSO have AN INFINITE TAPE THAT THEY CAN WRITE ON AND MOVE BACKWARDS OVER! "Finite state machines" DO NOT HAVE these things! READ A MOTHER-FUCKING *BOOK*, YOU IGNORANT*ARROGANT* dipshit! https://en.wikipedia.org/wiki/Finite-state_machine > knows that every finite state machine only has one start state That's a convention and IT DOESN'T MATTER. It's not like it would change anything if it had more, as long as it was only a finite number. > and this state is labeled state 0. In the author's notation it is > labeled q0. > > The author incorrectly labeled state qx as state > q0: HE DID NOT. He, unlike you, KNOWS that H^ calls H' and he was talking about THE q0 *OF*H'*, the second time, YOU IDIOT.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-01-20 21:15 -0800 |
| Message-ID | <5cef4ecf-5518-4dba-875c-0308720ef2da@googlegroups.com> |
| In reply to | #170669 |
On Saturday, January 20, 2018 at 10:36:53 PM UTC-6, George Greene wrote: > On Friday, January 19, 2018 at 11:28:19 AM UTC-5, Pete Olcott wrote: > > The author made a mistake on this part, anyone knowing finite state > > machines > > The author incorrectly labeled state qx as state > > q0: > > HE DID NOT. He, unlike you, KNOWS that H^ calls H' and he was talking > about THE q0 *OF*H'*, the second time, YOU IDIOT. Ben already agreed with me on this.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-21 12:46 +0000 |
| Message-ID | <874lnfxttu.fsf@bsb.me.uk> |
| In reply to | #170675 |
peteolcott <peterolcott2@gmail.com> writes: > On Saturday, January 20, 2018 at 10:36:53 PM UTC-6, George Greene wrote: >> On Friday, January 19, 2018 at 11:28:19 AM UTC-5, Pete Olcott wrote: >> > The author made a mistake on this part, anyone knowing finite state >> > machines > >> > The author incorrectly labeled state qx as state >> > q0: >> >> HE DID NOT. He, unlike you, KNOWS that H^ calls H' and he was talking >> about THE q0 *OF*H'*, the second time, YOU IDIOT. > > Ben already agreed with me on this. No I did not. My view that there is an error in the formula though the surrounding text makes it quote clear that the second q0 is that of H'. Linz knows how the proof goes perfectly well, even if the presentation is not very good. At best the book's proof is unclear, at worst it has an error that can be easily corrected. But so what? By now, after more than a decade, you should be able to correct this mistake yourself and move on. If you can't (and it seems you can't) read a better proof in another textbook. Alternatively, just write out a proof for yourself. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-01-21 07:07 -0800 |
| Message-ID | <e5a28b93-cb40-4b16-9938-7f228e530b43@googlegroups.com> |
| In reply to | #170683 |
On Sunday, January 21, 2018 at 6:46:57 AM UTC-6, Ben Bacarisse wrote: > peteolcott writes: > > > On Saturday, January 20, 2018 at 10:36:53 PM UTC-6, George Greene wrote: > >> On Friday, January 19, 2018 at 11:28:19 AM UTC-5, Pete Olcott wrote: > >> > The author made a mistake on this part, anyone knowing finite state > >> > machines > > > >> > The author incorrectly labeled state qx as state > >> > q0: > >> > >> HE DID NOT. He, unlike you, KNOWS that H^ calls H' and he was talking > >> about THE q0 *OF*H'*, the second time, YOU IDIOT. > > > > Ben already agreed with me on this. > > No I did not. My view that there is an error in the formula though the > surrounding text makes it quote clear that the second q0 is that of H'. > Linz knows how the proof goes perfectly well, even if the presentation > is not very good. > > At best the book's proof is unclear, at worst it has an error that can > be easily corrected. But so what? By now, after more than a decade, > you should be able to correct this mistake yourself and move on. If you > can't (and it seems you can't) read a better proof in another textbook. > Alternatively, just write out a proof for yourself. > > -- > Ben. I did but George still does not accept there is a mistake. Since you provided a corrected version, I know that you know there is a mistake. I corrected, clarified and simplified the text into a single Turing Machine definition and even spent hours learning the software to create state transition diagram Figure 12.3. Could you verify to George that everything up to the yellow highlighted text correctly defines TM Ĥ and the HP proof that Linz presents? Could you also verify to George that this TM Ĥ can be analyzed separately without any further consideration of TM H' and TM H? http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-22 01:55 +0000 |
| Message-ID | <87fu6ywtc0.fsf@bsb.me.uk> |
| In reply to | #170693 |
peteolcott <peterolcott2@gmail.com> writes: > On Sunday, January 21, 2018 at 6:46:57 AM UTC-6, Ben Bacarisse wrote: >> peteolcott writes: >> >> > On Saturday, January 20, 2018 at 10:36:53 PM UTC-6, George Greene wrote: >> >> On Friday, January 19, 2018 at 11:28:19 AM UTC-5, Pete Olcott wrote: >> >> > The author made a mistake on this part, anyone knowing finite state >> >> > machines >> > >> >> > The author incorrectly labeled state qx as state >> >> > q0: >> >> >> >> HE DID NOT. He, unlike you, KNOWS that H^ calls H' and he was talking >> >> about THE q0 *OF*H'*, the second time, YOU IDIOT. >> > >> > Ben already agreed with me on this. >> >> No I did not. My view that there is an error in the formula though the >> surrounding text makes it quote clear that the second q0 is that of H'. >> Linz knows how the proof goes perfectly well, even if the presentation >> is not very good. >> >> At best the book's proof is unclear, at worst it has an error that can >> be easily corrected. But so what? By now, after more than a decade, >> you should be able to correct this mistake yourself and move on. If you >> can't (and it seems you can't) read a better proof in another textbook. >> Alternatively, just write out a proof for yourself. > > I did but George still does not accept there is a mistake. Yes he does. But it's such a trivial mistake, and one so easily corrected (when you know what's going on) that he wants to move on and talk about the proof a what H^ an H' actually do. It's just using q0 for two different things, so he's not prepared to call it an incorrect label. You can choose to keep harping on about this, or you can just move on because we all agree on what Linz intended. > Since you provided a corrected version, I know that you know > there is a mistake. > > I corrected, clarified and simplified the text into a single > Turing Machine definition and even spent hours learning the > software to create state transition diagram Figure 12.3. If you have corrected the text, then you will have a sound proof of the halting theorem, so I very much doubt you have corrected the text. > Could you verify to George that everything up to the yellow > highlighted text correctly defines TM Ĥ and the HP proof > that Linz presents? No, because you talk about "the second start state of H^". I think I know what you mean, but what you say is wrong. The puzzling thing is that what I think you are trying to say is exactly what George has been saying, OFTEN IN ALL CAPS, for many posts now -- after copying the input H^ CALLS H'. I prefer to think of it as a jump rather than a call but it is, technically, simply that H^ enters H-prime's initial state. As far as I can see we all agree on that, but for some reason you want me to tell George that when he's been telling you that for days. > Could you also verify to George that this TM Ĥ can be analyzed > separately without any further consideration of TM H' and TM H? No I can't. It's wrong. Since H^ is defined in terms of H' (and hence H) what H^ does is intimately linked with what H does. After all, H^ does nothing more than copy the input tape and then jump to H' (which behaves, until the end of it's execution traces, exactly like H). > http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2018-01-21 22:17 -0800 |
| Message-ID | <159dfa50-87e0-4afc-beab-4d4374468f44@googlegroups.com> |
| In reply to | #170729 |
On Sunday, January 21, 2018 at 8:55:15 PM UTC-5, Ben Bacarisse wrote: > The puzzling thing is that what I think you are trying to say is exactly > what George has been saying, OFTEN IN ALL CAPS, for many posts now -- > after copying the input H^ CALLS H'. I prefer to think of it as a jump > rather than a call but it is, technically, simply that H^ enters > H-prime's initial state. Or rather, ITS COPY OF, ITS EMULATIN OF, H-prime's initial state. P.O can't concede that it's The Actual H-prime's Actual Initial State because they are "different machines" so they must have "different states". P.O.'s problem is that he thinks a Turing Machine is a machine. What MATTERS, what DEFINES the TM, is THE PROGRAM THAT IT'S RUNNING, is THE ALGORITHM THAT IT IMPLEMENTS. It would NOT BE POSSIBLE for us to take H^ or H' and RUN A DIFFERENT PROGRAM with it -- that would be A DIFFERENT *TM* _because_ it would be a different program. There are some TMs (including H' here) that can take a program-description as input and run the described program (so they can run many differen programs), but THOSE programs can&do DO THAT *BECAUSE* they represent/embnody/ALWAYS-run *ONE* emulator-prorgam!
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-22 11:48 +0000 |
| Message-ID | <871siiw1v2.fsf@bsb.me.uk> |
| In reply to | #170747 |
George Greene <greeneg@email.unc.edu> writes: > On Sunday, January 21, 2018 at 8:55:15 PM UTC-5, Ben Bacarisse wrote: >> The puzzling thing is that what I think you are trying to say is exactly >> what George has been saying, OFTEN IN ALL CAPS, for many posts now -- >> after copying the input H^ CALLS H'. I prefer to think of it as a jump >> rather than a call but it is, technically, simply that H^ enters >> H-prime's initial state. > > Or rather, ITS COPY OF, ITS EMULATIN OF, H-prime's initial state. > P.O can't concede that it's The Actual H-prime's Actual Initial State > because they are "different machines" so they must have "different > states". > > P.O.'s problem is that he thinks a Turing Machine is a machine. I can't see why that metaphor is a problem. The construction makes one machine from another and that can be imagined as either duplication or modification. To make an outboard motor from an egg whisk I can either copy the whisk and add a propeller or I can modify the original whisk. In both cases I get a new machine whose behaviour is different and in both cases I can legitimately talk about attaching a propeller to the shaft of the whisk. > What MATTERS, what DEFINES the TM, is THE PROGRAM THAT IT'S RUNNING, > is THE ALGORITHM THAT IT IMPLEMENTS. It would NOT BE POSSIBLE for > us to take H^ or H' and RUN A DIFFERENT PROGRAM with it -- that would be > A DIFFERENT *TM* _because_ it would be a different program. > > There are some TMs (including H' here) that can take a program-description > as input and run the described program I don't think that's very well put. It may reinforce another of PO's problems. He's *assuming* that H' (and consequently H) must do exactly that -- run an input machine. H' *may* be a machine that can run a given program, but it may very well not be. I think you mean that H', being based on an entirely arbitrary machine H, *might* be such a TM. But I fear a lot of time can be lost worrying about why someone so determined to get the result they set out to get is confused. It's inevitable that PO's prior beliefs will clash with any proof of a theorem like this and the only issue (for him) will be how he can talk his way out of understanding it. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-01-22 10:42 -0800 |
| Message-ID | <147b7c39-210a-45a9-a373-1601eba49f8f@googlegroups.com> |
| In reply to | #170729 |
On Sunday, January 21, 2018 at 7:55:15 PM UTC-6, Ben Bacarisse wrote: > peteolcott writes: > > > On Sunday, January 21, 2018 at 6:46:57 AM UTC-6, Ben Bacarisse wrote: > >> peteolcott writes: > >> > >> > On Saturday, January 20, 2018 at 10:36:53 PM UTC-6, George Greene wrote: > >> >> On Friday, January 19, 2018 at 11:28:19 AM UTC-5, Pete Olcott wrote: > >> >> > The author made a mistake on this part, anyone knowing finite state > >> >> > machines > >> > > >> >> > The author incorrectly labeled state qx as state > >> >> > q0: > >> >> > >> >> HE DID NOT. He, unlike you, KNOWS that H^ calls H' and he was talking > >> >> about THE q0 *OF*H'*, the second time, YOU IDIOT. > >> > > >> > Ben already agreed with me on this. > >> > >> No I did not. My view that there is an error in the formula though the > >> surrounding text makes it quote clear that the second q0 is that of H'. > >> Linz knows how the proof goes perfectly well, even if the presentation > >> is not very good. > >> > >> At best the book's proof is unclear, at worst it has an error that can > >> be easily corrected. But so what? By now, after more than a decade, > >> you should be able to correct this mistake yourself and move on. If you > >> can't (and it seems you can't) read a better proof in another textbook. > >> Alternatively, just write out a proof for yourself. > > > > I did but George still does not accept there is a mistake. > > Yes he does. But it's such a trivial mistake, and one so easily > corrected (when you know what's going on) that he wants to move on and > talk about the proof a what H^ an H' actually do. It's just using q0 > for two different things, so he's not prepared to call it an incorrect > label. > http://liarparadox.org/HP_Infinite_Recursion.pdf // Direct quote from the bottom of page 319 q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ qy ∞ q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ y1 qn y2 If you are not willing to concede that when the above is considered the definition of the single machine Ĥ the fact that two start states are shown is necessarily an error then you are too dishonest to continue talking to.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-22 21:17 +0000 |
| Message-ID | <87372xvbit.fsf@bsb.me.uk> |
| In reply to | #170761 |
peteolcott <peterolcott2@gmail.com> writes: > On Sunday, January 21, 2018 at 7:55:15 PM UTC-6, Ben Bacarisse wrote: >> peteolcott writes: >> >> > On Sunday, January 21, 2018 at 6:46:57 AM UTC-6, Ben Bacarisse wrote: >> >> peteolcott writes: >> >> >> >> > On Saturday, January 20, 2018 at 10:36:53 PM UTC-6, George Greene wrote: >> >> >> On Friday, January 19, 2018 at 11:28:19 AM UTC-5, Pete Olcott wrote: >> >> >> > The author made a mistake on this part, anyone knowing finite state >> >> >> > machines >> >> > >> >> >> > The author incorrectly labeled state qx as state >> >> >> > q0: >> >> >> >> >> >> HE DID NOT. He, unlike you, KNOWS that H^ calls H' and he was talking >> >> >> about THE q0 *OF*H'*, the second time, YOU IDIOT. >> >> > >> >> > Ben already agreed with me on this. >> >> >> >> No I did not. My view that there is an error in the formula though the >> >> surrounding text makes it quote clear that the second q0 is that of H'. >> >> Linz knows how the proof goes perfectly well, even if the presentation >> >> is not very good. >> >> >> >> At best the book's proof is unclear, at worst it has an error that can >> >> be easily corrected. But so what? By now, after more than a decade, >> >> you should be able to correct this mistake yourself and move on. If you >> >> can't (and it seems you can't) read a better proof in another textbook. >> >> Alternatively, just write out a proof for yourself. >> > >> > I did but George still does not accept there is a mistake. >> >> Yes he does. But it's such a trivial mistake, and one so easily >> corrected (when you know what's going on) that he wants to move on and >> talk about the proof a what H^ an H' actually do. It's just using q0 >> for two different things, so he's not prepared to call it an incorrect >> label. >> > > http://liarparadox.org/HP_Infinite_Recursion.pdf > // Direct quote from the bottom of page 319 > > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ qy ∞ > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ y1 qn y2 > > If you are not willing to concede that when the above is > considered the definition of the single machine Ĥ the > fact that two start states are shown is necessarily an > error then you are too dishonest to continue talking to. You keep repeating yourself. How many times must I repeat myself? When will you finally move on and simply correct this error (or inaccuracy or bad explanation or whatever you/I/George/anyone else decides to call it)? Everybody here (even you) gets it -- that second q0 is supposed to be H-prime's q0 not H-hat's. Lintz has not introduced the right notation to say that. Maybe he did not spot the problem. Maybe he (like George) just thought everyone would see from the wording of the surrounding text what was intended. I really don't see why you need to waste so much time on what is barely more than a typo. But then you've wasted more than a decade already so a few more months on a simple error is some text is not too bad I suppose. I look forward to a time when you've managed to get over this problem. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-01-22 14:23 -0800 |
| Message-ID | <d6c92f4a-1113-4243-bf62-5432eb7e2d5c@googlegroups.com> |
| In reply to | #170770 |
On Monday, January 22, 2018 at 3:17:36 PM UTC-6, Ben Bacarisse wrote: > peteolcott writes: > > > On Sunday, January 21, 2018 at 7:55:15 PM UTC-6, Ben Bacarisse wrote: > >> peteolcott writes: > >> > >> > On Sunday, January 21, 2018 at 6:46:57 AM UTC-6, Ben Bacarisse wrote: > >> >> peteolcott writes: > >> >> > >> >> > On Saturday, January 20, 2018 at 10:36:53 PM UTC-6, George Greene wrote: > >> >> >> On Friday, January 19, 2018 at 11:28:19 AM UTC-5, Pete Olcott wrote: > >> >> >> > The author made a mistake on this part, anyone knowing finite state > >> >> >> > machines > >> >> > > >> >> >> > The author incorrectly labeled state qx as state > >> >> >> > q0: > >> >> >> > >> >> >> HE DID NOT. He, unlike you, KNOWS that H^ calls H' and he was talking > >> >> >> about THE q0 *OF*H'*, the second time, YOU IDIOT. > >> >> > > >> >> > Ben already agreed with me on this. > >> >> > >> >> No I did not. My view that there is an error in the formula though the > >> >> surrounding text makes it quote clear that the second q0 is that of H'. > >> >> Linz knows how the proof goes perfectly well, even if the presentation > >> >> is not very good. > >> >> > >> >> At best the book's proof is unclear, at worst it has an error that can > >> >> be easily corrected. But so what? By now, after more than a decade, > >> >> you should be able to correct this mistake yourself and move on. If you > >> >> can't (and it seems you can't) read a better proof in another textbook. > >> >> Alternatively, just write out a proof for yourself. > >> > > >> > I did but George still does not accept there is a mistake. > >> > >> Yes he does. But it's such a trivial mistake, and one so easily > >> corrected (when you know what's going on) that he wants to move on and > >> talk about the proof a what H^ an H' actually do. It's just using q0 > >> for two different things, so he's not prepared to call it an incorrect > >> label. > >> > > > > http://liarparadox.org/HP_Infinite_Recursion.pdf > > // Direct quote from the bottom of page 319 > > > > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ qy ∞ > > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ y1 qn y2 > > > > If you are not willing to concede that when the above is > > considered the definition of the single machine Ĥ the > > fact that two start states are shown is necessarily an > > error then you are too dishonest to continue talking to. > > You keep repeating yourself. How many times must I repeat myself? When > will you finally move on and simply correct this error (or inaccuracy or > bad explanation or whatever you/I/George/anyone else decides to call > it)? I did correct it. George did not believe my correction so I asked you to confirm to George that my correction was correct. The following link up to the yellow highlighted portion is my correction. http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ You refused to confirm my correction so we must stop talking because one side of this conversion is disingenuous and dishonest. There is no possible way that I can explain the much more difficult steps after state qx if neither you nor George will even agree that the state transitions ever reach state qx.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-23 01:50 +0000 |
| Message-ID | <87wp09tkar.fsf@bsb.me.uk> |
| In reply to | #170771 |
peteolcott <peterolcott2@gmail.com> writes: > On Monday, January 22, 2018 at 3:17:36 PM UTC-6, Ben Bacarisse wrote: >> peteolcott writes: <snip> >> > // Direct quote from the bottom of page 319 >> > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ qy ∞ >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ y1 qn y2 >> > >> > If you are not willing to concede that when the above is >> > considered the definition of the single machine Ĥ the >> > fact that two start states are shown is necessarily an >> > error then you are too dishonest to continue talking to. >> >> You keep repeating yourself. How many times must I repeat myself? When >> will you finally move on and simply correct this error (or inaccuracy or >> bad explanation or whatever you/I/George/anyone else decides to call >> it)? > > I did correct it. George did not believe my correction so I asked > you to confirm to George that my correction was correct. No, you tried, but you wrote nonsense. A TM always has one start state. > The following > link up to the yellow highlighted portion is my correction. > http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ > > You refused to confirm my correction so we must stop talking > because one side of this conversion is disingenuous and dishonest. Sure -- by all means stop talking to me -- but your correction is nonsense because H^ does not have two start states. *I* can work out what you mean because of the discussion here, but any reader of that page without that background will be baffled -- TMs always have only one start state. > There is no possible way that I can explain the much more difficult > steps after state qx if neither you nor George will even agree > that the state transitions ever reach state qx. Don't be silly. Everyone knows what state H^ enters after duplicating the input tape. You are making a mountain out of a typo. After finally getting what Linz intended, you should be able to see that the proof is sound. You won't though. You will now have to find something else to misunderstand about the proof. Mind you, it occurs to me that I might be being too generous. Maybe you don't know how H^ should be constructed to make the proof work. Maybe you really do think that a TM can have two start states and it's not just a lax way of talking about the start state of H^ and the start state of H^ that now correspond to the start state of H' from which H^ is built. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-22 20:50 -0800 |
| Message-ID | <8aa653fe-ab70-4df7-8fcb-66a3e79d8426@googlegroups.com> |
| In reply to | #170784 |
On Tuesday, January 23, 2018 at 12:50:56 PM UTC+11, Ben Bacarisse wrote: > peteolcott <peterolcott2@gmail.com> writes: > > > On Monday, January 22, 2018 at 3:17:36 PM UTC-6, Ben Bacarisse wrote: > >> peteolcott writes: > <snip> > >> > // Direct quote from the bottom of page 319 > >> > > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ qy ∞ > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ y1 qn y2 > >> > > >> > If you are not willing to concede that when the above is > >> > considered the definition of the single machine Ĥ the > >> > fact that two start states are shown is necessarily an > >> > error then you are too dishonest to continue talking to. > >> > >> You keep repeating yourself. How many times must I repeat myself? When > >> will you finally move on and simply correct this error (or inaccuracy or > >> bad explanation or whatever you/I/George/anyone else decides to call > >> it)? > > > > I did correct it. George did not believe my correction so I asked > > you to confirm to George that my correction was correct. > > No, you tried, but you wrote nonsense. A TM always has one start state. > The flaw in Turings Proof is simple! HALT() SPECIFICATION H 0 1 2 3 4.... 1 2 3 4 5 6 .. Fill the following TABLE with 0 = tmy(x) halts 1 = tmy(x) never halts
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-01-22 21:10 -0800 |
| Message-ID | <6643b5ed-6d48-4bc5-b102-c6c9514a7231@googlegroups.com> |
| In reply to | #170795 |
On Monday, January 22, 2018 at 10:51:02 PM UTC-6, graham...@gmail.com wrote: > On Tuesday, January 23, 2018 at 12:50:56 PM UTC+11, Ben Bacarisse wrote: > > peteolcott writes: > > > > > On Monday, January 22, 2018 at 3:17:36 PM UTC-6, Ben Bacarisse wrote: > > >> peteolcott writes: > > <snip> > > >> > // Direct quote from the bottom of page 319 > > >> > > > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ qy ∞ > > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ y1 qn y2 > > >> > > > >> > If you are not willing to concede that when the above is > > >> > considered the definition of the single machine Ĥ the > > >> > fact that two start states are shown is necessarily an > > >> > error then you are too dishonest to continue talking to. > > >> > > >> You keep repeating yourself. How many times must I repeat myself? When > > >> will you finally move on and simply correct this error (or inaccuracy or > > >> bad explanation or whatever you/I/George/anyone else decides to call > > >> it)? > > > > > > I did correct it. George did not believe my correction so I asked > > > you to confirm to George that my correction was correct. > > > > No, you tried, but you wrote nonsense. A TM always has one start state. > > > > > > > The flaw in Turings Proof is simple! > > > > HALT() SPECIFICATION > > > H 0 1 2 3 4.... > 1 > 2 > 3 > 4 > 5 > 6 > .. > > > Fill the following TABLE with > > 0 = tmy(x) halts > 1 = tmy(x) never halts The Halting Problem is exactly the same error as the Liar Paradox yet no one else besides me has figured out exactly what is going on with that one either. http://liarparadox.org/index.php/2017/12/08/concise-formalization-of-the-liar-paradox/ The problem is that self-reference semantics had never been formalized before.
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-22 21:14 -0800 |
| Message-ID | <9e06a161-7733-496d-b1cf-71d00bcbc1eb@googlegroups.com> |
| In reply to | #170796 |
On Tuesday, January 23, 2018 at 4:10:51 PM UTC+11, peteolcott wrote: > On Monday, January 22, 2018 at 10:51:02 PM UTC-6, graham...@gmail.com wrote: > > On Tuesday, January 23, 2018 at 12:50:56 PM UTC+11, Ben Bacarisse wrote: > > > peteolcott writes: > > > > > > > On Monday, January 22, 2018 at 3:17:36 PM UTC-6, Ben Bacarisse wrote: > > > >> peteolcott writes: > > > <snip> > > > >> > // Direct quote from the bottom of page 319 > > > >> > > > > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ qy ∞ > > > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ y1 qn y2 > > > >> > > > > >> > If you are not willing to concede that when the above is > > > >> > considered the definition of the single machine Ĥ the > > > >> > fact that two start states are shown is necessarily an > > > >> > error then you are too dishonest to continue talking to. > > > >> > > > >> You keep repeating yourself. How many times must I repeat myself? When > > > >> will you finally move on and simply correct this error (or inaccuracy or > > > >> bad explanation or whatever you/I/George/anyone else decides to call > > > >> it)? > > > > > > > > I did correct it. George did not believe my correction so I asked > > > > you to confirm to George that my correction was correct. > > > > > > No, you tried, but you wrote nonsense. A TM always has one start state. > > > > > > > > > > > > > The flaw in Turings Proof is simple! > > > > > > > > HALT() SPECIFICATION > > > > > > H 0 1 2 3 4.... > > 1 > > 2 > > 3 > > 4 > > 5 > > 6 > > .. > > > > > > Fill the following TABLE with > > > > 0 = tmy(x) halts > > 1 = tmy(x) never halts > > The Halting Problem is exactly the same error as the Liar Paradox > yet no one else besides me has figured out exactly what is going > on with that one either. > > http://liarparadox.org/index.php/2017/12/08/concise-formalization-of-the-liar-paradox/ > > The problem is that self-reference semantics had never been formalized before. Semantic Analysis is only 1-WAY to resolve a liar statement LET L = true BY AXIOMS L' = false BY AXIOMS L'' = true Proof by contradiction
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-01-22 21:46 -0800 |
| Message-ID | <5a5c0b40-82a5-4f47-a017-c9cf510f326b@googlegroups.com> |
| In reply to | #170798 |
On Monday, January 22, 2018 at 11:14:20 PM UTC-6, graham...@gmail.com wrote: > On Tuesday, January 23, 2018 at 4:10:51 PM UTC+11, peteolcott wrote: > > On Monday, January 22, 2018 at 10:51:02 PM UTC-6, graham...@gmail.com wrote: > > > On Tuesday, January 23, 2018 at 12:50:56 PM UTC+11, Ben Bacarisse wrote: > > > > peteolcott writes: > > > > > > > > > On Monday, January 22, 2018 at 3:17:36 PM UTC-6, Ben Bacarisse wrote: > > > > >> peteolcott writes: > > > > <snip> > > > > >> > // Direct quote from the bottom of page 319 > > > > >> > > > > > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ qy ∞ > > > > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ y1 qn y2 > > > > >> > > > > > >> > If you are not willing to concede that when the above is > > > > >> > considered the definition of the single machine Ĥ the > > > > >> > fact that two start states are shown is necessarily an > > > > >> > error then you are too dishonest to continue talking to. > > > > >> > > > > >> You keep repeating yourself. How many times must I repeat myself? When > > > > >> will you finally move on and simply correct this error (or inaccuracy or > > > > >> bad explanation or whatever you/I/George/anyone else decides to call > > > > >> it)? > > > > > > > > > > I did correct it. George did not believe my correction so I asked > > > > > you to confirm to George that my correction was correct. > > > > > > > > No, you tried, but you wrote nonsense. A TM always has one start state. > > > > > > > > > > > > > > > > > > > The flaw in Turings Proof is simple! > > > > > > > > > > > > HALT() SPECIFICATION > > > > > > > > > H 0 1 2 3 4.... > > > 1 > > > 2 > > > 3 > > > 4 > > > 5 > > > 6 > > > .. > > > > > > > > > Fill the following TABLE with > > > > > > 0 = tmy(x) halts > > > 1 = tmy(x) never halts > > > > The Halting Problem is exactly the same error as the Liar Paradox > > yet no one else besides me has figured out exactly what is going > > on with that one either. > > > > http://liarparadox.org/index.php/2017/12/08/concise-formalization-of-the-liar-paradox/ > > > > The problem is that self-reference semantics had never been formalized before. > > > > Semantic Analysis is only 1-WAY to resolve a liar statement > > > LET L = true > BY AXIOMS L' = false > BY AXIOMS L'' = true > > Proof by contradiction Put two more decades and 6000 hours into and see if you don't get a little deeper. Superficially with only 2000 hours of investigation it seems like the following sentence: "This sentence is not true". Cannot be true only because that would make it false which would make it true, on and on. No one else ever gets much further than this. Then we look at the even simpler version: "This sentence is true". Is not true either, and it is also not false. When we analyze this version then we begin to see what is really going on.
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-22 22:02 -0800 |
| Message-ID | <96bf86d4-608d-4f69-8423-2f19b27db6f6@googlegroups.com> |
| In reply to | #170803 |
On Tuesday, January 23, 2018 at 4:46:24 PM UTC+11, peteolcott wrote: > On Monday, January 22, 2018 at 11:14:20 PM UTC-6, graham...@gmail.com wrote: > > On Tuesday, January 23, 2018 at 4:10:51 PM UTC+11, peteolcott wrote: > > > On Monday, January 22, 2018 at 10:51:02 PM UTC-6, graham...@gmail.com wrote: > > > > On Tuesday, January 23, 2018 at 12:50:56 PM UTC+11, Ben Bacarisse wrote: > > > > > peteolcott writes: > > > > > > > > > > > On Monday, January 22, 2018 at 3:17:36 PM UTC-6, Ben Bacarisse wrote: > > > > > >> peteolcott writes: > > > > > <snip> > > > > > >> > // Direct quote from the bottom of page 319 > > > > > >> > > > > > > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ qy ∞ > > > > > >> > q0 Wm ⊢* Ĥ q0 Wm Wm ⊢* Ĥ y1 qn y2 > > > > > >> > > > > > > >> > If you are not willing to concede that when the above is > > > > > >> > considered the definition of the single machine Ĥ the > > > > > >> > fact that two start states are shown is necessarily an > > > > > >> > error then you are too dishonest to continue talking to. > > > > > >> > > > > > >> You keep repeating yourself. How many times must I repeat myself? When > > > > > >> will you finally move on and simply correct this error (or inaccuracy or > > > > > >> bad explanation or whatever you/I/George/anyone else decides to call > > > > > >> it)? > > > > > > > > > > > > I did correct it. George did not believe my correction so I asked > > > > > > you to confirm to George that my correction was correct. > > > > > > > > > > No, you tried, but you wrote nonsense. A TM always has one start state. > > > > > > > > > > > > > > > > > > > > > > > > > The flaw in Turings Proof is simple! > > > > > > > > > > > > > > > > HALT() SPECIFICATION > > > > > > > > > > > > H 0 1 2 3 4.... > > > > 1 > > > > 2 > > > > 3 > > > > 4 > > > > 5 > > > > 6 > > > > .. > > > > > > > > > > > > Fill the following TABLE with > > > > > > > > 0 = tmy(x) halts > > > > 1 = tmy(x) never halts > > > > > > The Halting Problem is exactly the same error as the Liar Paradox > > > yet no one else besides me has figured out exactly what is going > > > on with that one either. > > > > > > http://liarparadox.org/index.php/2017/12/08/concise-formalization-of-the-liar-paradox/ > > > > > > The problem is that self-reference semantics had never been formalized before. > > > > > > > > Semantic Analysis is only 1-WAY to resolve a liar statement > > > > > > LET L = true > > BY AXIOMS L' = false > > BY AXIOMS L'' = true > > > > Proof by contradiction > > Put two more decades and 6000 hours into and see if you don't get > a little deeper. > > Superficially with only 2000 hours of investigation it seems like > the following sentence: > > "This sentence is not true". > > Cannot be true only because that would make it false which would make > it true, on and on. No one else ever gets much further than this. > > Then we look at the even simpler version: > "This sentence is true". > Is not true either, and it is also not false. > > When we analyze this version then we begin to see what is really going on. Not at all! EXISTS(X) , set specification , variable initialisation are all the same thing! It is not well known that a LOGIC ENGINE *NEEDS* AXIOM TRUE It POLARISES the logic that TRUE is GOOD and FALSE is bad. 1 true 2 or(X Y) <- X 3 or(X Y) <- Y without AXIOM 1.... PROLOG cannot return the answer true
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-22 21:18 -0800 |
| Message-ID | <59f8abd5-fd9f-45d2-a110-7b6f846e1fa6@googlegroups.com> |
| In reply to | #170796 |
On Tuesday, January 23, 2018 at 4:10:51 PM UTC+11, peteolcott wrote: > http://liarparadox.org/index.php/2017/12/08/concise-formalization-of-the-liar-paradox/ > > The problem is that self-reference semantics had never been formalized before. because ........... it cant PARSE TM equivalent LOGIC! bigger( X 0 ) bigger( s(X) s(Y) ) <- bigger( X Y ) Try It! bigger( s(s(0)) s(0) ) bigger( s(0) 0 ) TRUE CONTAINS SELF-REFERENCE!
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-22 22:20 -0800 |
| Message-ID | <fafd6585-05c6-4d33-b888-8dbc4b3780a0@googlegroups.com> |
| In reply to | #170799 |
On Tuesday, January 23, 2018 at 5:10:29 PM UTC+11, Pete Olcott wrote: > On 1/22/2018 11:18 PM, > graham...@gmail.com wrote: > > > > On Tuesday, January 23, 2018 at 4:10:51 PM UTC+11, peteolcott wrote: > > > http://liarparadox.org/index.php/2017/12/08/concise-formalization-of-the-liar-paradox/ > > The problem is that self-reference semantics had never been formalized before. > > > > because ........... it cant PARSE TM equivalent LOGIC! > > > > bigger( X 0 ) > > bigger( s(X) s(Y) ) <- bigger( X Y ) > > > > Try It! > > bigger( s(s(0)) s(0) ) > > bigger( s(0) 0 ) > > TRUE > > > > CONTAINS SELF-REFERENCE! > > > > > Prolog can formalize [ Pathological self-reference ] and reject > it. That's just a TYPE MATCHER in the Prolog PRE-COMPILER > > > > equal(X, X). > > ?- equal(foo(Y), Y). > > matching a term against an > uninstantiated subterm of itself. > > > > acyclic_term(@Term) > > True if Term does not contain > cycles, i.e. can be processed recursively in finite time. > > > > ?- > acyclic_term ( equal(foo(Y), Y) > ) > > No > There is no SIMPLE way to do it. You cannot tell the difference between counting up and counting down If you can, then PARSE ...'bigger(s(X),s(Y))<-bigger(X,Y)'
[toc] | [prev] | [next] | [standalone]
Page 1 of 2 [1] 2 Next page →
Back to top | Article view | sci.logic
csiph-web