Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| Subject | Re: My augmentation to foundationalism |
|---|---|
| Newsgroups | comp.theory |
| References | (6 earlier) <NL6dnUOz-72w6fH8nZ2dnUU7-YmdnZ2d@giganews.com> <No%aJ.28981$Im6.16021@fx09.iad> <_ZidncJIB8ExG_H8nZ2dnUU7-f3NnZ2d@giganews.com> <ski79v$jfm$1@dont-email.me> <TISdnQuXtoYIEfD8nZ2dnUU7-WfNnZ2d@giganews.com> |
| From | Richard Damon <Richard@Damon-Family.org> |
| Message-ID | <%ApbJ.4$Lu3.0@fx43.iad> (permalink) |
| Organization | Forte - www.forteinc.com |
| Date | 2021-10-18 21:56 -0400 |
On 10/18/21 11:02 AM, olcott wrote: > On 10/17/2021 5:15 PM, Richard Damon wrote: >> On 10/17/21 4:25 PM, olcott wrote: >>> On 10/17/2021 3:08 PM, Richard Damon wrote: >>>> On 10/17/21 3:06 PM, olcott wrote: >>>>> >>>>> I will put it in simpler terms. >>>>> The only way that we can know with 100% perfectly complete logical >>>>> certainty that an expression of language is true is when its truth >>>>> can be totally verified entirely on the basis of its meaning. >>>>> >>>>> This does provide the foundation of all analytical truth. >>>> >>>> But the flaw is that not all analytical truths are knowable (in some >>>> fields). >>>> >>> >>> Expressions of language that have unknown truth values are simply >>> excluded from the body of knowledge. >> >> They may be outside 'knowledge', but may still be statements of 'truth >> value' in the language. >> >> SOME bodies exclude the discussion of such items, but others do not. >> >> Both are valid. Mathematics, for one, allows the discussion of >> statements that might not be provable. >> >>> >>>> Math is built on logical definitions that allow for statements to >>>> exist that we know must be either True of False, but that we are >>>> unable to actually 'prove' by analytical proof which it is. >>>> >>> >>> Any expression of language that cannot be proven true is necessarily >>> untrue, yet possibly also not false. Some expressions of language are >>> simply not bearers of truth values. >> >> WRONG. >> >> Let me add, can you PROVE it, if not, by your rules you can't make it. >> >> Counter Example. >> >> All Computation, for example, which might be expressed as a pair of a >> Turing Machine and an input, will BY DEFINITION either Halt or not, so >> the halt status of a Computation is a bearer of a truth value. >> > > I went over and over this with Ben for many years. If we assume that the > finite string is a syntactically correct TM description P > > then we know that when P is simulated on its input P a simulating halt > decider H(P,P) that this simulation will either reach its final state of > P (WHETHER OR NOT H ABORTS THIS SIMULATION) or not. WRONG. UNSOUND LOGIC. FAIL. Try to ACTUAL prove it. I have pointed out MANY errors in your arguement which you have stated you haven't read, therefore YOU have failed at YOUR responsibility of proof. > >> There DO exist computations for which we can not prove if they will be >> able to complete in a finite amount of time or not. >> > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > If the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its > final state then when Ĥ.qx transitions to Ĥ.qn it is necessarily correct. WRONG. > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > >>> >>>> Or Knowledge requires Truth to exist, but Truth does NOT require >>>> Knowledge to be available. >>>> >>> >>> >> > You fail to prove your claims, in a large part, because you don't really understand what you claim. Your refer to claissical proofs, and say you have counted them, when you have shown that you don't even understand that language that they are written in. As you have said, the mean of the words is important. Until you can show that you actually KNOW the meaning of the words, as used by the orignal proofs that you are claiming to have countered. Important note, you claim to be using 'First Principles', one big limitation of 'First Principles' is that if you are working on what someone else has said, the prerequisite to applying a First Principle approach is to actually KNOW what the principles THAT PERSON was using, you can NOT easily just 'discover' this by independent research, that tends to end up with your definitions differing from what you are trying to apply it to, and thus not really applicable. Until you really understand what a Computation is, and how Turing Machine actually work nothing you say is going to make any sense. Your 'claim' that code 'x' is the equivalence to Turing Machine 'y' is meaningless when you have made it clear that you don't really understand what a Turing Machine is, or what a Computation is (which is the basic theory behind Turing Machines). That is like a man blind from birth saying he know the real difference between scarlet and crimson, it isn't in his realm of understanding. You have blinded yourself to this area of Theory because you refuse to comprehend the basic aspects of the field. I think you are unable to understand things that are this abstract, as your mindset seem to be stuck in things that are concrete.
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 09:23 -0500
Re: My augmentation to foundationalism André G. Isaak <agisaak@gm.invalid> - 2021-10-17 10:20 -0600
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 12:07 -0500
Re: My augmentation to foundationalism André G. Isaak <agisaak@gm.invalid> - 2021-10-17 11:50 -0600
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 12:57 -0500
Re: My augmentation to foundationalism André G. Isaak <agisaak@gm.invalid> - 2021-10-17 12:44 -0600
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 14:06 -0500
Re: My augmentation to foundationalism André G. Isaak <agisaak@gm.invalid> - 2021-10-17 13:31 -0600
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-17 16:08 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 15:25 -0500
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-17 17:01 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-18 09:55 -0500
Re: My augmentation to foundationalism Jim Burns <james.g.burns@att.net> - 2021-10-18 12:12 -0400
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-18 21:42 -0400
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-18 22:48 -0400
Re: My augmentation to foundationalism Richard Damon <news.x.richarddamon@xoxy.net> - 2021-10-17 18:15 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-18 10:02 -0500
Re: My augmentation to foundationalism Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-19 00:02 +0100
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-18 21:56 -0400
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-17 13:22 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 13:41 -0500
Re: My augmentation to foundationalism Richard Damon <Richard@Damon-Family.org> - 2021-10-17 15:02 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 14:12 -0500
Re: My augmentation to foundationalism Richard Damon <news.x.richarddamon@xoxy.net> - 2021-10-17 15:37 -0400
Re: My augmentation to foundationalism Jeff Barnett <jbb@notatt.com> - 2021-10-17 14:01 -0600
Re: My augmentation to foundationalism Jeff Barnett <jbb@notatt.com> - 2021-10-17 17:43 -0600
Re: My augmentation to foundationalism Jim Burns <james.g.burns@att.net> - 2021-10-17 13:44 -0400
Re: My augmentation to foundationalism olcott <NoOne@NoWhere.com> - 2021-10-17 12:55 -0500
csiph-web