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: Necessary sequence of halt decider's inference chain |
| Date | 2018-02-10 16:44 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <877erkoku0.fsf@bsb.me.uk> (permalink) |
| References | <GbednTUZccrxIuDHnZ2dnUU7-b_NnZ2d@giganews.com> <959bc654-e795-41a3-827f-fb0378bf7beb@googlegroups.com> <87y3k1ni4w.fsf@bsb.me.uk> <r8udnZXUH97lkeLHnZ2dnUU7-UXNnZ2d@giganews.com> |
Cross-posted to 2 groups.
Pete Olcott <Pete@NoEmail.address> writes: > On 2/10/2018 6:28 AM, Ben Bacarisse wrote: >> grahamcooper7@gmail.com writes: >> <snip> >>> Halt is not a LANGUAGE decider, it is a PROGRAM decider. >> >> I don't usually reply to your posts because I can't understand the >> fractured comments, but this one looks plain wrong. All deciders are >> language deciders. A halt decider is a decider for the language >> (i.e. set of strings) that encode halting TM computations. > > Yes and furthermore the halt decider evaluates its input as a syntactic > logical consequence (formal proof) in the language of Turing Machine > Descriptions from a finite string pair to its final states of H.qy or > H.qn. Who knows? One day you might decide to write that in terms that you have not made up. A halt decider must determine the halting or otherwise of the input. If that is what "evaluates its input as a syntactic logical consequence (formal proof) in the language of Turing Machine Descriptions from a finite string pair to its final states of H.qy or H.qn" means then you are correct. If those words are the ones that allow you to deny that H always transitions from H.q0 to either H.qy or H.qn then you are wrong. Asking cranks to decode the made up language they use to hide what they means is almost always a waste of time. You are either right, and the proof follows immediately, or you are wrong. 100 more posts trying to get you explain which is the seems like a daunting prospect. > The decision answers this question: > Does the finite string pair represent a correct TM that would halt on > its input? Hey, yes, a correct remark! > A transition to H.qn means > (1) Not a TM > (2) Not a correct TM > (3) A Correct TM that would not halt Yes! Now explain H.qy and attach those remarks to the lines you keep writing (and not understanding) you will have the start of the proof -- the specification of H. It's a bit wordy, but it's progress. -- Ben.
Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-09 22:20 -0800
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 12:28 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-10 09:15 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 16:44 +0000
Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-10 15:16 -0800
Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-10 15:27 -0800
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-11 00:20 +0000
Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-10 17:21 -0800
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-11 01:38 +0000
csiph-web