Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Newsgroups | sci.logic |
| Subject | Re: Infinitely Recursive input on HP Proofs (Final Solution?) |
| Date | 2018-02-16 23:01 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <87o9ko1qva.fsf@bsb.me.uk> (permalink) |
| References | (16 earlier) <xsKdnfETaOzJ_BvHnZ2dnUU7-TnNnZ2d@giganews.com> <87a7w93zqn.fsf@bsb.me.uk> <rf-dnQ4gZOupmxrHnZ2dnUU7-IXNnZ2d@giganews.com> <87zi481xao.fsf@bsb.me.uk> <792611e2-ca3c-4b80-8d00-e815ede4419c@googlegroups.com> |
peteolcott <peterolcott2@gmail.com> writes: > On Friday, February 16, 2018 at 2:42:36 PM UTC-6, Ben Bacarisse wrote: >> Pete Olcott <Pete@NoEmail.address> writes: >> >> > On 2/16/2018 6:06 AM, Ben Bacarisse wrote: >> >> Pete Olcott <Pete@NoEmail.address> writes: >> >> >> >>> On 2/15/2018 9:32 PM, Ben Bacarisse wrote: >> <snip> >> >>>> Every TM computation -- that's a TM and an input string on an otherwise >> >>>> blank tape -- either halts or does not halt. Can't you agree to that? >> >>> >> >>> Already did. >> >> >> >> OK, I must have missed it. (Above you talked about TMDs not TMs and you >> >> made no reference to computations.) >> > >> > Of course I did not make any reference to computations a finite string >> > just sits there unless it is executed by a UTM. >> >> So don't say you "already did" agree if you don't. I am trying to find >> out if you still disagree (as you once did) with this basic fact: >> >> Every TM computation -- that's a TM acting on an input string on an >> otherwise blank tape -- either halts or does not halt. > > If we assume that chracters of the finite string TMD has > been verified as a syntactically correct WFF in the language > of Turing Machine descriptions then yes. You refuse to agree and instead talk about "the finite string TMD" which has nothing to do with what I said. I am finding it hard to consider this an honest exchange. You could say "no, I don't accept that every TM computation either halts or does not halt", or you could just say "yes, I agree". Instead you equivocate. Oh well, not answering is the same as denying this fact. If you continue to pretend to talk about halting I shall remind people that you do not accept that every TM computation either halts or does not halt. >> > On 2/15/2018 6:15 PM, Ben Bacarisse wrote: >> > No string of the form [H^x][H^x] exists. <snip> > Self-contradictory specifications define the empty set. Yes, there are no strings that encode machines with the behaviour you require of H^x. Therefore there are no strings that encode such machines, which is what [H^x] denotes. > You are simply assuming that based on your belief that it has been > correctly proven. No, I am basing that on having understood the proof of the theorem. You, on the other hand, don't even understand the halting problem. You won't accept the plain fact that every TM computation either halts or does not halt. From that point on, there is not reason to take anything you say seriously. I am fool to read on but I did... > H transitions to H.qy if its input string is a correct TMD that > halts on its input else H transitions to H.qn That's the PO-halting problem that no one but you cares about. Your H rejects some encoded computations on the basis of them being "incorrect" rather than on the halting or otherwise of the computation. > It is unequivocally proven that semantic errors count as errors: > https://en.wikipedia.org/wiki/Colorless_green_ideas_sleep_furiously Will that be the citation for your claim that some halting instances don't have a correct yes/no answer when you write your paper for the Journal of the ACM? That wiki article is not about halting instances, of course. They are much simpler and have the property that every halting instance has a correct yes/no answer. But you deny this reality and prefer to live in a world where some TM computations don't either halt or not halt. > As soon as the semantic error is formalized syntactically then a > key gap in the inference chain is closed such that WFF(L, [Ĥx]) → FALSE > where L is the language of Turing Machine Descriptions. > > The key problems with closing this gap were: > (1) No one knew the gap existed. > (2) Everyone assumed that Rice's Theorem would make closing the gap impossible. > (3) Pathological self-reference(Olcott 2004) has never before been > sufficiently formalized. No one cares about a decider that rejects some cases for any reason other than not halting. -- Ben.
Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Newberry <newberryxy@gmail.com> - 2018-02-12 20:27 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-12 21:29 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-13 00:18 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 13:06 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-13 16:55 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 00:30 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-13 19:38 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 02:27 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) peteolcott <peterolcott2@gmail.com> - 2018-02-13 20:06 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Andy Walker <anw@cuboid.co.uk> - 2018-02-14 22:55 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-14 17:22 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-14 16:20 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) peteolcott <peterolcott2@gmail.com> - 2018-02-14 16:29 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-15 02:19 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-14 21:00 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-14 22:57 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 09:06 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-15 21:38 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 17:27 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 17:34 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 00:15 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 18:43 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 01:05 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 19:37 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 02:34 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 20:51 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 03:32 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 22:42 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 12:06 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-16 10:26 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 20:42 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) peteolcott <peterolcott2@gmail.com> - 2018-02-16 13:16 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 23:01 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-16 17:48 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-17 01:33 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-16 17:49 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-19 15:48 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-22 15:31 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-16 02:53 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Andy Walker <anw@cuboid.co.uk> - 2018-02-15 12:24 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 12:25 -0600
csiph-web