Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Newsgroups | sci.logic, comp.theory |
| Subject | Re: Infinitely Recursive input on HP Proofs (Final Solution?) |
| Date | 2018-02-17 01:33 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <87606w1jt1.fsf@bsb.me.uk> (permalink) |
| References | (16 earlier) <rf-dnQ4gZOupmxrHnZ2dnUU7-IXNnZ2d@giganews.com> <87zi481xao.fsf@bsb.me.uk> <792611e2-ca3c-4b80-8d00-e815ede4419c@googlegroups.com> <87o9ko1qva.fsf@bsb.me.uk> <tuKdnU7te_VQ8BrHnZ2dnUU7-LnNnZ2d@giganews.com> |
Cross-posted to 2 groups.
Pete Olcott <Pete@NoEmail.address> writes: > On 2/16/2018 5:01 PM, Ben Bacarisse wrote: <snip> >> 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. > > Every TM computation halts or fails to halt. Great. Do you also accept that every finite string either encodes a TM computation or it does not? The encoding has to be agreed, of course, but something simple like the binary bits of the ASCII characters used to write out the transitions, the input string, and the number of the final (AKA accepting) state. Here's a computation: 0,1R1>1;1,0R0>0/1/101 though the actual string is the zeros and ones of those ASCII bytes There are two states (0 and 1) and two transitions. From state 0 a tape symbol of 1 cases a move right, a write of 1 to the tape, and the TM enters state 1. From state 1 seeing a 0 cases the head to move right, a 0 to be written and the machine goes to state 0. The final state is state 1, and the input for this computation is 101. This computation halts (and, as it happens, it "accepts" since it halts in state 1). This: Then hate me when thou wilt; if ever, now; is not a TM computation and neither are 0,1R1>1;1,0R0>01/101 nor 0,1R1>1;11,0R0>0/1/101 Other non-computations include 0/1 sequences that are not a multiple of 8 long or any that include anything but the ASCII characters 0 1 2 3 4 5 6 7 8 9 L R > , / ; So, we have a simple encoding and a simple question: does every finite string of bits either encode a TM computation or not? >>>>> 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. > > That is not true and no one in the world can prove it. It's been proven. Lots of times. In lots of ways. >>> 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. > > Yet you are not augmenting this understanding with my qualifications. > You are simply assuming away all of my objections. Your current qualification is to claim that the "halting problem" is something other than the subject of the theorem. Until you drop that change and accept what the theorem is about (halting and not PO-halting), nothing you say has any bearing on it. <snip> >> No one cares about a decider that rejects some cases for any reason >> other than not halting. > > That is why millions of math proofs remain incorrect. Semantics > cannot be ignored. That a nice clear statement that you are not talking about the halting theorem. In your view the theorem is about the wrong thing -- purely syntactic halting. Why you can't just accept it I don't know since it's not a theorem about the problem you (and you alone) care about. -- 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