Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| Subject | Re: Necessary sequence of halt decider's inference chain |
|---|---|
| Newsgroups | sci.logic, comp.theory |
| References | <GbednTUZccrxIuDHnZ2dnUU7-b_NnZ2d@giganews.com> <a6efdffb-6e41-476a-945d-f83194cb4a41@googlegroups.com> <0a8ef82a-f27d-4632-8f1c-45cd2b472392@googlegroups.com> <87fu69c058.fsf@bsb.me.uk> |
| From | Pete Olcott <Pete@NoEmail.address> |
| Date | 2018-02-09 23:48 -0600 |
| Message-ID | <2vWdnW0EN54oGuPHnZ2dnUU7-RPNnZ2d@giganews.com> (permalink) |
Cross-posted to 2 groups.
On 2/9/2018 3:40 PM, Ben Bacarisse wrote: > peteolcott <peterolcott2@gmail.com> writes: > <snip> >> I provided this concrete example to correctly refute Ben's claim >> that there is no specific sequence of syntactic logical consequence >> required when evaluating a pair of David Hilbert finite strings in >> the language or Turing Machine descriptions. > > I could never make that claim because it's just a word salad to me. You have to actually look at the words of the original post BEFORE providing your rebuttal. > A > more honest way to contest someone's claims is by quoting their words. This is the whole thing about the sequ3ence that H must follow to evaluate the halting behavior of H^. > If you think I'm wrong, quote me and explain why. Here is why: http://www.liarparadox.org/H_evaluates_S.pdf > Don't just make stuff > up. (At the very least, if you quote what I said that makes you think I > made the above claim, I might stand a chance of finding out what that > apparently random assemblage of words means. I've long since given up > asking you to define your terms.) > This is the whole thing about the necessary sequence that H must follow to evaluate the halting behavior of H^. You said that it should be free to do anything. I proved by a concrete example that no halt decider is free at all. It is strictly bound by the syntactic logical consequence defined by the input strings within the formal language of Turing machine Descriptions. The concrete example challenges you to come up with a counter-example such that H decides [S] "ENN" without following every state transition that [S] would make. -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
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 George Greene <greeneg@email.unc.edu> - 2018-02-09 11:34 -0800
Re: Necessary sequence of halt decider's inference chain peteolcott <peterolcott2@gmail.com> - 2018-02-09 13:15 -0800
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-09 21:40 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-09 23:48 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 12:57 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-10 09:52 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-10 17:06 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-11 00:36 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-11 16:13 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-12 20:34 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 04:18 +0000
Re: Necessary sequence of halt decider's inference chain Pete Olcott <Pete@NoEmail.address> - 2018-02-13 10:03 -0600
Re: Necessary sequence of halt decider's inference chain Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 17:13 +0000
Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-13 16:59 -0800
Re: Necessary sequence of halt decider's inference chain grahamcooper7@gmail.com - 2018-02-12 21:36 -0800
csiph-web