Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login

Message-ID:  

<Overfiend> penis jokes are okay in mixed company. VMS is NOT!!!


devel / comp.theory / Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

SubjectAuthor
* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
+- Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
+* Concise refutation of halting problem proofs V62 [ Linz Proof ]dklei...@gmail.com
|+- Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|`* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
| `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|  `* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|   `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|    `* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|     `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|      `* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|       `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|        `* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|         `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|          `* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|           `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|            `* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|             +* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|             |`* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|             | `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|             |  `* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|             |   `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|             |    +* Concise refutation of halting problem proofs V62 [ Linz Proof ]Python
|             |    |+* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|             |    ||`- Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|             |    |`- Concise refutation of halting problem proofs V62 [ Linz Proof ]B.H.
|             |    `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|             |     `* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|             |      `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|             |       `* Concise refutation of halting problem proofs V62 [ Linz Proof ]olcott
|             |        `* Concise refutation of halting problem proofs V62 [ Linz Proof ]Richard Damon
|             |         `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |          +* Concise refutation of halting problem proofs V62 [ misconceptionsPython
|             |          |`* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |          | `- Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |          `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |           `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |            `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |             `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |              `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |               `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |                `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |                 `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |                  `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |                   `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |                    `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |                     `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |                      `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |                       `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |                        `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |                         `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |                          `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |                           `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |                            `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |                             `* Concise refutation of halting problem proofs V62 [ misconceptionsolcott
|             |                              `* Concise refutation of halting problem proofs V62 [ misconceptionsRichard Damon
|             |                               `* Concise refutation of halting problem proofs V62 [ self-evident ]olcott
|             |                                `* Concise refutation of halting problem proofs V62 [ self-evident ]Richard Damon
|             |                                 `* Concise refutation of halting problem proofs V62 [ self-evident ]olcott
|             |                                  `* Concise refutation of halting problem proofs V62 [ self-evident ]Richard Damon
|             |                                   `- Concise refutation of halting problem proofs V62 [ self-evident ]olcott
|             `* Concise refutation of halting problem proofs V62 [ Linz Proof ]( application to olcott
|              `- Concise refutation of halting problem proofs V62 [ Linz Proof ](Richard Damon
`* Concise refutation of halting problem proofs V62 [ self-evident ]olcott
 +* Concise refutation of halting problem proofs V62 [ self-evident ]Richard Damon
 |`* Concise refutation of halting problem proofs V62 [ self-evident ]olcott
 | `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |  `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |   `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |    `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |     `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |      `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |       `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |        `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |         `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |          `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |           `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |            `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |             `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |              `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |               `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |                `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |                 `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |                  `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |                   `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |                    `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |                     `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |                      `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |                       `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |                        `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 |                         `* Concise refutation of halting problem proofs V62 [ self-evidentRichard Damon
 |                          +* Concise refutation of halting problem proofs V62 [ self-evidentMr Flibble
 |                          |+* Concise refutation of halting problem proofs V62 [ self-evidentPython
 |                          ||`* Concise refutation of halting problem proofs V62 [ self-evidentMr Flibble
 |                          || `- Concise refutation of halting problem proofs V62 [ self-evident ](typo)wij
 |                          |`* Concise refutation of halting problem proofs V62 [ my legacy ]olcott
 |                          | +* Concise refutation of halting problem proofs V62 [ my legacy ]Mr Flibble
 |                          | |+* Concise refutation of halting problem proofs V62 [ my legacy ]olcott
 |                          | ||`- Concise refutation of halting problem proofs V62 [ my legacy ]Richard Damon
 |                          | |`- Concise refutation of halting problem proofs V62 [ my legacy ]Richard Damon
 |                          | +* Concise refutation of halting problem proofs V62 [ my legacy ]Mr Flibble
 |                          | +* Concise refutation of halting problem proofs V62 [ my legacy ]Python
 |                          | `* Concise refutation of halting problem proofs V62 [ my legacy ]Richard Damon
 |                          `* Concise refutation of halting problem proofs V62 [ self-evidentolcott
 `- Concise refutation of halting problem proofs V62 [ self-evident ]Richard Damon

Pages:1234567
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<7oQPJ.70759$H_t7.7988@fx40.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26704&group=comp.theory#26704

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!newsreader4.netcologne.de!news.netcologne.de!peer01.ams1!peer.ams1.xlned.com!news.xlned.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx40.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<NZednWhW8to3XpD_nZ2dnUU7-VOdnZ2d@giganews.com>
<7IjPJ.12295$XFM9.7011@fx18.iad>
<XICdnT_q4aIVV5D_nZ2dnUU7-dvNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <suoj2d$hd6$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 303
Message-ID: <7oQPJ.70759$H_t7.7988@fx40.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 12:08:20 -0500
X-Received-Bytes: 14994
 by: Richard Damon - Fri, 18 Feb 2022 17:08 UTC

On 2/18/22 11:55 AM, olcott wrote:
> On 2/18/2022 10:38 AM, Richard Damon wrote:
>> On 2/18/22 11:02 AM, olcott wrote:
>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>
>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>> olcott wrote:
>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>> simulation
>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>> correctly
>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right definitions.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal and not
>>>>>>>>>>>>>>>>>>> the windows
>>>>>>>>>>>>>>>>>>> of an office building. It is all in the simple
>>>>>>>>>>>>>>>>>>> meaning of the
>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You just don't understand the difference betweeen
>>>>>>>>>>>>>>>>>> FORMAL logic
>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Halting problem undecidability and infinitely nested
>>>>>>>>>>>>>>>>>>> simulation
>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have proven
>>>>>>>>>>>>>>>>>> something,
>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to agree
>>>>>>>>>>>>>>>>>> with you, you
>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> I think that you understand this deep in your heart,
>>>>>>>>>>>>>>>>>> which is why
>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that don't
>>>>>>>>>>>>>>>>>> require peer
>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>> input to prevent its infinite simulation correctly
>>>>>>>>>>>>>>>>> transitions to
>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently true.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>> A simulating halt decider that must abort the simulation
>>>>>>>>>>>>>>>> of its
>>>>>>>>>>>>>>>> input to prevent its infinite simulation where this
>>>>>>>>>>>>>>>> input halts on
>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> You have shown the H must abort its simulation of H" or H
>>>>>>>>>>>>>>> will never
>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H <H"> we see
>>>>>>>>>>>>>>> that we
>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have said that
>>>>>>>>>>>>>>> H has
>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a non-halting
>>>>>>>>>>>>>>> computation, and thus aborts its simulation of its input
>>>>>>>>>>>>>>> and goes to
>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim does not
>>>>>>>>>>>>>>> exist.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes to H.Qn
>>>>>>>>>>>>>>> for this
>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple running
>>>>>>>>>>>>>>> opf H" applied
>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown that
>>>>>>>>>>>>>>> BECAUSE H <H">
>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to H".Qn and
>>>>>>>>>>>>>>> Halt, and
>>>>>>>>>>>>>>> thus H has violated its requirements, and thus is not
>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> You have just shown that you don't understand anything
>>>>>>>>>>>>>>> about formal
>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> A claim that because someone hasn't produced a counter
>>>>>>>>>>>>>>> example means
>>>>>>>>>>>>>>> your statement must be true is just plain unsond logic.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of the
>>>>>>>>>>>>>>> words' and not
>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions being
>>>>>>>>>>>>>>> used to make
>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical arguments,
>>>>>>>>>>>>>>> but only
>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> All you have done is PROVED that you don't understand
>>>>>>>>>>>>>>> what you are
>>>>>>>>>>>>>>> doing, and you don't understand how to use formal logic.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> This is sort of understandable since you have revealed
>>>>>>>>>>>>>>> that you goal
>>>>>>>>>>>>>>> is just to try to establish an Epistemological statement,
>>>>>>>>>>>>>>> which isn't
>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy, so if
>>>>>>>>>>>>>>> that is the
>>>>>>>>>>>>>>> field you are used to talking in, you just don't have a
>>>>>>>>>>>>>>> background to
>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> So, you have just FAILED to understand what you need to
>>>>>>>>>>>>>>> do to show
>>>>>>>>>>>>>>> something in COmputation Theory, which also shows that
>>>>>>>>>>>>>>> you don't
>>>>>>>>>>>>>>> really understand Epistimology, as you clearly don't
>>>>>>>>>>>>>>> undstand the
>>>>>>>>>>>>>>> concept of the Knowing of the Truth of Propositions, the
>>>>>>>>>>>>>>> idea of
>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>> Have you really got nothing better to do with your time?
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> According to medical science I have terminal cancer with
>>>>>>>>>>>>> little time left. I intend my HP proof rebuttal to be my
>>>>>>>>>>>>> legacy.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>> self-reference of the halting problem proofs makes these
>>>>>>>>>>>>> proof illegitimate I have no idea why you would be
>>>>>>>>>>>>> reversing course now.
>>>>>>>>>>>>
>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be illegitimate.
>>>>>>>>>>>
>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>
>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>
>>>>>>>>>> You are wasting your time acting as a crank and looking for
>>>>>>>>>> support
>>>>>>>>>> from other cranks.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> I have boiled the error of the incompleteness theorem down to a
>>>>>>>>> single simple sentence. Try and find a single error of
>>>>>>>>> substance in my paper:
>>>>>>>>>
>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take a moron.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Your logic is incorrect because you assume your conclusion as a
>>>>>>>> premise.
>>>>>>>>
>>>>>>>> You use the WRONG definition of Truth, and assume that Truth can
>>>>>>>> only be something that is proven, and then from that try to
>>>>>>>> prove that Truth is only something that csn be proven.
>>>>>>>>
>>>>>>>> This is incorrect, and thus your whole arguement is invalid.
>>>>>>>>
>>>>>>>> For example, in mathematics, there are a number of statements
>>>>>>>> that must either be True of False, there is no possible middle
>>>>>>>> ground, but these statements have not been shown to be provable
>>>>>>>> or disprovable. An example of this is the 3x+1 problem.
>>>>>>>
>>>>>>> Every expression of language does not count as true until after
>>>>>>> it has been proven. There are only two ways to determine if an
>>>>>>> analytical expression of language is true. It is an axiom that
>>>>>>> assigned the value of Boolean true. It is derived by sound
>>>>>>> deduction that is ultimately anchored in axioms.
>>>>>>>
>>>>>>
>>>>>> Can you PROVE that statement? or is this just a axiom you need to
>>>>>> assume.
>>>>>
>>>>> Analytical expressions of language are verified to be true entirely
>>>>> on the basis of their meaning.
>>>>
>>>> WRONG. Formal;
>>> That is a stipulated definition just like a "given" in geometry.
>>> In these cases all disagreement is simply incorrect.
>>>
>>> If I say that a cat is an animal and you disagree and say that a cat
>>> is the windows of an office building you are simply wrong.
>>>
>>
>> Except that you can't 'stipulate' a definition for something already
>> defined in the system, especially to something wrong. That violates
>> the rules of Formal Logic.
> (1) That is already what analytical truth means:
> "Analytic propositions are true or not true solely by virtue of their
> meaning"
> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26705&group=comp.theory#26705

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 11:18:53 -0600
Date: Fri, 18 Feb 2022 11:18:51 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<NZednWhW8to3XpD_nZ2dnUU7-VOdnZ2d@giganews.com>
<7IjPJ.12295$XFM9.7011@fx18.iad>
<XICdnT_q4aIVV5D_nZ2dnUU7-dvNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
Followup-To: comp.theory
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <7oQPJ.70759$H_t7.7988@fx40.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
Lines: 276
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-2TLxajI9WAVsPanXjh46b/rwWLduJ6HA9lX4i9V+JApO0JfY73pohjy3RYghOuh4n03bVUHg9g3+FUp!BU0sbfl7Velerw+Mw+kdy9rySmDgyeT5elD1Gg4RFWg8MV+mR1yyEjkIAZ9nhDOtC7eljB3eXw==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 14597
 by: olcott - Fri, 18 Feb 2022 17:18 UTC

On 2/18/2022 11:08 AM, Richard Damon wrote:
>
> On 2/18/22 11:55 AM, olcott wrote:
>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>> On 2/18/22 11:02 AM, olcott wrote:
>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>
>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>> simulation
>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>> correctly
>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right definitions.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal and not
>>>>>>>>>>>>>>>>>>>> the windows
>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the simple
>>>>>>>>>>>>>>>>>>>> meaning of the
>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You just don't understand the difference betweeen
>>>>>>>>>>>>>>>>>>> FORMAL logic
>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and infinitely nested
>>>>>>>>>>>>>>>>>>>> simulation
>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have proven
>>>>>>>>>>>>>>>>>>> something,
>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to agree
>>>>>>>>>>>>>>>>>>> with you, you
>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> I think that you understand this deep in your heart,
>>>>>>>>>>>>>>>>>>> which is why
>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that don't
>>>>>>>>>>>>>>>>>>> require peer
>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation correctly
>>>>>>>>>>>>>>>>>> transitions to
>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently true.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where this
>>>>>>>>>>>>>>>>> input halts on
>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> You have shown the H must abort its simulation of H" or
>>>>>>>>>>>>>>>> H will never
>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H <H"> we
>>>>>>>>>>>>>>>> see that we
>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have said that
>>>>>>>>>>>>>>>> H has
>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a non-halting
>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of its input
>>>>>>>>>>>>>>>> and goes to
>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim does not
>>>>>>>>>>>>>>>> exist.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes to H.Qn
>>>>>>>>>>>>>>>> for this
>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple running
>>>>>>>>>>>>>>>> opf H" applied
>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown that
>>>>>>>>>>>>>>>> BECAUSE H <H">
>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to H".Qn and
>>>>>>>>>>>>>>>> Halt, and
>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus is not
>>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> You have just shown that you don't understand anything
>>>>>>>>>>>>>>>> about formal
>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a counter
>>>>>>>>>>>>>>>> example means
>>>>>>>>>>>>>>>> your statement must be true is just plain unsond logic.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of the
>>>>>>>>>>>>>>>> words' and not
>>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions being
>>>>>>>>>>>>>>>> used to make
>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical arguments,
>>>>>>>>>>>>>>>> but only
>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> All you have done is PROVED that you don't understand
>>>>>>>>>>>>>>>> what you are
>>>>>>>>>>>>>>>> doing, and you don't understand how to use formal logic.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> This is sort of understandable since you have revealed
>>>>>>>>>>>>>>>> that you goal
>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy, so if
>>>>>>>>>>>>>>>> that is the
>>>>>>>>>>>>>>>> field you are used to talking in, you just don't have a
>>>>>>>>>>>>>>>> background to
>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you need to
>>>>>>>>>>>>>>>> do to show
>>>>>>>>>>>>>>>> something in COmputation Theory, which also shows that
>>>>>>>>>>>>>>>> you don't
>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly don't
>>>>>>>>>>>>>>>> undstand the
>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of Propositions, the
>>>>>>>>>>>>>>>> idea of
>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>> Have you really got nothing better to do with your time?
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> According to medical science I have terminal cancer with
>>>>>>>>>>>>>> little time left. I intend my HP proof rebuttal to be my
>>>>>>>>>>>>>> legacy.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>> self-reference of the halting problem proofs makes these
>>>>>>>>>>>>>> proof illegitimate I have no idea why you would be
>>>>>>>>>>>>>> reversing course now.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be illegitimate.
>>>>>>>>>>>>
>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>
>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>
>>>>>>>>>>> You are wasting your time acting as a crank and looking for
>>>>>>>>>>> support
>>>>>>>>>>> from other cranks.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> I have boiled the error of the incompleteness theorem down to
>>>>>>>>>> a single simple sentence. Try and find a single error of
>>>>>>>>>> substance in my paper:
>>>>>>>>>>
>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take a moron.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Your logic is incorrect because you assume your conclusion as a
>>>>>>>>> premise.
>>>>>>>>>
>>>>>>>>> You use the WRONG definition of Truth, and assume that Truth
>>>>>>>>> can only be something that is proven, and then from that try to
>>>>>>>>> prove that Truth is only something that csn be proven.
>>>>>>>>>
>>>>>>>>> This is incorrect, and thus your whole arguement is invalid.
>>>>>>>>>
>>>>>>>>> For example, in mathematics, there are a number of statements
>>>>>>>>> that must either be True of False, there is no possible middle
>>>>>>>>> ground, but these statements have not been shown to be provable
>>>>>>>>> or disprovable. An example of this is the 3x+1 problem.
>>>>>>>>
>>>>>>>> Every expression of language does not count as true until after
>>>>>>>> it has been proven. There are only two ways to determine if an
>>>>>>>> analytical expression of language is true. It is an axiom that
>>>>>>>> assigned the value of Boolean true. It is derived by sound
>>>>>>>> deduction that is ultimately anchored in axioms.
>>>>>>>>
>>>>>>>
>>>>>>> Can you PROVE that statement? or is this just a axiom you need to
>>>>>>> assume.
>>>>>>
>>>>>> Analytical expressions of language are verified to be true
>>>>>> entirely on the basis of their meaning.
>>>>>
>>>>> WRONG. Formal;
>>>> That is a stipulated definition just like a "given" in geometry.
>>>> In these cases all disagreement is simply incorrect.
>>>>
>>>> If I say that a cat is an animal and you disagree and say that a cat
>>>> is the windows of an office building you are simply wrong.
>>>>
>>>
>>> Except that you can't 'stipulate' a definition for something already
>>> defined in the system, especially to something wrong. That violates
>>> the rules of Formal Logic.
>> (1) That is already what analytical truth means:
>> "Analytic propositions are true or not true solely by virtue of their
>> meaning"
>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>
> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
logic is a branch of philosophy


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<H_QPJ.15490$GjY3.14197@fx01.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26706&group=comp.theory#26706

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!feeder1.feed.usenet.farm!feed.usenet.farm!peer01.ams4!peer.am4.highwinds-media.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx01.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<7IjPJ.12295$XFM9.7011@fx18.iad>
<XICdnT_q4aIVV5D_nZ2dnUU7-dvNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 298
Message-ID: <H_QPJ.15490$GjY3.14197@fx01.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 12:49:29 -0500
X-Received-Bytes: 15854
 by: Richard Damon - Fri, 18 Feb 2022 17:49 UTC

On 2/18/22 12:18 PM, olcott wrote:
> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>
>> On 2/18/22 11:55 AM, olcott wrote:
>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>
>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>>> simulation
>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>> correctly
>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right definitions.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal and
>>>>>>>>>>>>>>>>>>>>> not the windows
>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the simple
>>>>>>>>>>>>>>>>>>>>> meaning of the
>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> You just don't understand the difference betweeen
>>>>>>>>>>>>>>>>>>>> FORMAL logic
>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and infinitely
>>>>>>>>>>>>>>>>>>>>> nested simulation
>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have proven
>>>>>>>>>>>>>>>>>>>> something,
>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to agree
>>>>>>>>>>>>>>>>>>>> with you, you
>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in your heart,
>>>>>>>>>>>>>>>>>>>> which is why
>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that don't
>>>>>>>>>>>>>>>>>>>> require peer
>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation correctly
>>>>>>>>>>>>>>>>>>> transitions to
>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently true.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that I
>>>>>>>>>>>>>>>>>>> am correct.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where this
>>>>>>>>>>>>>>>>>> input halts on
>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation of H" or
>>>>>>>>>>>>>>>>> H will never
>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H <H"> we
>>>>>>>>>>>>>>>>> see that we
>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have said
>>>>>>>>>>>>>>>>> that H has
>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a non-halting
>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of its
>>>>>>>>>>>>>>>>> input and goes to
>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim does
>>>>>>>>>>>>>>>>> not exist.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes to H.Qn
>>>>>>>>>>>>>>>>> for this
>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple running
>>>>>>>>>>>>>>>>> opf H" applied
>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown that
>>>>>>>>>>>>>>>>> BECAUSE H <H">
>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to H".Qn
>>>>>>>>>>>>>>>>> and Halt, and
>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus is not
>>>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You have just shown that you don't understand anything
>>>>>>>>>>>>>>>>> about formal
>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a counter
>>>>>>>>>>>>>>>>> example means
>>>>>>>>>>>>>>>>> your statement must be true is just plain unsond logic.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of the
>>>>>>>>>>>>>>>>> words' and not
>>>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions being
>>>>>>>>>>>>>>>>> used to make
>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical arguments,
>>>>>>>>>>>>>>>>> but only
>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't understand
>>>>>>>>>>>>>>>>> what you are
>>>>>>>>>>>>>>>>> doing, and you don't understand how to use formal logic.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> This is sort of understandable since you have revealed
>>>>>>>>>>>>>>>>> that you goal
>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy, so if
>>>>>>>>>>>>>>>>> that is the
>>>>>>>>>>>>>>>>> field you are used to talking in, you just don't have a
>>>>>>>>>>>>>>>>> background to
>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you need to
>>>>>>>>>>>>>>>>> do to show
>>>>>>>>>>>>>>>>> something in COmputation Theory, which also shows that
>>>>>>>>>>>>>>>>> you don't
>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly don't
>>>>>>>>>>>>>>>>> undstand the
>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of Propositions,
>>>>>>>>>>>>>>>>> the idea of
>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>> Have you really got nothing better to do with your time?
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> According to medical science I have terminal cancer with
>>>>>>>>>>>>>>> little time left. I intend my HP proof rebuttal to be my
>>>>>>>>>>>>>>> legacy.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>> self-reference of the halting problem proofs makes these
>>>>>>>>>>>>>>> proof illegitimate I have no idea why you would be
>>>>>>>>>>>>>>> reversing course now.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be illegitimate.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>
>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>
>>>>>>>>>>>> You are wasting your time acting as a crank and looking for
>>>>>>>>>>>> support
>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> I have boiled the error of the incompleteness theorem down to
>>>>>>>>>>> a single simple sentence. Try and find a single error of
>>>>>>>>>>> substance in my paper:
>>>>>>>>>>>
>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take a moron.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Your logic is incorrect because you assume your conclusion as
>>>>>>>>>> a premise.
>>>>>>>>>>
>>>>>>>>>> You use the WRONG definition of Truth, and assume that Truth
>>>>>>>>>> can only be something that is proven, and then from that try
>>>>>>>>>> to prove that Truth is only something that csn be proven.
>>>>>>>>>>
>>>>>>>>>> This is incorrect, and thus your whole arguement is invalid.
>>>>>>>>>>
>>>>>>>>>> For example, in mathematics, there are a number of statements
>>>>>>>>>> that must either be True of False, there is no possible middle
>>>>>>>>>> ground, but these statements have not been shown to be
>>>>>>>>>> provable or disprovable. An example of this is the 3x+1 problem.
>>>>>>>>>
>>>>>>>>> Every expression of language does not count as true until after
>>>>>>>>> it has been proven. There are only two ways to determine if an
>>>>>>>>> analytical expression of language is true. It is an axiom that
>>>>>>>>> assigned the value of Boolean true. It is derived by sound
>>>>>>>>> deduction that is ultimately anchored in axioms.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Can you PROVE that statement? or is this just a axiom you need
>>>>>>>> to assume.
>>>>>>>
>>>>>>> Analytical expressions of language are verified to be true
>>>>>>> entirely on the basis of their meaning.
>>>>>>
>>>>>> WRONG. Formal;
>>>>> That is a stipulated definition just like a "given" in geometry.
>>>>> In these cases all disagreement is simply incorrect.
>>>>>
>>>>> If I say that a cat is an animal and you disagree and say that a
>>>>> cat is the windows of an office building you are simply wrong.
>>>>>
>>>>
>>>> Except that you can't 'stipulate' a definition for something already
>>>> defined in the system, especially to something wrong. That violates
>>>> the rules of Formal Logic.
>>> (1) That is already what analytical truth means:
>>> "Analytic propositions are true or not true solely by virtue of their
>>> meaning"
>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>
>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
> logic is a branch of philosophy
>
> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>
>


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26708&group=comp.theory#26708

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 12:41:19 -0600
Date: Fri, 18 Feb 2022 12:41:16 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
From: NoO...@NoWhere.com (olcott)
Followup-To: comp.theory
In-Reply-To: <H_QPJ.15490$GjY3.14197@fx01.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
Lines: 297
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-ELDBdb08xSXUBrLmetX4cd2YRHcK4EZjVpJy8QpNwkNb5ldhv8XI6rtsgp/O//86SJTqNPKjdrbAsQq!R8nJXyNLYC+8WjzV9QlZ0yqb2rgK6n1tCFONu2kjYT8fSWJFddS0VIti990IY9ODX6uEZ+Ghrw==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 15874
 by: olcott - Fri, 18 Feb 2022 18:41 UTC

On 2/18/2022 11:49 AM, Richard Damon wrote:
> On 2/18/22 12:18 PM, olcott wrote:
>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>
>>> On 2/18/22 11:55 AM, olcott wrote:
>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>
>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>> the simulation
>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>> correctly
>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right definitions.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal and
>>>>>>>>>>>>>>>>>>>>>> not the windows
>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the simple
>>>>>>>>>>>>>>>>>>>>>> meaning of the
>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference betweeen
>>>>>>>>>>>>>>>>>>>>> FORMAL logic
>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and infinitely
>>>>>>>>>>>>>>>>>>>>>> nested simulation
>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have
>>>>>>>>>>>>>>>>>>>>> proven something,
>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to agree
>>>>>>>>>>>>>>>>>>>>> with you, you
>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in your
>>>>>>>>>>>>>>>>>>>>> heart, which is why
>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that don't
>>>>>>>>>>>>>>>>>>>>> require peer
>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation correctly
>>>>>>>>>>>>>>>>>>>> transitions to
>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently true.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where this
>>>>>>>>>>>>>>>>>>> input halts on
>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation of H"
>>>>>>>>>>>>>>>>>> or H will never
>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H <H"> we
>>>>>>>>>>>>>>>>>> see that we
>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have said
>>>>>>>>>>>>>>>>>> that H has
>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a
>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of its
>>>>>>>>>>>>>>>>>> input and goes to
>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim does
>>>>>>>>>>>>>>>>>> not exist.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes to H.Qn
>>>>>>>>>>>>>>>>>> for this
>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple running
>>>>>>>>>>>>>>>>>> opf H" applied
>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown that
>>>>>>>>>>>>>>>>>> BECAUSE H <H">
>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to H".Qn
>>>>>>>>>>>>>>>>>> and Halt, and
>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus is not
>>>>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You have just shown that you don't understand anything
>>>>>>>>>>>>>>>>>> about formal
>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a counter
>>>>>>>>>>>>>>>>>> example means
>>>>>>>>>>>>>>>>>> your statement must be true is just plain unsond logic.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of the
>>>>>>>>>>>>>>>>>> words' and not
>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions being
>>>>>>>>>>>>>>>>>> used to make
>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't understand
>>>>>>>>>>>>>>>>>> what you are
>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use formal logic.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> This is sort of understandable since you have revealed
>>>>>>>>>>>>>>>>>> that you goal
>>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy, so if
>>>>>>>>>>>>>>>>>> that is the
>>>>>>>>>>>>>>>>>> field you are used to talking in, you just don't have
>>>>>>>>>>>>>>>>>> a background to
>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you need
>>>>>>>>>>>>>>>>>> to do to show
>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also shows that
>>>>>>>>>>>>>>>>>> you don't
>>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly don't
>>>>>>>>>>>>>>>>>> undstand the
>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of Propositions,
>>>>>>>>>>>>>>>>>> the idea of
>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>> Have you really got nothing better to do with your time?
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> According to medical science I have terminal cancer with
>>>>>>>>>>>>>>>> little time left. I intend my HP proof rebuttal to be my
>>>>>>>>>>>>>>>> legacy.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>> self-reference of the halting problem proofs makes these
>>>>>>>>>>>>>>>> proof illegitimate I have no idea why you would be
>>>>>>>>>>>>>>>> reversing course now.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be illegitimate.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>
>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>
>>>>>>>>>>>>> You are wasting your time acting as a crank and looking for
>>>>>>>>>>>>> support
>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> I have boiled the error of the incompleteness theorem down
>>>>>>>>>>>> to a single simple sentence. Try and find a single error of
>>>>>>>>>>>> substance in my paper:
>>>>>>>>>>>>
>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take a moron.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Your logic is incorrect because you assume your conclusion as
>>>>>>>>>>> a premise.
>>>>>>>>>>>
>>>>>>>>>>> You use the WRONG definition of Truth, and assume that Truth
>>>>>>>>>>> can only be something that is proven, and then from that try
>>>>>>>>>>> to prove that Truth is only something that csn be proven.
>>>>>>>>>>>
>>>>>>>>>>> This is incorrect, and thus your whole arguement is invalid.
>>>>>>>>>>>
>>>>>>>>>>> For example, in mathematics, there are a number of statements
>>>>>>>>>>> that must either be True of False, there is no possible
>>>>>>>>>>> middle ground, but these statements have not been shown to be
>>>>>>>>>>> provable or disprovable. An example of this is the 3x+1 problem.
>>>>>>>>>>
>>>>>>>>>> Every expression of language does not count as true until
>>>>>>>>>> after it has been proven. There are only two ways to determine
>>>>>>>>>> if an analytical expression of language is true. It is an
>>>>>>>>>> axiom that assigned the value of Boolean true. It is derived
>>>>>>>>>> by sound deduction that is ultimately anchored in axioms.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Can you PROVE that statement? or is this just a axiom you need
>>>>>>>>> to assume.
>>>>>>>>
>>>>>>>> Analytical expressions of language are verified to be true
>>>>>>>> entirely on the basis of their meaning.
>>>>>>>
>>>>>>> WRONG. Formal;
>>>>>> That is a stipulated definition just like a "given" in geometry.
>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>
>>>>>> If I say that a cat is an animal and you disagree and say that a
>>>>>> cat is the windows of an office building you are simply wrong.
>>>>>>
>>>>>
>>>>> Except that you can't 'stipulate' a definition for something
>>>>> already defined in the system, especially to something wrong. That
>>>>> violates the rules of Formal Logic.
>>>> (1) That is already what analytical truth means:
>>>> "Analytic propositions are true or not true solely by virtue of
>>>> their meaning"
>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>
>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>> logic is a branch of philosophy
>>
>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>
>>
>
> But is a different branch than your Epistemology with different rules.
> Formal Logic, which mathematics uses defines things differently than
> what you want to use.


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<7cSPJ.37967$iK66.36822@fx46.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26709&group=comp.theory#26709

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!news.bawue.net!npeer.as286.net!npeer-ng0.as286.net!peer02.ams1!peer.ams1.xlned.com!news.xlned.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx46.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 358
Message-ID: <7cSPJ.37967$iK66.36822@fx46.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 14:12:04 -0500
X-Received-Bytes: 18741
 by: Richard Damon - Fri, 18 Feb 2022 19:12 UTC

On 2/18/22 1:41 PM, olcott wrote:
> On 2/18/2022 11:49 AM, Richard Damon wrote:
>> On 2/18/22 12:18 PM, olcott wrote:
>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>
>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>
>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>> the simulation
>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>> correctly
>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right definitions.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal and
>>>>>>>>>>>>>>>>>>>>>>> not the windows
>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the simple
>>>>>>>>>>>>>>>>>>>>>>> meaning of the
>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference betweeen
>>>>>>>>>>>>>>>>>>>>>> FORMAL logic
>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and infinitely
>>>>>>>>>>>>>>>>>>>>>>> nested simulation
>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have
>>>>>>>>>>>>>>>>>>>>>> proven something,
>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to agree
>>>>>>>>>>>>>>>>>>>>>> with you, you
>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in your
>>>>>>>>>>>>>>>>>>>>>> heart, which is why
>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that don't
>>>>>>>>>>>>>>>>>>>>>> require peer
>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation correctly
>>>>>>>>>>>>>>>>>>>>> transitions to
>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently true.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves that
>>>>>>>>>>>>>>>>>>>>> I am correct.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where this
>>>>>>>>>>>>>>>>>>>> input halts on
>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation of H"
>>>>>>>>>>>>>>>>>>> or H will never
>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H <H"> we
>>>>>>>>>>>>>>>>>>> see that we
>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have said
>>>>>>>>>>>>>>>>>>> that H has
>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a
>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of its
>>>>>>>>>>>>>>>>>>> input and goes to
>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim does
>>>>>>>>>>>>>>>>>>> not exist.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes to
>>>>>>>>>>>>>>>>>>> H.Qn for this
>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple
>>>>>>>>>>>>>>>>>>> running opf H" applied
>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown that
>>>>>>>>>>>>>>>>>>> BECAUSE H <H">
>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to H".Qn
>>>>>>>>>>>>>>>>>>> and Halt, and
>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus is not
>>>>>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You have just shown that you don't understand
>>>>>>>>>>>>>>>>>>> anything about formal
>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a
>>>>>>>>>>>>>>>>>>> counter example means
>>>>>>>>>>>>>>>>>>> your statement must be true is just plain unsond logic.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of the
>>>>>>>>>>>>>>>>>>> words' and not
>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions
>>>>>>>>>>>>>>>>>>> being used to make
>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't understand
>>>>>>>>>>>>>>>>>>> what you are
>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use formal logic.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> This is sort of understandable since you have
>>>>>>>>>>>>>>>>>>> revealed that you goal
>>>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy, so if
>>>>>>>>>>>>>>>>>>> that is the
>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just don't have
>>>>>>>>>>>>>>>>>>> a background to
>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you need
>>>>>>>>>>>>>>>>>>> to do to show
>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also shows
>>>>>>>>>>>>>>>>>>> that you don't
>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly don't
>>>>>>>>>>>>>>>>>>> undstand the
>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of Propositions,
>>>>>>>>>>>>>>>>>>> the idea of
>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with your time?
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> According to medical science I have terminal cancer
>>>>>>>>>>>>>>>>> with little time left. I intend my HP proof rebuttal to
>>>>>>>>>>>>>>>>> be my legacy.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs makes
>>>>>>>>>>>>>>>>> these proof illegitimate I have no idea why you would
>>>>>>>>>>>>>>>>> be reversing course now.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be illegitimate.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> You are wasting your time acting as a crank and looking
>>>>>>>>>>>>>> for support
>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> I have boiled the error of the incompleteness theorem down
>>>>>>>>>>>>> to a single simple sentence. Try and find a single error of
>>>>>>>>>>>>> substance in my paper:
>>>>>>>>>>>>>
>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take a
>>>>>>>>>>>>> moron.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Your logic is incorrect because you assume your conclusion
>>>>>>>>>>>> as a premise.
>>>>>>>>>>>>
>>>>>>>>>>>> You use the WRONG definition of Truth, and assume that Truth
>>>>>>>>>>>> can only be something that is proven, and then from that try
>>>>>>>>>>>> to prove that Truth is only something that csn be proven.
>>>>>>>>>>>>
>>>>>>>>>>>> This is incorrect, and thus your whole arguement is invalid.
>>>>>>>>>>>>
>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>> statements that must either be True of False, there is no
>>>>>>>>>>>> possible middle ground, but these statements have not been
>>>>>>>>>>>> shown to be provable or disprovable. An example of this is
>>>>>>>>>>>> the 3x+1 problem.
>>>>>>>>>>>
>>>>>>>>>>> Every expression of language does not count as true until
>>>>>>>>>>> after it has been proven. There are only two ways to
>>>>>>>>>>> determine if an analytical expression of language is true. It
>>>>>>>>>>> is an axiom that assigned the value of Boolean true. It is
>>>>>>>>>>> derived by sound deduction that is ultimately anchored in
>>>>>>>>>>> axioms.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Can you PROVE that statement? or is this just a axiom you need
>>>>>>>>>> to assume.
>>>>>>>>>
>>>>>>>>> Analytical expressions of language are verified to be true
>>>>>>>>> entirely on the basis of their meaning.
>>>>>>>>
>>>>>>>> WRONG. Formal;
>>>>>>> That is a stipulated definition just like a "given" in geometry.
>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>
>>>>>>> If I say that a cat is an animal and you disagree and say that a
>>>>>>> cat is the windows of an office building you are simply wrong.
>>>>>>>
>>>>>>
>>>>>> Except that you can't 'stipulate' a definition for something
>>>>>> already defined in the system, especially to something wrong. That
>>>>>> violates the rules of Formal Logic.
>>>>> (1) That is already what analytical truth means:
>>>>> "Analytic propositions are true or not true solely by virtue of
>>>>> their meaning"
>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>
>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>> logic is a branch of philosophy
>>>
>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>
>>>
>>
>> But is a different branch than your Epistemology with different rules.
>> Formal Logic, which mathematics uses defines things differently than
>> what you want to use.
>
> Yes and when formal logic diverges from applying truth preserving
> operations to premises that are known to be true (sound deductive
> inference) on the basis of the semantic relevance that is maintained in
> the syllogism:
>
> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
> then formal logic errs and diverges from truth.
>
> Logical entailment does not require premises to be true yet still
> requires true preserving operations to be applied on the basis of
> semantic relevance.
>Which just says that YOU don't agree with what the whole world agrees is
the truth.


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26710&group=comp.theory#26710

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 13:33:26 -0600
Date: Fri, 18 Feb 2022 13:33:24 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <7cSPJ.37967$iK66.36822@fx46.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
Lines: 320
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-qtxO8fQ8BdqvLXhDUF/LIgSvimbxCQTasR+fv7p8RzuJN36LrNY3XR3m7qBLRzp6ruALd0AgkJ342Xl!xhIM+cM0He1jYuIHlbOBTQCguRb515Rq3zhFl7X1WKWBdxnnFfkifHTjZwOWPwUy1+0l/atiiA==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 17096
 by: olcott - Fri, 18 Feb 2022 19:33 UTC

On 2/18/2022 1:12 PM, Richard Damon wrote:
> On 2/18/22 1:41 PM, olcott wrote:
>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>> On 2/18/22 12:18 PM, olcott wrote:
>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>
>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>
>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>>> the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal and
>>>>>>>>>>>>>>>>>>>>>>>> not the windows
>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the simple
>>>>>>>>>>>>>>>>>>>>>>>> meaning of the
>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference betweeen
>>>>>>>>>>>>>>>>>>>>>>> FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and infinitely
>>>>>>>>>>>>>>>>>>>>>>>> nested simulation
>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have
>>>>>>>>>>>>>>>>>>>>>>> proven something,
>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to
>>>>>>>>>>>>>>>>>>>>>>> agree with you, you
>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in your
>>>>>>>>>>>>>>>>>>>>>>> heart, which is why
>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that don't
>>>>>>>>>>>>>>>>>>>>>>> require peer
>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation correctly
>>>>>>>>>>>>>>>>>>>>>> transitions to
>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where this
>>>>>>>>>>>>>>>>>>>>> input halts on
>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation of H"
>>>>>>>>>>>>>>>>>>>> or H will never
>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H <H">
>>>>>>>>>>>>>>>>>>>> we see that we
>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have said
>>>>>>>>>>>>>>>>>>>> that H has
>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a
>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of its
>>>>>>>>>>>>>>>>>>>> input and goes to
>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim does
>>>>>>>>>>>>>>>>>>>> not exist.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes to
>>>>>>>>>>>>>>>>>>>> H.Qn for this
>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple
>>>>>>>>>>>>>>>>>>>> running opf H" applied
>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown that
>>>>>>>>>>>>>>>>>>>> BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to H".Qn
>>>>>>>>>>>>>>>>>>>> and Halt, and
>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus is
>>>>>>>>>>>>>>>>>>>> not correct.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> You have just shown that you don't understand
>>>>>>>>>>>>>>>>>>>> anything about formal
>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a
>>>>>>>>>>>>>>>>>>>> counter example means
>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain unsond logic.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of the
>>>>>>>>>>>>>>>>>>>> words' and not
>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions
>>>>>>>>>>>>>>>>>>>> being used to make
>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use formal
>>>>>>>>>>>>>>>>>>>> logic.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you have
>>>>>>>>>>>>>>>>>>>> revealed that you goal
>>>>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy, so
>>>>>>>>>>>>>>>>>>>> if that is the
>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just don't
>>>>>>>>>>>>>>>>>>>> have a background to
>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you need
>>>>>>>>>>>>>>>>>>>> to do to show
>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also shows
>>>>>>>>>>>>>>>>>>>> that you don't
>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly don't
>>>>>>>>>>>>>>>>>>>> undstand the
>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of Propositions,
>>>>>>>>>>>>>>>>>>>> the idea of
>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with your time?
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> According to medical science I have terminal cancer
>>>>>>>>>>>>>>>>>> with little time left. I intend my HP proof rebuttal
>>>>>>>>>>>>>>>>>> to be my legacy.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs makes
>>>>>>>>>>>>>>>>>> these proof illegitimate I have no idea why you would
>>>>>>>>>>>>>>>>>> be reversing course now.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> You are wasting your time acting as a crank and looking
>>>>>>>>>>>>>>> for support
>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> I have boiled the error of the incompleteness theorem down
>>>>>>>>>>>>>> to a single simple sentence. Try and find a single error
>>>>>>>>>>>>>> of substance in my paper:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take a
>>>>>>>>>>>>>> moron.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Your logic is incorrect because you assume your conclusion
>>>>>>>>>>>>> as a premise.
>>>>>>>>>>>>>
>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume that
>>>>>>>>>>>>> Truth can only be something that is proven, and then from
>>>>>>>>>>>>> that try to prove that Truth is only something that csn be
>>>>>>>>>>>>> proven.
>>>>>>>>>>>>>
>>>>>>>>>>>>> This is incorrect, and thus your whole arguement is invalid.
>>>>>>>>>>>>>
>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>> statements that must either be True of False, there is no
>>>>>>>>>>>>> possible middle ground, but these statements have not been
>>>>>>>>>>>>> shown to be provable or disprovable. An example of this is
>>>>>>>>>>>>> the 3x+1 problem.
>>>>>>>>>>>>
>>>>>>>>>>>> Every expression of language does not count as true until
>>>>>>>>>>>> after it has been proven. There are only two ways to
>>>>>>>>>>>> determine if an analytical expression of language is true.
>>>>>>>>>>>> It is an axiom that assigned the value of Boolean true. It
>>>>>>>>>>>> is derived by sound deduction that is ultimately anchored in
>>>>>>>>>>>> axioms.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Can you PROVE that statement? or is this just a axiom you
>>>>>>>>>>> need to assume.
>>>>>>>>>>
>>>>>>>>>> Analytical expressions of language are verified to be true
>>>>>>>>>> entirely on the basis of their meaning.
>>>>>>>>>
>>>>>>>>> WRONG. Formal;
>>>>>>>> That is a stipulated definition just like a "given" in geometry.
>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>
>>>>>>>> If I say that a cat is an animal and you disagree and say that a
>>>>>>>> cat is the windows of an office building you are simply wrong.
>>>>>>>>
>>>>>>>
>>>>>>> Except that you can't 'stipulate' a definition for something
>>>>>>> already defined in the system, especially to something wrong.
>>>>>>> That violates the rules of Formal Logic.
>>>>>> (1) That is already what analytical truth means:
>>>>>> "Analytic propositions are true or not true solely by virtue of
>>>>>> their meaning"
>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>
>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>> logic is a branch of philosophy
>>>>
>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>
>>>>
>>>
>>> But is a different branch than your Epistemology with different
>>> rules. Formal Logic, which mathematics uses defines things
>>> differently than what you want to use.
>>
>> Yes and when formal logic diverges from applying truth preserving
>> operations to premises that are known to be true (sound deductive
>> inference) on the basis of the semantic relevance that is maintained
>> in the syllogism:
>>
>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>> then formal logic errs and diverges from truth.
>>
>> Logical entailment does not require premises to be true yet still
>> requires true preserving operations to be applied on the basis of
>> semantic relevance.
>> Which just says that YOU don't agree with what the whole world agrees is
> the truth.
>
> Find, you are on your own.
>


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<CATPJ.37969$iK66.11942@fx46.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26711&group=comp.theory#26711

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!news.freedyn.de!newsreader4.netcologne.de!news.netcologne.de!peer01.ams1!peer.ams1.xlned.com!news.xlned.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx46.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 344
Message-ID: <CATPJ.37969$iK66.11942@fx46.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 15:46:28 -0500
X-Received-Bytes: 18304
 by: Richard Damon - Fri, 18 Feb 2022 20:46 UTC

On 2/18/22 2:33 PM, olcott wrote:
> On 2/18/2022 1:12 PM, Richard Damon wrote:
>> On 2/18/22 1:41 PM, olcott wrote:
>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>
>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>>>> the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal
>>>>>>>>>>>>>>>>>>>>>>>>> and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the simple
>>>>>>>>>>>>>>>>>>>>>>>>> meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference
>>>>>>>>>>>>>>>>>>>>>>>> betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and infinitely
>>>>>>>>>>>>>>>>>>>>>>>>> nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have
>>>>>>>>>>>>>>>>>>>>>>>> proven something,
>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to
>>>>>>>>>>>>>>>>>>>>>>>> agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in your
>>>>>>>>>>>>>>>>>>>>>>>> heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that
>>>>>>>>>>>>>>>>>>>>>>>> don't require peer
>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where
>>>>>>>>>>>>>>>>>>>>>> this input halts on
>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation of
>>>>>>>>>>>>>>>>>>>>> H" or H will never
>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H <H">
>>>>>>>>>>>>>>>>>>>>> we see that we
>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have said
>>>>>>>>>>>>>>>>>>>>> that H has
>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a
>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of its
>>>>>>>>>>>>>>>>>>>>> input and goes to
>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim
>>>>>>>>>>>>>>>>>>>>> does not exist.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes to
>>>>>>>>>>>>>>>>>>>>> H.Qn for this
>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple
>>>>>>>>>>>>>>>>>>>>> running opf H" applied
>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown
>>>>>>>>>>>>>>>>>>>>> that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to
>>>>>>>>>>>>>>>>>>>>> H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus is
>>>>>>>>>>>>>>>>>>>>> not correct.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't understand
>>>>>>>>>>>>>>>>>>>>> anything about formal
>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a
>>>>>>>>>>>>>>>>>>>>> counter example means
>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain unsond
>>>>>>>>>>>>>>>>>>>>> logic.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of the
>>>>>>>>>>>>>>>>>>>>> words' and not
>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions
>>>>>>>>>>>>>>>>>>>>> being used to make
>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use formal
>>>>>>>>>>>>>>>>>>>>> logic.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you have
>>>>>>>>>>>>>>>>>>>>> revealed that you goal
>>>>>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy, so
>>>>>>>>>>>>>>>>>>>>> if that is the
>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just don't
>>>>>>>>>>>>>>>>>>>>> have a background to
>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you
>>>>>>>>>>>>>>>>>>>>> need to do to show
>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also shows
>>>>>>>>>>>>>>>>>>>>> that you don't
>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly
>>>>>>>>>>>>>>>>>>>>> don't undstand the
>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with your
>>>>>>>>>>>>>>>>>>>> time?
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> According to medical science I have terminal cancer
>>>>>>>>>>>>>>>>>>> with little time left. I intend my HP proof rebuttal
>>>>>>>>>>>>>>>>>>> to be my legacy.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs makes
>>>>>>>>>>>>>>>>>>> these proof illegitimate I have no idea why you would
>>>>>>>>>>>>>>>>>>> be reversing course now.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and looking
>>>>>>>>>>>>>>>> for support
>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> I have boiled the error of the incompleteness theorem
>>>>>>>>>>>>>>> down to a single simple sentence. Try and find a single
>>>>>>>>>>>>>>> error of substance in my paper:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take a
>>>>>>>>>>>>>>> moron.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Your logic is incorrect because you assume your conclusion
>>>>>>>>>>>>>> as a premise.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume that
>>>>>>>>>>>>>> Truth can only be something that is proven, and then from
>>>>>>>>>>>>>> that try to prove that Truth is only something that csn be
>>>>>>>>>>>>>> proven.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement is invalid.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>>> statements that must either be True of False, there is no
>>>>>>>>>>>>>> possible middle ground, but these statements have not been
>>>>>>>>>>>>>> shown to be provable or disprovable. An example of this is
>>>>>>>>>>>>>> the 3x+1 problem.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Every expression of language does not count as true until
>>>>>>>>>>>>> after it has been proven. There are only two ways to
>>>>>>>>>>>>> determine if an analytical expression of language is true.
>>>>>>>>>>>>> It is an axiom that assigned the value of Boolean true. It
>>>>>>>>>>>>> is derived by sound deduction that is ultimately anchored
>>>>>>>>>>>>> in axioms.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Can you PROVE that statement? or is this just a axiom you
>>>>>>>>>>>> need to assume.
>>>>>>>>>>>
>>>>>>>>>>> Analytical expressions of language are verified to be true
>>>>>>>>>>> entirely on the basis of their meaning.
>>>>>>>>>>
>>>>>>>>>> WRONG. Formal;
>>>>>>>>> That is a stipulated definition just like a "given" in geometry.
>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>
>>>>>>>>> If I say that a cat is an animal and you disagree and say that
>>>>>>>>> a cat is the windows of an office building you are simply wrong.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Except that you can't 'stipulate' a definition for something
>>>>>>>> already defined in the system, especially to something wrong.
>>>>>>>> That violates the rules of Formal Logic.
>>>>>>> (1) That is already what analytical truth means:
>>>>>>> "Analytic propositions are true or not true solely by virtue of
>>>>>>> their meaning"
>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>
>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>> logic is a branch of philosophy
>>>>>
>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>
>>>>>
>>>>
>>>> But is a different branch than your Epistemology with different
>>>> rules. Formal Logic, which mathematics uses defines things
>>>> differently than what you want to use.
>>>
>>> Yes and when formal logic diverges from applying truth preserving
>>> operations to premises that are known to be true (sound deductive
>>> inference) on the basis of the semantic relevance that is maintained
>>> in the syllogism:
>>>
>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>> then formal logic errs and diverges from truth.
>>>
>>> Logical entailment does not require premises to be true yet still
>>> requires true preserving operations to be applied on the basis of
>>> semantic relevance.
>>> Which just says that YOU don't agree with what the whole world agrees is
>> the truth.
>>
>> Find, you are on your own.
>>
>
> Things an ignoramus would say:
>> YOU have shown yourself to be incapable of understanding the basic
>> principles of Formal Logic, and are thus unqualified to discuss it.
> When everything that you learn you learn by only rote understanding
> cannot possibly get any more shallow.
>
> I am discussing the philosophical underpinnings upon which correct
> reasoning is based.
>


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26712&group=comp.theory#26712

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!1.us.feeder.erje.net!feeder.erje.net!border1.nntp.dca1.giganews.com!nntp.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 15:03:22 -0600
Date: Fri, 18 Feb 2022 15:03:20 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
From: NoO...@NoWhere.com (olcott)
Followup-To: comp.theory
In-Reply-To: <CATPJ.37969$iK66.11942@fx46.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
Lines: 370
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-xr4VdzOtGsw7ayvf0X/9LdyOpD2jM6em9Ie79zQHHo34O0BZvpc8Ol71dWExCQeipMTZwqTboiZaR2t!g4M6XzX3onpcnKHoVfhuKR2WGnx9SXcO7siCmGsB3FNdjAPxel89+SxCT/T+gjLj7Zw83J18tA==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 19822
 by: olcott - Fri, 18 Feb 2022 21:03 UTC

On 2/18/2022 2:46 PM, Richard Damon wrote:
> On 2/18/22 2:33 PM, olcott wrote:
>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>> On 2/18/22 1:41 PM, olcott wrote:
>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>
>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal
>>>>>>>>>>>>>>>>>>>>>>>>>> and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the simple
>>>>>>>>>>>>>>>>>>>>>>>>>> meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference
>>>>>>>>>>>>>>>>>>>>>>>>> betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and infinitely
>>>>>>>>>>>>>>>>>>>>>>>>>> nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have
>>>>>>>>>>>>>>>>>>>>>>>>> proven something,
>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to
>>>>>>>>>>>>>>>>>>>>>>>>> agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in your
>>>>>>>>>>>>>>>>>>>>>>>>> heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that
>>>>>>>>>>>>>>>>>>>>>>>>> don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>> the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently
>>>>>>>>>>>>>>>>>>>>>>>> true.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where
>>>>>>>>>>>>>>>>>>>>>>> this input halts on
>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation of
>>>>>>>>>>>>>>>>>>>>>> H" or H will never
>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H <H">
>>>>>>>>>>>>>>>>>>>>>> we see that we
>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have
>>>>>>>>>>>>>>>>>>>>>> said that H has
>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a
>>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of its
>>>>>>>>>>>>>>>>>>>>>> input and goes to
>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim
>>>>>>>>>>>>>>>>>>>>>> does not exist.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes to
>>>>>>>>>>>>>>>>>>>>>> H.Qn for this
>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple
>>>>>>>>>>>>>>>>>>>>>> running opf H" applied
>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown
>>>>>>>>>>>>>>>>>>>>>> that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to
>>>>>>>>>>>>>>>>>>>>>> H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus is
>>>>>>>>>>>>>>>>>>>>>> not correct.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't understand
>>>>>>>>>>>>>>>>>>>>>> anything about formal
>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a
>>>>>>>>>>>>>>>>>>>>>> counter example means
>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain unsond
>>>>>>>>>>>>>>>>>>>>>> logic.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of
>>>>>>>>>>>>>>>>>>>>>> the words' and not
>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions
>>>>>>>>>>>>>>>>>>>>>> being used to make
>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use formal
>>>>>>>>>>>>>>>>>>>>>> logic.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you have
>>>>>>>>>>>>>>>>>>>>>> revealed that you goal
>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy, so
>>>>>>>>>>>>>>>>>>>>>> if that is the
>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just don't
>>>>>>>>>>>>>>>>>>>>>> have a background to
>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you
>>>>>>>>>>>>>>>>>>>>>> need to do to show
>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also shows
>>>>>>>>>>>>>>>>>>>>>> that you don't
>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly
>>>>>>>>>>>>>>>>>>>>>> don't undstand the
>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with your
>>>>>>>>>>>>>>>>>>>>> time?
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> According to medical science I have terminal cancer
>>>>>>>>>>>>>>>>>>>> with little time left. I intend my HP proof rebuttal
>>>>>>>>>>>>>>>>>>>> to be my legacy.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs makes
>>>>>>>>>>>>>>>>>>>> these proof illegitimate I have no idea why you
>>>>>>>>>>>>>>>>>>>> would be reversing course now.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and looking
>>>>>>>>>>>>>>>>> for support
>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness theorem
>>>>>>>>>>>>>>>> down to a single simple sentence. Try and find a single
>>>>>>>>>>>>>>>> error of substance in my paper:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take a
>>>>>>>>>>>>>>>> moron.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume that
>>>>>>>>>>>>>>> Truth can only be something that is proven, and then from
>>>>>>>>>>>>>>> that try to prove that Truth is only something that csn
>>>>>>>>>>>>>>> be proven.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement is invalid.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>>>> statements that must either be True of False, there is no
>>>>>>>>>>>>>>> possible middle ground, but these statements have not
>>>>>>>>>>>>>>> been shown to be provable or disprovable. An example of
>>>>>>>>>>>>>>> this is the 3x+1 problem.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Every expression of language does not count as true until
>>>>>>>>>>>>>> after it has been proven. There are only two ways to
>>>>>>>>>>>>>> determine if an analytical expression of language is true.
>>>>>>>>>>>>>> It is an axiom that assigned the value of Boolean true. It
>>>>>>>>>>>>>> is derived by sound deduction that is ultimately anchored
>>>>>>>>>>>>>> in axioms.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Can you PROVE that statement? or is this just a axiom you
>>>>>>>>>>>>> need to assume.
>>>>>>>>>>>>
>>>>>>>>>>>> Analytical expressions of language are verified to be true
>>>>>>>>>>>> entirely on the basis of their meaning.
>>>>>>>>>>>
>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>> That is a stipulated definition just like a "given" in geometry.
>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>
>>>>>>>>>> If I say that a cat is an animal and you disagree and say that
>>>>>>>>>> a cat is the windows of an office building you are simply wrong.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Except that you can't 'stipulate' a definition for something
>>>>>>>>> already defined in the system, especially to something wrong.
>>>>>>>>> That violates the rules of Formal Logic.
>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>> "Analytic propositions are true or not true solely by virtue of
>>>>>>>> their meaning"
>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>
>>>>>>>
>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>> logic is a branch of philosophy
>>>>>>
>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>
>>>>>>
>>>>>
>>>>> But is a different branch than your Epistemology with different
>>>>> rules. Formal Logic, which mathematics uses defines things
>>>>> differently than what you want to use.
>>>>
>>>> Yes and when formal logic diverges from applying truth preserving
>>>> operations to premises that are known to be true (sound deductive
>>>> inference) on the basis of the semantic relevance that is maintained
>>>> in the syllogism:
>>>>
>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>> then formal logic errs and diverges from truth.
>>>>
>>>> Logical entailment does not require premises to be true yet still
>>>> requires true preserving operations to be applied on the basis of
>>>> semantic relevance.
>>>> Which just says that YOU don't agree with what the whole world
>>>> agrees is
>>> the truth.
>>>
>>> Find, you are on your own.
>>>
>>
>> Things an ignoramus would say:
>>> YOU have shown yourself to be incapable of understanding the basic
>>> principles of Formal Logic, and are thus unqualified to discuss it.
>> When everything that you learn you learn by only rote understanding
>> cannot possibly get any more shallow.
>>
>> I am discussing the philosophical underpinnings upon which correct
>> reasoning is based.
>>
>
> Then you are doing it at the wrong place.
>
> If you disagree with the fundamental logic underpinnings of all of
> Formal Logic, you don't start in a peripheral field. That is useless.
>


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<t3UPJ.18686$d0Y8.5829@fx31.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26713&group=comp.theory#26713

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!news.freedyn.de!newsreader4.netcologne.de!news.netcologne.de!peer01.ams1!peer.ams1.xlned.com!news.xlned.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx31.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 392
Message-ID: <t3UPJ.18686$d0Y8.5829@fx31.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 16:19:23 -0500
X-Received-Bytes: 20680
 by: Richard Damon - Fri, 18 Feb 2022 21:19 UTC

On 2/18/22 4:03 PM, olcott wrote:
> On 2/18/2022 2:46 PM, Richard Damon wrote:
>> On 2/18/22 2:33 PM, olcott wrote:
>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>
>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal
>>>>>>>>>>>>>>>>>>>>>>>>>>> and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the
>>>>>>>>>>>>>>>>>>>>>>>>>>> simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference
>>>>>>>>>>>>>>>>>>>>>>>>>> betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and infinitely
>>>>>>>>>>>>>>>>>>>>>>>>>>> nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have
>>>>>>>>>>>>>>>>>>>>>>>>>> proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to
>>>>>>>>>>>>>>>>>>>>>>>>>> agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in your
>>>>>>>>>>>>>>>>>>>>>>>>>> heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that
>>>>>>>>>>>>>>>>>>>>>>>>>> don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>> the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently
>>>>>>>>>>>>>>>>>>>>>>>>> true.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where
>>>>>>>>>>>>>>>>>>>>>>>> this input halts on
>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation of
>>>>>>>>>>>>>>>>>>>>>>> H" or H will never
>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H
>>>>>>>>>>>>>>>>>>>>>>> <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have
>>>>>>>>>>>>>>>>>>>>>>> said that H has
>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a
>>>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of
>>>>>>>>>>>>>>>>>>>>>>> its input and goes to
>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim
>>>>>>>>>>>>>>>>>>>>>>> does not exist.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes to
>>>>>>>>>>>>>>>>>>>>>>> H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple
>>>>>>>>>>>>>>>>>>>>>>> running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown
>>>>>>>>>>>>>>>>>>>>>>> that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to
>>>>>>>>>>>>>>>>>>>>>>> H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus is
>>>>>>>>>>>>>>>>>>>>>>> not correct.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't understand
>>>>>>>>>>>>>>>>>>>>>>> anything about formal
>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a
>>>>>>>>>>>>>>>>>>>>>>> counter example means
>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain unsond
>>>>>>>>>>>>>>>>>>>>>>> logic.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of
>>>>>>>>>>>>>>>>>>>>>>> the words' and not
>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions
>>>>>>>>>>>>>>>>>>>>>>> being used to make
>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use formal
>>>>>>>>>>>>>>>>>>>>>>> logic.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you have
>>>>>>>>>>>>>>>>>>>>>>> revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy,
>>>>>>>>>>>>>>>>>>>>>>> so if that is the
>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just don't
>>>>>>>>>>>>>>>>>>>>>>> have a background to
>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you
>>>>>>>>>>>>>>>>>>>>>>> need to do to show
>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also shows
>>>>>>>>>>>>>>>>>>>>>>> that you don't
>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly
>>>>>>>>>>>>>>>>>>>>>>> don't undstand the
>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with your
>>>>>>>>>>>>>>>>>>>>>> time?
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> According to medical science I have terminal cancer
>>>>>>>>>>>>>>>>>>>>> with little time left. I intend my HP proof
>>>>>>>>>>>>>>>>>>>>> rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs makes
>>>>>>>>>>>>>>>>>>>>> these proof illegitimate I have no idea why you
>>>>>>>>>>>>>>>>>>>>> would be reversing course now.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and
>>>>>>>>>>>>>>>>>> looking for support
>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness theorem
>>>>>>>>>>>>>>>>> down to a single simple sentence. Try and find a single
>>>>>>>>>>>>>>>>> error of substance in my paper:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take
>>>>>>>>>>>>>>>>> a moron.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume that
>>>>>>>>>>>>>>>> Truth can only be something that is proven, and then
>>>>>>>>>>>>>>>> from that try to prove that Truth is only something that
>>>>>>>>>>>>>>>> csn be proven.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement is
>>>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>>>>> statements that must either be True of False, there is
>>>>>>>>>>>>>>>> no possible middle ground, but these statements have not
>>>>>>>>>>>>>>>> been shown to be provable or disprovable. An example of
>>>>>>>>>>>>>>>> this is the 3x+1 problem.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Every expression of language does not count as true until
>>>>>>>>>>>>>>> after it has been proven. There are only two ways to
>>>>>>>>>>>>>>> determine if an analytical expression of language is
>>>>>>>>>>>>>>> true. It is an axiom that assigned the value of Boolean
>>>>>>>>>>>>>>> true. It is derived by sound deduction that is ultimately
>>>>>>>>>>>>>>> anchored in axioms.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a axiom you
>>>>>>>>>>>>>> need to assume.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Analytical expressions of language are verified to be true
>>>>>>>>>>>>> entirely on the basis of their meaning.
>>>>>>>>>>>>
>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>> That is a stipulated definition just like a "given" in geometry.
>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>
>>>>>>>>>>> If I say that a cat is an animal and you disagree and say
>>>>>>>>>>> that a cat is the windows of an office building you are
>>>>>>>>>>> simply wrong.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Except that you can't 'stipulate' a definition for something
>>>>>>>>>> already defined in the system, especially to something wrong.
>>>>>>>>>> That violates the rules of Formal Logic.
>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>> "Analytic propositions are true or not true solely by virtue of
>>>>>>>>> their meaning"
>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>
>>>>>>>>
>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>> logic is a branch of philosophy
>>>>>>>
>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> But is a different branch than your Epistemology with different
>>>>>> rules. Formal Logic, which mathematics uses defines things
>>>>>> differently than what you want to use.
>>>>>
>>>>> Yes and when formal logic diverges from applying truth preserving
>>>>> operations to premises that are known to be true (sound deductive
>>>>> inference) on the basis of the semantic relevance that is
>>>>> maintained in the syllogism:
>>>>>
>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>> then formal logic errs and diverges from truth.
>>>>>
>>>>> Logical entailment does not require premises to be true yet still
>>>>> requires true preserving operations to be applied on the basis of
>>>>> semantic relevance.
>>>>> Which just says that YOU don't agree with what the whole world
>>>>> agrees is
>>>> the truth.
>>>>
>>>> Find, you are on your own.
>>>>
>>>
>>> Things an ignoramus would say:
>>>> YOU have shown yourself to be incapable of understanding the basic
>>>> principles of Formal Logic, and are thus unqualified to discuss it.
>>> When everything that you learn you learn by only rote understanding
>>> cannot possibly get any more shallow.
>>>
>>> I am discussing the philosophical underpinnings upon which correct
>>> reasoning is based.
>>>
>>
>> Then you are doing it at the wrong place.
>>
>> If you disagree with the fundamental logic underpinnings of all of
>> Formal Logic, you don't start in a peripheral field. That is useless.
>>
>
> Philosophical foundationalism is the ultimate basis and ground-of-being
> of correct reasoning and logic, thus 100% directly opposite of
> peripheral. It cannot possibly be any less peripheral.


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26714&group=comp.theory#26714

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 15:39:53 -0600
Date: Fri, 18 Feb 2022 15:39:50 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
From: NoO...@NoWhere.com (olcott)
Followup-To: comp.theory
In-Reply-To: <t3UPJ.18686$d0Y8.5829@fx31.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
Lines: 379
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-M88bZVBc88mnrTxp4JlCIXIDFXjTgGbAywlb+8k/OIRfvLTKxyUW/2zrZ+bUbR161L3l8QpHCA1yhBx!tH3c+1WFF1GJVsd2GP1LdsOs0g2be+scMXaBH+zHn1Kf3inWtlwMm7cBLTTeh1U0dh+pV7/0uA==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 20627
 by: olcott - Fri, 18 Feb 2022 21:39 UTC

On 2/18/2022 3:19 PM, Richard Damon wrote:
>
> On 2/18/22 4:03 PM, olcott wrote:
>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>> On 2/18/22 2:33 PM, olcott wrote:
>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>
>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an animal
>>>>>>>>>>>>>>>>>>>>>>>>>>>> and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the
>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference
>>>>>>>>>>>>>>>>>>>>>>>>>>> betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you have
>>>>>>>>>>>>>>>>>>>>>>>>>>> proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to
>>>>>>>>>>>>>>>>>>>>>>>>>>> agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in your
>>>>>>>>>>>>>>>>>>>>>>>>>>> heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that
>>>>>>>>>>>>>>>>>>>>>>>>>>> don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>>> the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is self-evidently
>>>>>>>>>>>>>>>>>>>>>>>>>> true.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists proves
>>>>>>>>>>>>>>>>>>>>>>>>>> that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where
>>>>>>>>>>>>>>>>>>>>>>>>> this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation
>>>>>>>>>>>>>>>>>>>>>>>> of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H
>>>>>>>>>>>>>>>>>>>>>>>> <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have
>>>>>>>>>>>>>>>>>>>>>>>> said that H has
>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a
>>>>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of
>>>>>>>>>>>>>>>>>>>>>>>> its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim
>>>>>>>>>>>>>>>>>>>>>>>> does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes
>>>>>>>>>>>>>>>>>>>>>>>> to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple
>>>>>>>>>>>>>>>>>>>>>>>> running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown
>>>>>>>>>>>>>>>>>>>>>>>> that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to
>>>>>>>>>>>>>>>>>>>>>>>> H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus
>>>>>>>>>>>>>>>>>>>>>>>> is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't understand
>>>>>>>>>>>>>>>>>>>>>>>> anything about formal
>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a
>>>>>>>>>>>>>>>>>>>>>>>> counter example means
>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain unsond
>>>>>>>>>>>>>>>>>>>>>>>> logic.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of
>>>>>>>>>>>>>>>>>>>>>>>> the words' and not
>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL definitions
>>>>>>>>>>>>>>>>>>>>>>>> being used to make
>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use
>>>>>>>>>>>>>>>>>>>>>>>> formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you have
>>>>>>>>>>>>>>>>>>>>>>>> revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy,
>>>>>>>>>>>>>>>>>>>>>>>> so if that is the
>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just don't
>>>>>>>>>>>>>>>>>>>>>>>> have a background to
>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory uses.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you
>>>>>>>>>>>>>>>>>>>>>>>> need to do to show
>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also
>>>>>>>>>>>>>>>>>>>>>>>> shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly
>>>>>>>>>>>>>>>>>>>>>>>> don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with
>>>>>>>>>>>>>>>>>>>>>>> your time?
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> According to medical science I have terminal
>>>>>>>>>>>>>>>>>>>>>> cancer with little time left. I intend my HP proof
>>>>>>>>>>>>>>>>>>>>>> rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs makes
>>>>>>>>>>>>>>>>>>>>>> these proof illegitimate I have no idea why you
>>>>>>>>>>>>>>>>>>>>>> would be reversing course now.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and
>>>>>>>>>>>>>>>>>>> looking for support
>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness theorem
>>>>>>>>>>>>>>>>>> down to a single simple sentence. Try and find a
>>>>>>>>>>>>>>>>>> single error of substance in my paper:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even take
>>>>>>>>>>>>>>>>>> a moron.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume that
>>>>>>>>>>>>>>>>> Truth can only be something that is proven, and then
>>>>>>>>>>>>>>>>> from that try to prove that Truth is only something
>>>>>>>>>>>>>>>>> that csn be proven.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement is
>>>>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>>>>>> statements that must either be True of False, there is
>>>>>>>>>>>>>>>>> no possible middle ground, but these statements have
>>>>>>>>>>>>>>>>> not been shown to be provable or disprovable. An
>>>>>>>>>>>>>>>>> example of this is the 3x+1 problem.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Every expression of language does not count as true
>>>>>>>>>>>>>>>> until after it has been proven. There are only two ways
>>>>>>>>>>>>>>>> to determine if an analytical expression of language is
>>>>>>>>>>>>>>>> true. It is an axiom that assigned the value of Boolean
>>>>>>>>>>>>>>>> true. It is derived by sound deduction that is
>>>>>>>>>>>>>>>> ultimately anchored in axioms.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a axiom you
>>>>>>>>>>>>>>> need to assume.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Analytical expressions of language are verified to be true
>>>>>>>>>>>>>> entirely on the basis of their meaning.
>>>>>>>>>>>>>
>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>> That is a stipulated definition just like a "given" in
>>>>>>>>>>>> geometry.
>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>
>>>>>>>>>>>> If I say that a cat is an animal and you disagree and say
>>>>>>>>>>>> that a cat is the windows of an office building you are
>>>>>>>>>>>> simply wrong.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Except that you can't 'stipulate' a definition for something
>>>>>>>>>>> already defined in the system, especially to something wrong.
>>>>>>>>>>> That violates the rules of Formal Logic.
>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>> "Analytic propositions are true or not true solely by virtue
>>>>>>>>>> of their meaning"
>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>> logic is a branch of philosophy
>>>>>>>>
>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> But is a different branch than your Epistemology with different
>>>>>>> rules. Formal Logic, which mathematics uses defines things
>>>>>>> differently than what you want to use.
>>>>>>
>>>>>> Yes and when formal logic diverges from applying truth preserving
>>>>>> operations to premises that are known to be true (sound deductive
>>>>>> inference) on the basis of the semantic relevance that is
>>>>>> maintained in the syllogism:
>>>>>>
>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>> then formal logic errs and diverges from truth.
>>>>>>
>>>>>> Logical entailment does not require premises to be true yet still
>>>>>> requires true preserving operations to be applied on the basis of
>>>>>> semantic relevance.
>>>>>> Which just says that YOU don't agree with what the whole world
>>>>>> agrees is
>>>>> the truth.
>>>>>
>>>>> Find, you are on your own.
>>>>>
>>>>
>>>> Things an ignoramus would say:
>>>>> YOU have shown yourself to be incapable of understanding the basic
>>>>> principles of Formal Logic, and are thus unqualified to discuss it.
>>>> When everything that you learn you learn by only rote understanding
>>>> cannot possibly get any more shallow.
>>>>
>>>> I am discussing the philosophical underpinnings upon which correct
>>>> reasoning is based.
>>>>
>>>
>>> Then you are doing it at the wrong place.
>>>
>>> If you disagree with the fundamental logic underpinnings of all of
>>> Formal Logic, you don't start in a peripheral field. That is useless.
>>>
>>
>> Philosophical foundationalism is the ultimate basis and
>> ground-of-being of correct reasoning and logic, thus 100% directly
>> opposite of peripheral. It cannot possibly be any less peripheral.
>
> You don't read very well I see. I wasn't calling the logic underpinnings
> peripheral, I was calling Computation Theory peripheral. If you want to
> challenge the definition of Truth used in Formal Logic, you don't work
> in a peripheral field, which CAN'T change the definition of Truth it
> uses, because it has inhereted it from its
>


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<2KUPJ.21827$0vE9.17210@fx17.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26715&group=comp.theory#26715

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!news.freedyn.de!newsreader4.netcologne.de!news.netcologne.de!peer03.ams1!peer.ams1.xlned.com!news.xlned.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx17.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 415
Message-ID: <2KUPJ.21827$0vE9.17210@fx17.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 17:04:48 -0500
X-Received-Bytes: 22301
 by: Richard Damon - Fri, 18 Feb 2022 22:04 UTC

On 2/18/22 4:39 PM, olcott wrote:
> On 2/18/2022 3:19 PM, Richard Damon wrote:
>>
>> On 2/18/22 4:03 PM, olcott wrote:
>>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>>> On 2/18/22 2:33 PM, olcott wrote:
>>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>>
>>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> animal and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference
>>>>>>>>>>>>>>>>>>>>>>>>>>>> betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>> have proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything to
>>>>>>>>>>>>>>>>>>>>>>>>>>>> agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in
>>>>>>>>>>>>>>>>>>>>>>>>>>>> your heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that
>>>>>>>>>>>>>>>>>>>>>>>>>>>> don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>>>> the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is
>>>>>>>>>>>>>>>>>>>>>>>>>>> self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation where
>>>>>>>>>>>>>>>>>>>>>>>>>> this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation
>>>>>>>>>>>>>>>>>>>>>>>>> of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H
>>>>>>>>>>>>>>>>>>>>>>>>> <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have
>>>>>>>>>>>>>>>>>>>>>>>>> said that H has
>>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a
>>>>>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of
>>>>>>>>>>>>>>>>>>>>>>>>> its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you claim
>>>>>>>>>>>>>>>>>>>>>>>>> does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes
>>>>>>>>>>>>>>>>>>>>>>>>> to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple
>>>>>>>>>>>>>>>>>>>>>>>>> running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just shown
>>>>>>>>>>>>>>>>>>>>>>>>> that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to
>>>>>>>>>>>>>>>>>>>>>>>>> H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus
>>>>>>>>>>>>>>>>>>>>>>>>> is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't understand
>>>>>>>>>>>>>>>>>>>>>>>>> anything about formal
>>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a
>>>>>>>>>>>>>>>>>>>>>>>>> counter example means
>>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain
>>>>>>>>>>>>>>>>>>>>>>>>> unsond logic.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning of
>>>>>>>>>>>>>>>>>>>>>>>>> the words' and not
>>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL
>>>>>>>>>>>>>>>>>>>>>>>>> definitions being used to make
>>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use
>>>>>>>>>>>>>>>>>>>>>>>>> formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you have
>>>>>>>>>>>>>>>>>>>>>>>>> revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but Philosophy,
>>>>>>>>>>>>>>>>>>>>>>>>> so if that is the
>>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just
>>>>>>>>>>>>>>>>>>>>>>>>> don't have a background to
>>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory
>>>>>>>>>>>>>>>>>>>>>>>>> uses.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what you
>>>>>>>>>>>>>>>>>>>>>>>>> need to do to show
>>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also
>>>>>>>>>>>>>>>>>>>>>>>>> shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly
>>>>>>>>>>>>>>>>>>>>>>>>> don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with
>>>>>>>>>>>>>>>>>>>>>>>> your time?
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> According to medical science I have terminal
>>>>>>>>>>>>>>>>>>>>>>> cancer with little time left. I intend my HP
>>>>>>>>>>>>>>>>>>>>>>> proof rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs
>>>>>>>>>>>>>>>>>>>>>>> makes these proof illegitimate I have no idea why
>>>>>>>>>>>>>>>>>>>>>>> you would be reversing course now.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and
>>>>>>>>>>>>>>>>>>>> looking for support
>>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness theorem
>>>>>>>>>>>>>>>>>>> down to a single simple sentence. Try and find a
>>>>>>>>>>>>>>>>>>> single error of substance in my paper:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even
>>>>>>>>>>>>>>>>>>> take a moron.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume that
>>>>>>>>>>>>>>>>>> Truth can only be something that is proven, and then
>>>>>>>>>>>>>>>>>> from that try to prove that Truth is only something
>>>>>>>>>>>>>>>>>> that csn be proven.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement is
>>>>>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>>>>>>> statements that must either be True of False, there is
>>>>>>>>>>>>>>>>>> no possible middle ground, but these statements have
>>>>>>>>>>>>>>>>>> not been shown to be provable or disprovable. An
>>>>>>>>>>>>>>>>>> example of this is the 3x+1 problem.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Every expression of language does not count as true
>>>>>>>>>>>>>>>>> until after it has been proven. There are only two ways
>>>>>>>>>>>>>>>>> to determine if an analytical expression of language is
>>>>>>>>>>>>>>>>> true. It is an axiom that assigned the value of Boolean
>>>>>>>>>>>>>>>>> true. It is derived by sound deduction that is
>>>>>>>>>>>>>>>>> ultimately anchored in axioms.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a axiom
>>>>>>>>>>>>>>>> you need to assume.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Analytical expressions of language are verified to be
>>>>>>>>>>>>>>> true entirely on the basis of their meaning.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>>> That is a stipulated definition just like a "given" in
>>>>>>>>>>>>> geometry.
>>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>>
>>>>>>>>>>>>> If I say that a cat is an animal and you disagree and say
>>>>>>>>>>>>> that a cat is the windows of an office building you are
>>>>>>>>>>>>> simply wrong.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Except that you can't 'stipulate' a definition for something
>>>>>>>>>>>> already defined in the system, especially to something
>>>>>>>>>>>> wrong. That violates the rules of Formal Logic.
>>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>>> "Analytic propositions are true or not true solely by virtue
>>>>>>>>>>> of their meaning"
>>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>>> logic is a branch of philosophy
>>>>>>>>>
>>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>> But is a different branch than your Epistemology with different
>>>>>>>> rules. Formal Logic, which mathematics uses defines things
>>>>>>>> differently than what you want to use.
>>>>>>>
>>>>>>> Yes and when formal logic diverges from applying truth preserving
>>>>>>> operations to premises that are known to be true (sound deductive
>>>>>>> inference) on the basis of the semantic relevance that is
>>>>>>> maintained in the syllogism:
>>>>>>>
>>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>>> then formal logic errs and diverges from truth.
>>>>>>>
>>>>>>> Logical entailment does not require premises to be true yet still
>>>>>>> requires true preserving operations to be applied on the basis of
>>>>>>> semantic relevance.
>>>>>>> Which just says that YOU don't agree with what the whole world
>>>>>>> agrees is
>>>>>> the truth.
>>>>>>
>>>>>> Find, you are on your own.
>>>>>>
>>>>>
>>>>> Things an ignoramus would say:
>>>>>> YOU have shown yourself to be incapable of understanding the basic
>>>>>> principles of Formal Logic, and are thus unqualified to discuss it.
>>>>> When everything that you learn you learn by only rote understanding
>>>>> cannot possibly get any more shallow.
>>>>>
>>>>> I am discussing the philosophical underpinnings upon which correct
>>>>> reasoning is based.
>>>>>
>>>>
>>>> Then you are doing it at the wrong place.
>>>>
>>>> If you disagree with the fundamental logic underpinnings of all of
>>>> Formal Logic, you don't start in a peripheral field. That is useless.
>>>>
>>>
>>> Philosophical foundationalism is the ultimate basis and
>>> ground-of-being of correct reasoning and logic, thus 100% directly
>>> opposite of peripheral. It cannot possibly be any less peripheral.
>>
>> You don't read very well I see. I wasn't calling the logic
>> underpinnings peripheral, I was calling Computation Theory peripheral.
>> If you want to challenge the definition of Truth used in Formal Logic,
>> you don't work in a peripheral field, which CAN'T change the
>> definition of Truth it uses, because it has inhereted it from its
>>
>
> (a) The halting problem proofs,
> (b) Gödel's 1931 incompleteness theorem,
> (c) The Tarski Undefinability theorem and
> (d) The liar paradox
> all suffer from the same foundational error.


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26716&group=comp.theory#26716

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 16:41:28 -0600
Date: Fri, 18 Feb 2022 16:41:26 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
<2KUPJ.21827$0vE9.17210@fx17.iad>
From: NoO...@NoWhere.com (olcott)
Followup-To: comp.theory
In-Reply-To: <2KUPJ.21827$0vE9.17210@fx17.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>
Lines: 415
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-KxaD64rRWqAUQm3RXWeR0rYYh42BKLdL5qxDLIiZWE4N/D88GqRYp/y3KVxzm5Grbty5Qtq/R9hZmIV!co6Vc0kAvvUUYcnxXRd1Daz2nZudg5gleB1HOyQoiZbWH5q2+8VOh50qEqPkz/6RVtTb8A39gA==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 22751
 by: olcott - Fri, 18 Feb 2022 22:41 UTC

On 2/18/2022 4:04 PM, Richard Damon wrote:
> On 2/18/22 4:39 PM, olcott wrote:
>> On 2/18/2022 3:19 PM, Richard Damon wrote:
>>>
>>> On 2/18/22 4:03 PM, olcott wrote:
>>>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>>>> On 2/18/22 2:33 PM, olcott wrote:
>>>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>>>
>>>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> animal and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> your heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is
>>>>>>>>>>>>>>>>>>>>>>>>>>>> self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort the
>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>> where this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its simulation
>>>>>>>>>>>>>>>>>>>>>>>>>> of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H
>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we have
>>>>>>>>>>>>>>>>>>>>>>>>>> said that H has
>>>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is a
>>>>>>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation of
>>>>>>>>>>>>>>>>>>>>>>>>>> its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you
>>>>>>>>>>>>>>>>>>>>>>>>>> claim does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H goes
>>>>>>>>>>>>>>>>>>>>>>>>>> to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the simple
>>>>>>>>>>>>>>>>>>>>>>>>>> running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just
>>>>>>>>>>>>>>>>>>>>>>>>>> shown that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go to
>>>>>>>>>>>>>>>>>>>>>>>>>> H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and thus
>>>>>>>>>>>>>>>>>>>>>>>>>> is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't understand
>>>>>>>>>>>>>>>>>>>>>>>>>> anything about formal
>>>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced a
>>>>>>>>>>>>>>>>>>>>>>>>>> counter example means
>>>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain
>>>>>>>>>>>>>>>>>>>>>>>>>> unsond logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning
>>>>>>>>>>>>>>>>>>>>>>>>>> of the words' and not
>>>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL
>>>>>>>>>>>>>>>>>>>>>>>>>> definitions being used to make
>>>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use
>>>>>>>>>>>>>>>>>>>>>>>>>> formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you have
>>>>>>>>>>>>>>>>>>>>>>>>>> revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an Epistemological
>>>>>>>>>>>>>>>>>>>>>>>>>> statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but
>>>>>>>>>>>>>>>>>>>>>>>>>> Philosophy, so if that is the
>>>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just
>>>>>>>>>>>>>>>>>>>>>>>>>> don't have a background to
>>>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory
>>>>>>>>>>>>>>>>>>>>>>>>>> uses.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what
>>>>>>>>>>>>>>>>>>>>>>>>>> you need to do to show
>>>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also
>>>>>>>>>>>>>>>>>>>>>>>>>> shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you clearly
>>>>>>>>>>>>>>>>>>>>>>>>>> don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with
>>>>>>>>>>>>>>>>>>>>>>>>> your time?
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> According to medical science I have terminal
>>>>>>>>>>>>>>>>>>>>>>>> cancer with little time left. I intend my HP
>>>>>>>>>>>>>>>>>>>>>>>> proof rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs
>>>>>>>>>>>>>>>>>>>>>>>> makes these proof illegitimate I have no idea
>>>>>>>>>>>>>>>>>>>>>>>> why you would be reversing course now.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and
>>>>>>>>>>>>>>>>>>>>> looking for support
>>>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness
>>>>>>>>>>>>>>>>>>>> theorem down to a single simple sentence. Try and
>>>>>>>>>>>>>>>>>>>> find a single error of substance in my paper:
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even
>>>>>>>>>>>>>>>>>>>> take a moron.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume
>>>>>>>>>>>>>>>>>>> that Truth can only be something that is proven, and
>>>>>>>>>>>>>>>>>>> then from that try to prove that Truth is only
>>>>>>>>>>>>>>>>>>> something that csn be proven.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement is
>>>>>>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>>>>>>>> statements that must either be True of False, there
>>>>>>>>>>>>>>>>>>> is no possible middle ground, but these statements
>>>>>>>>>>>>>>>>>>> have not been shown to be provable or disprovable. An
>>>>>>>>>>>>>>>>>>> example of this is the 3x+1 problem.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Every expression of language does not count as true
>>>>>>>>>>>>>>>>>> until after it has been proven. There are only two
>>>>>>>>>>>>>>>>>> ways to determine if an analytical expression of
>>>>>>>>>>>>>>>>>> language is true. It is an axiom that assigned the
>>>>>>>>>>>>>>>>>> value of Boolean true. It is derived by sound
>>>>>>>>>>>>>>>>>> deduction that is ultimately anchored in axioms.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a axiom
>>>>>>>>>>>>>>>>> you need to assume.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Analytical expressions of language are verified to be
>>>>>>>>>>>>>>>> true entirely on the basis of their meaning.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>>>> That is a stipulated definition just like a "given" in
>>>>>>>>>>>>>> geometry.
>>>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> If I say that a cat is an animal and you disagree and say
>>>>>>>>>>>>>> that a cat is the windows of an office building you are
>>>>>>>>>>>>>> simply wrong.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Except that you can't 'stipulate' a definition for
>>>>>>>>>>>>> something already defined in the system, especially to
>>>>>>>>>>>>> something wrong. That violates the rules of Formal Logic.
>>>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>>>> "Analytic propositions are true or not true solely by virtue
>>>>>>>>>>>> of their meaning"
>>>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>>>> logic is a branch of philosophy
>>>>>>>>>>
>>>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> But is a different branch than your Epistemology with different
>>>>>>>>> rules. Formal Logic, which mathematics uses defines things
>>>>>>>>> differently than what you want to use.
>>>>>>>>
>>>>>>>> Yes and when formal logic diverges from applying truth
>>>>>>>> preserving operations to premises that are known to be true
>>>>>>>> (sound deductive inference) on the basis of the semantic
>>>>>>>> relevance that is maintained in the syllogism:
>>>>>>>>
>>>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>>>> then formal logic errs and diverges from truth.
>>>>>>>>
>>>>>>>> Logical entailment does not require premises to be true yet
>>>>>>>> still requires true preserving operations to be applied on the
>>>>>>>> basis of semantic relevance.
>>>>>>>> Which just says that YOU don't agree with what the whole world
>>>>>>>> agrees is
>>>>>>> the truth.
>>>>>>>
>>>>>>> Find, you are on your own.
>>>>>>>
>>>>>>
>>>>>> Things an ignoramus would say:
>>>>>>> YOU have shown yourself to be incapable of understanding the
>>>>>>> basic principles of Formal Logic, and are thus unqualified to
>>>>>>> discuss it.
>>>>>> When everything that you learn you learn by only rote
>>>>>> understanding cannot possibly get any more shallow.
>>>>>>
>>>>>> I am discussing the philosophical underpinnings upon which correct
>>>>>> reasoning is based.
>>>>>>
>>>>>
>>>>> Then you are doing it at the wrong place.
>>>>>
>>>>> If you disagree with the fundamental logic underpinnings of all of
>>>>> Formal Logic, you don't start in a peripheral field. That is useless.
>>>>>
>>>>
>>>> Philosophical foundationalism is the ultimate basis and
>>>> ground-of-being of correct reasoning and logic, thus 100% directly
>>>> opposite of peripheral. It cannot possibly be any less peripheral.
>>>
>>> You don't read very well I see. I wasn't calling the logic
>>> underpinnings peripheral, I was calling Computation Theory
>>> peripheral. If you want to challenge the definition of Truth used in
>>> Formal Logic, you don't work in a peripheral field, which CAN'T
>>> change the definition of Truth it uses, because it has inhereted it
>>> from its
>>>
>>
>> (a) The halting problem proofs,
>> (b) Gödel's 1931 incompleteness theorem,
>> (c) The Tarski Undefinability theorem and
>> (d) The liar paradox
>> all suffer from the same foundational error.
>
> I will point out that the liar's paradox is a completely DIFFERENT sort
> of issue,
>
>>
>> When analytical truth is understood to be connected sets of true
>> statements that necessarily derive true conclusions then all four of
>> the above examples lose their basis and cease to exist.
>
> Except that it doesn't. Formal Logic IS built on the concept that you
> can only prove a conclusion from True Premises.
>
> What is isn't built on that Truth has to be proven. Something can be
> True even if not proven, but if you can't prove it to be true, you can't
> use it for the basis of a further proof.
>


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<0LVPJ.37393$f2a5.202@fx48.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26718&group=comp.theory#26718

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!3.eu.feeder.erje.net!feeder.erje.net!npeer.as286.net!npeer-ng0.as286.net!peer02.ams1!peer.ams1.xlned.com!news.xlned.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx48.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
<2KUPJ.21827$0vE9.17210@fx17.iad>
<1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 449
Message-ID: <0LVPJ.37393$f2a5.202@fx48.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 18:14:04 -0500
X-Received-Bytes: 24526
 by: Richard Damon - Fri, 18 Feb 2022 23:14 UTC

On 2/18/22 5:41 PM, olcott wrote:
> On 2/18/2022 4:04 PM, Richard Damon wrote:
>> On 2/18/22 4:39 PM, olcott wrote:
>>> On 2/18/2022 3:19 PM, Richard Damon wrote:
>>>>
>>>> On 2/18/22 4:03 PM, olcott wrote:
>>>>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>>>>> On 2/18/22 2:33 PM, olcott wrote:
>>>>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>>>>
>>>>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> animal and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> your heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>>>>> the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>> where this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its
>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of H
>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we
>>>>>>>>>>>>>>>>>>>>>>>>>>> have said that H has
>>>>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is
>>>>>>>>>>>>>>>>>>>>>>>>>>> a non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you
>>>>>>>>>>>>>>>>>>>>>>>>>>> claim does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H
>>>>>>>>>>>>>>>>>>>>>>>>>>> goes to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the
>>>>>>>>>>>>>>>>>>>>>>>>>>> simple running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just
>>>>>>>>>>>>>>>>>>>>>>>>>>> shown that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go
>>>>>>>>>>>>>>>>>>>>>>>>>>> to H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and
>>>>>>>>>>>>>>>>>>>>>>>>>>> thus is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't understand
>>>>>>>>>>>>>>>>>>>>>>>>>>> anything about formal
>>>>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced
>>>>>>>>>>>>>>>>>>>>>>>>>>> a counter example means
>>>>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain
>>>>>>>>>>>>>>>>>>>>>>>>>>> unsond logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning
>>>>>>>>>>>>>>>>>>>>>>>>>>> of the words' and not
>>>>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL
>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions being used to make
>>>>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use
>>>>>>>>>>>>>>>>>>>>>>>>>>> formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you have
>>>>>>>>>>>>>>>>>>>>>>>>>>> revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an
>>>>>>>>>>>>>>>>>>>>>>>>>>> Epistemological statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but
>>>>>>>>>>>>>>>>>>>>>>>>>>> Philosophy, so if that is the
>>>>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just
>>>>>>>>>>>>>>>>>>>>>>>>>>> don't have a background to
>>>>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation Theory
>>>>>>>>>>>>>>>>>>>>>>>>>>> uses.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what
>>>>>>>>>>>>>>>>>>>>>>>>>>> you need to do to show
>>>>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also
>>>>>>>>>>>>>>>>>>>>>>>>>>> shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you
>>>>>>>>>>>>>>>>>>>>>>>>>>> clearly don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with
>>>>>>>>>>>>>>>>>>>>>>>>>> your time?
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> According to medical science I have terminal
>>>>>>>>>>>>>>>>>>>>>>>>> cancer with little time left. I intend my HP
>>>>>>>>>>>>>>>>>>>>>>>>> proof rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs
>>>>>>>>>>>>>>>>>>>>>>>>> makes these proof illegitimate I have no idea
>>>>>>>>>>>>>>>>>>>>>>>>> why you would be reversing course now.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and
>>>>>>>>>>>>>>>>>>>>>> looking for support
>>>>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness
>>>>>>>>>>>>>>>>>>>>> theorem down to a single simple sentence. Try and
>>>>>>>>>>>>>>>>>>>>> find a single error of substance in my paper:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even
>>>>>>>>>>>>>>>>>>>>> take a moron.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume
>>>>>>>>>>>>>>>>>>>> that Truth can only be something that is proven, and
>>>>>>>>>>>>>>>>>>>> then from that try to prove that Truth is only
>>>>>>>>>>>>>>>>>>>> something that csn be proven.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement is
>>>>>>>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>>>>>>>>> statements that must either be True of False, there
>>>>>>>>>>>>>>>>>>>> is no possible middle ground, but these statements
>>>>>>>>>>>>>>>>>>>> have not been shown to be provable or disprovable.
>>>>>>>>>>>>>>>>>>>> An example of this is the 3x+1 problem.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Every expression of language does not count as true
>>>>>>>>>>>>>>>>>>> until after it has been proven. There are only two
>>>>>>>>>>>>>>>>>>> ways to determine if an analytical expression of
>>>>>>>>>>>>>>>>>>> language is true. It is an axiom that assigned the
>>>>>>>>>>>>>>>>>>> value of Boolean true. It is derived by sound
>>>>>>>>>>>>>>>>>>> deduction that is ultimately anchored in axioms.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a axiom
>>>>>>>>>>>>>>>>>> you need to assume.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Analytical expressions of language are verified to be
>>>>>>>>>>>>>>>>> true entirely on the basis of their meaning.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>>>>> That is a stipulated definition just like a "given" in
>>>>>>>>>>>>>>> geometry.
>>>>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If I say that a cat is an animal and you disagree and say
>>>>>>>>>>>>>>> that a cat is the windows of an office building you are
>>>>>>>>>>>>>>> simply wrong.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Except that you can't 'stipulate' a definition for
>>>>>>>>>>>>>> something already defined in the system, especially to
>>>>>>>>>>>>>> something wrong. That violates the rules of Formal Logic.
>>>>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>>>>> "Analytic propositions are true or not true solely by
>>>>>>>>>>>>> virtue of their meaning"
>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>>>>> logic is a branch of philosophy
>>>>>>>>>>>
>>>>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> But is a different branch than your Epistemology with
>>>>>>>>>> different rules. Formal Logic, which mathematics uses defines
>>>>>>>>>> things differently than what you want to use.
>>>>>>>>>
>>>>>>>>> Yes and when formal logic diverges from applying truth
>>>>>>>>> preserving operations to premises that are known to be true
>>>>>>>>> (sound deductive inference) on the basis of the semantic
>>>>>>>>> relevance that is maintained in the syllogism:
>>>>>>>>>
>>>>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>>>>> then formal logic errs and diverges from truth.
>>>>>>>>>
>>>>>>>>> Logical entailment does not require premises to be true yet
>>>>>>>>> still requires true preserving operations to be applied on the
>>>>>>>>> basis of semantic relevance.
>>>>>>>>> Which just says that YOU don't agree with what the whole world
>>>>>>>>> agrees is
>>>>>>>> the truth.
>>>>>>>>
>>>>>>>> Find, you are on your own.
>>>>>>>>
>>>>>>>
>>>>>>> Things an ignoramus would say:
>>>>>>>> YOU have shown yourself to be incapable of understanding the
>>>>>>>> basic principles of Formal Logic, and are thus unqualified to
>>>>>>>> discuss it.
>>>>>>> When everything that you learn you learn by only rote
>>>>>>> understanding cannot possibly get any more shallow.
>>>>>>>
>>>>>>> I am discussing the philosophical underpinnings upon which
>>>>>>> correct reasoning is based.
>>>>>>>
>>>>>>
>>>>>> Then you are doing it at the wrong place.
>>>>>>
>>>>>> If you disagree with the fundamental logic underpinnings of all of
>>>>>> Formal Logic, you don't start in a peripheral field. That is useless.
>>>>>>
>>>>>
>>>>> Philosophical foundationalism is the ultimate basis and
>>>>> ground-of-being of correct reasoning and logic, thus 100% directly
>>>>> opposite of peripheral. It cannot possibly be any less peripheral.
>>>>
>>>> You don't read very well I see. I wasn't calling the logic
>>>> underpinnings peripheral, I was calling Computation Theory
>>>> peripheral. If you want to challenge the definition of Truth used in
>>>> Formal Logic, you don't work in a peripheral field, which CAN'T
>>>> change the definition of Truth it uses, because it has inhereted it
>>>> from its
>>>>
>>>
>>> (a) The halting problem proofs,
>>> (b) Gödel's 1931 incompleteness theorem,
>>> (c) The Tarski Undefinability theorem and
>>> (d) The liar paradox
>>> all suffer from the same foundational error.
>>
>> I will point out that the liar's paradox is a completely DIFFERENT
>> sort of issue,
>>
>>>
>>> When analytical truth is understood to be connected sets of true
>>> statements that necessarily derive true conclusions then all four of
>>> the above examples lose their basis and cease to exist.
>>
>> Except that it doesn't. Formal Logic IS built on the concept that you
>> can only prove a conclusion from True Premises.
>>
>> What is isn't built on that Truth has to be proven. Something can be
>> True even if not proven, but if you can't prove it to be true, you
>> can't use it for the basis of a further proof.
>>
>
> Within the body of analytic knowledge an expression of language is only
> true when a connected set of true expressions prove that it is true,
> thus true and unprovable cannot possibly co-exist.


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<c5ydndJBYJQ8sY3_nZ2dnUU7-TXNnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26719&group=comp.theory#26719

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 17:32:49 -0600
Date: Fri, 18 Feb 2022 17:32:46 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
<2KUPJ.21827$0vE9.17210@fx17.iad>
<1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>
<0LVPJ.37393$f2a5.202@fx48.iad>
Followup-To: comp.theory
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <0LVPJ.37393$f2a5.202@fx48.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <c5ydndJBYJQ8sY3_nZ2dnUU7-TXNnZ2d@giganews.com>
Lines: 394
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-XtRWxevVYAhOxwbaSWVcWtul5V6OrxLzSFmcMQ1B5SkT/eMChZXDdv/5hpi70lxi8n3D25a4DSvYvka!64t2/dDEsG675/1K7zfAgCnAq3mv9+PSTLqR2uVj/Odu6TJDKJnLHtZ4x9WKKIqZYgk8mSBA7g==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 22741
 by: olcott - Fri, 18 Feb 2022 23:32 UTC

On 2/18/2022 5:14 PM, Richard Damon wrote:
> On 2/18/22 5:41 PM, olcott wrote:
>> On 2/18/2022 4:04 PM, Richard Damon wrote:
>>> On 2/18/22 4:39 PM, olcott wrote:
>>>> On 2/18/2022 3:19 PM, Richard Damon wrote:
>>>>>
>>>>> On 2/18/22 4:03 PM, olcott wrote:
>>>>>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>>>>>> On 2/18/22 2:33 PM, olcott wrote:
>>>>>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>>>>>
>>>>>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> must abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> animal and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to know
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means anything
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> your heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> where this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its
>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of
>>>>>>>>>>>>>>>>>>>>>>>>>>>> H <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we
>>>>>>>>>>>>>>>>>>>>>>>>>>>> have said that H has
>>>>>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H"> is
>>>>>>>>>>>>>>>>>>>>>>>>>>>> a non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>> claim does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H
>>>>>>>>>>>>>>>>>>>>>>>>>>>> goes to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just
>>>>>>>>>>>>>>>>>>>>>>>>>>>> shown that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go
>>>>>>>>>>>>>>>>>>>>>>>>>>>> to H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand anything about formal
>>>>>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't produced
>>>>>>>>>>>>>>>>>>>>>>>>>>>> a counter example means
>>>>>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain
>>>>>>>>>>>>>>>>>>>>>>>>>>>> unsond logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the meaning
>>>>>>>>>>>>>>>>>>>>>>>>>>>> of the words' and not
>>>>>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL
>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions being used to make
>>>>>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude rhetorical
>>>>>>>>>>>>>>>>>>>>>>>>>>>> arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use
>>>>>>>>>>>>>>>>>>>>>>>>>>>> formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you
>>>>>>>>>>>>>>>>>>>>>>>>>>>> have revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Epistemological statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Philosophy, so if that is the
>>>>>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just
>>>>>>>>>>>>>>>>>>>>>>>>>>>> don't have a background to
>>>>>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Theory uses.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what
>>>>>>>>>>>>>>>>>>>>>>>>>>>> you need to do to show
>>>>>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also
>>>>>>>>>>>>>>>>>>>>>>>>>>>> shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you
>>>>>>>>>>>>>>>>>>>>>>>>>>>> clearly don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do with
>>>>>>>>>>>>>>>>>>>>>>>>>>> your time?
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> According to medical science I have terminal
>>>>>>>>>>>>>>>>>>>>>>>>>> cancer with little time left. I intend my HP
>>>>>>>>>>>>>>>>>>>>>>>>>> proof rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the pathological
>>>>>>>>>>>>>>>>>>>>>>>>>> self-reference of the halting problem proofs
>>>>>>>>>>>>>>>>>>>>>>>>>> makes these proof illegitimate I have no idea
>>>>>>>>>>>>>>>>>>>>>>>>>> why you would be reversing course now.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and
>>>>>>>>>>>>>>>>>>>>>>> looking for support
>>>>>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness
>>>>>>>>>>>>>>>>>>>>>> theorem down to a single simple sentence. Try and
>>>>>>>>>>>>>>>>>>>>>> find a single error of substance in my paper:
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even
>>>>>>>>>>>>>>>>>>>>>> take a moron.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume
>>>>>>>>>>>>>>>>>>>>> that Truth can only be something that is proven,
>>>>>>>>>>>>>>>>>>>>> and then from that try to prove that Truth is only
>>>>>>>>>>>>>>>>>>>>> something that csn be proven.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement is
>>>>>>>>>>>>>>>>>>>>> invalid.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>>>>>>>>>> statements that must either be True of False, there
>>>>>>>>>>>>>>>>>>>>> is no possible middle ground, but these statements
>>>>>>>>>>>>>>>>>>>>> have not been shown to be provable or disprovable.
>>>>>>>>>>>>>>>>>>>>> An example of this is the 3x+1 problem.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Every expression of language does not count as true
>>>>>>>>>>>>>>>>>>>> until after it has been proven. There are only two
>>>>>>>>>>>>>>>>>>>> ways to determine if an analytical expression of
>>>>>>>>>>>>>>>>>>>> language is true. It is an axiom that assigned the
>>>>>>>>>>>>>>>>>>>> value of Boolean true. It is derived by sound
>>>>>>>>>>>>>>>>>>>> deduction that is ultimately anchored in axioms.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a axiom
>>>>>>>>>>>>>>>>>>> you need to assume.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Analytical expressions of language are verified to be
>>>>>>>>>>>>>>>>>> true entirely on the basis of their meaning.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>>>>>> That is a stipulated definition just like a "given" in
>>>>>>>>>>>>>>>> geometry.
>>>>>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> If I say that a cat is an animal and you disagree and
>>>>>>>>>>>>>>>> say that a cat is the windows of an office building you
>>>>>>>>>>>>>>>> are simply wrong.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Except that you can't 'stipulate' a definition for
>>>>>>>>>>>>>>> something already defined in the system, especially to
>>>>>>>>>>>>>>> something wrong. That violates the rules of Formal Logic.
>>>>>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>>>>>> "Analytic propositions are true or not true solely by
>>>>>>>>>>>>>> virtue of their meaning"
>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>>>>>> logic is a branch of philosophy
>>>>>>>>>>>>
>>>>>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> But is a different branch than your Epistemology with
>>>>>>>>>>> different rules. Formal Logic, which mathematics uses defines
>>>>>>>>>>> things differently than what you want to use.
>>>>>>>>>>
>>>>>>>>>> Yes and when formal logic diverges from applying truth
>>>>>>>>>> preserving operations to premises that are known to be true
>>>>>>>>>> (sound deductive inference) on the basis of the semantic
>>>>>>>>>> relevance that is maintained in the syllogism:
>>>>>>>>>>
>>>>>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>>>>>> then formal logic errs and diverges from truth.
>>>>>>>>>>
>>>>>>>>>> Logical entailment does not require premises to be true yet
>>>>>>>>>> still requires true preserving operations to be applied on the
>>>>>>>>>> basis of semantic relevance.
>>>>>>>>>> Which just says that YOU don't agree with what the whole world
>>>>>>>>>> agrees is
>>>>>>>>> the truth.
>>>>>>>>>
>>>>>>>>> Find, you are on your own.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Things an ignoramus would say:
>>>>>>>>> YOU have shown yourself to be incapable of understanding the
>>>>>>>>> basic principles of Formal Logic, and are thus unqualified to
>>>>>>>>> discuss it.
>>>>>>>> When everything that you learn you learn by only rote
>>>>>>>> understanding cannot possibly get any more shallow.
>>>>>>>>
>>>>>>>> I am discussing the philosophical underpinnings upon which
>>>>>>>> correct reasoning is based.
>>>>>>>>
>>>>>>>
>>>>>>> Then you are doing it at the wrong place.
>>>>>>>
>>>>>>> If you disagree with the fundamental logic underpinnings of all
>>>>>>> of Formal Logic, you don't start in a peripheral field. That is
>>>>>>> useless.
>>>>>>>
>>>>>>
>>>>>> Philosophical foundationalism is the ultimate basis and
>>>>>> ground-of-being of correct reasoning and logic, thus 100% directly
>>>>>> opposite of peripheral. It cannot possibly be any less peripheral.
>>>>>
>>>>> You don't read very well I see. I wasn't calling the logic
>>>>> underpinnings peripheral, I was calling Computation Theory
>>>>> peripheral. If you want to challenge the definition of Truth used
>>>>> in Formal Logic, you don't work in a peripheral field, which CAN'T
>>>>> change the definition of Truth it uses, because it has inhereted it
>>>>> from its
>>>>>
>>>>
>>>> (a) The halting problem proofs,
>>>> (b) Gödel's 1931 incompleteness theorem,
>>>> (c) The Tarski Undefinability theorem and
>>>> (d) The liar paradox
>>>> all suffer from the same foundational error.
>>>
>>> I will point out that the liar's paradox is a completely DIFFERENT
>>> sort of issue,
>>>
>>>>
>>>> When analytical truth is understood to be connected sets of true
>>>> statements that necessarily derive true conclusions then all four of
>>>> the above examples lose their basis and cease to exist.
>>>
>>> Except that it doesn't. Formal Logic IS built on the concept that you
>>> can only prove a conclusion from True Premises.
>>>
>>> What is isn't built on that Truth has to be proven. Something can be
>>> True even if not proven, but if you can't prove it to be true, you
>>> can't use it for the basis of a further proof.
>>>
>>
>> Within the body of analytic knowledge an expression of language is
>> only true when a connected set of true expressions prove that it is
>> true, thus true and unprovable cannot possibly co-exist.
>
> Then the body of analytic knowledge (or at least your interpreation of
> it) can't deal with the body of knowledge of Mathematics, (and related
> logic families) as they allow for a statement to be True without needing
> to be connected to a proof. PERIOD.
Lets proceed from here. How do we know that a mathematical expression is
true aside from its proof that it is true?


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]

<20220218234235.00006cd9@reddwarf.jmc>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26720&group=comp.theory#26720

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!aioe.org!feeder1.feed.usenet.farm!feed.usenet.farm!peer02.ams4!peer.am4.highwinds-media.com!news.highwinds-media.com!fx01.ams4.POSTED!not-for-mail
From: flib...@reddwarf.jmc (Mr Flibble)
Newsgroups: comp.theory
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ]
Message-ID: <20220218234235.00006cd9@reddwarf.jmc>
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<3KidneXhytFmM5D_nZ2dnUU7-UPNnZ2d@giganews.com>
<QwiPJ.68137$H_t7.60847@fx40.iad>
<pbGdnXumaLMjIZD_nZ2dnUU7-SnNnZ2d@giganews.com>
<CfjPJ.16883$K0Ga.14998@fx10.iad>
<NZednWhW8to3XpD_nZ2dnUU7-VOdnZ2d@giganews.com>
<7IjPJ.12295$XFM9.7011@fx18.iad>
<XICdnT_q4aIVV5D_nZ2dnUU7-dvNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad>
<20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad>
<sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
Organization: Jupiter Mining Corp
X-Newsreader: Claws Mail 3.17.8 (GTK+ 2.24.33; x86_64-w64-mingw32)
MIME-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Lines: 18
X-Complaints-To: abuse@eweka.nl
NNTP-Posting-Date: Fri, 18 Feb 2022 23:42:34 UTC
Date: Fri, 18 Feb 2022 23:42:35 +0000
X-Received-Bytes: 2029
 by: Mr Flibble - Fri, 18 Feb 2022 23:42 UTC

On Thu, 17 Feb 2022 23:21:27 -0500
Richard Damon <Richard@Damon-Family.org> wrote:

> Again, this seems to make the logical error of assuming the
> conclusion, by assuming something as axiomatic that has not been
> accepted in the field as an axiom.
>
> When dealing with FORMAL logic systems, you are not allowed to
> introduce 'new' axioms.
>
> FAIL.
>

Nonsense; a new axiom can be derived from one or more preexisting
axioms.

/Flibble

Re: Concise refutation of halting problem proofs V62 [ my legacy ]

<1kWPJ.67697$Lbb6.7982@fx45.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26721&group=comp.theory#26721

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!aioe.org!feeder1.feed.usenet.farm!feed.usenet.farm!news-out.netnews.com!news.alt.net!fdc2.netnews.com!peer02.ams1!peer.ams1.xlned.com!news.xlned.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx45.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ]
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<3KidneXhytFmM5D_nZ2dnUU7-UPNnZ2d@giganews.com>
<QwiPJ.68137$H_t7.60847@fx40.iad>
<pbGdnXumaLMjIZD_nZ2dnUU7-SnNnZ2d@giganews.com>
<CfjPJ.16883$K0Ga.14998@fx10.iad>
<NZednWhW8to3XpD_nZ2dnUU7-VOdnZ2d@giganews.com>
<7IjPJ.12295$XFM9.7011@fx18.iad>
<XICdnT_q4aIVV5D_nZ2dnUU7-dvNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad> <20220218234235.00006cd9@reddwarf.jmc>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <20220218234235.00006cd9@reddwarf.jmc>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Lines: 23
Message-ID: <1kWPJ.67697$Lbb6.7982@fx45.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 18:53:33 -0500
X-Received-Bytes: 2569
 by: Richard Damon - Fri, 18 Feb 2022 23:53 UTC

On 2/18/22 6:42 PM, Mr Flibble wrote:
> On Thu, 17 Feb 2022 23:21:27 -0500
> Richard Damon <Richard@Damon-Family.org> wrote:
>
>> Again, this seems to make the logical error of assuming the
>> conclusion, by assuming something as axiomatic that has not been
>> accepted in the field as an axiom.
>>
>> When dealing with FORMAL logic systems, you are not allowed to
>> introduce 'new' axioms.
>>
>> FAIL.
>>
>
> Nonsense; a new axiom can be derived from one or more preexisting
> axioms.
>
> /Flibble
>

Then they are not actually axioms, but proved propositions.

Axioms are the initial given to be true statements that start a Field.

Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<OlWPJ.67698$Lbb6.53667@fx45.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26722&group=comp.theory#26722

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!aioe.org!feeder5.feed.usenet.farm!feeder1.feed.usenet.farm!feed.usenet.farm!newsfeed.xs4all.nl!newsfeed7.news.xs4all.nl!news.uzoreto.com!news-out.netnews.com!news.alt.net!fdc2.netnews.com!peer03.ams1!peer.ams1.xlned.com!news.xlned.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx45.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
<2KUPJ.21827$0vE9.17210@fx17.iad>
<1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>
<0LVPJ.37393$f2a5.202@fx48.iad>
<c5ydndJBYJQ8sY3_nZ2dnUU7-TXNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <c5ydndJBYJQ8sY3_nZ2dnUU7-TXNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 397
Message-ID: <OlWPJ.67698$Lbb6.53667@fx45.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 18:55:26 -0500
X-Received-Bytes: 22887
 by: Richard Damon - Fri, 18 Feb 2022 23:55 UTC

On 2/18/22 6:32 PM, olcott wrote:
> On 2/18/2022 5:14 PM, Richard Damon wrote:
>> On 2/18/22 5:41 PM, olcott wrote:
>>> On 2/18/2022 4:04 PM, Richard Damon wrote:
>>>> On 2/18/22 4:39 PM, olcott wrote:
>>>>> On 2/18/2022 3:19 PM, Richard Damon wrote:
>>>>>>
>>>>>> On 2/18/22 4:03 PM, olcott wrote:
>>>>>>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>>>>>>> On 2/18/22 2:33 PM, olcott wrote:
>>>>>>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>>>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> must abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> animal and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the difference
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> anything to agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep in
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> your heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> where this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have said that H has
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is a non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was wrong.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> claim does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> goes to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> shown that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also go
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand anything about formal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> produced a counter example means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> unsond logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> meaning of the words' and not
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions being used to make
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> rhetorical arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Epistemological statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Philosophy, so if that is the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> don't have a background to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Theory uses.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand what
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you need to do to show
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which also
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> clearly don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do
>>>>>>>>>>>>>>>>>>>>>>>>>>>> with your time?
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> According to medical science I have terminal
>>>>>>>>>>>>>>>>>>>>>>>>>>> cancer with little time left. I intend my HP
>>>>>>>>>>>>>>>>>>>>>>>>>>> proof rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the
>>>>>>>>>>>>>>>>>>>>>>>>>>> pathological self-reference of the halting
>>>>>>>>>>>>>>>>>>>>>>>>>>> problem proofs makes these proof illegitimate
>>>>>>>>>>>>>>>>>>>>>>>>>>> I have no idea why you would be reversing
>>>>>>>>>>>>>>>>>>>>>>>>>>> course now.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and
>>>>>>>>>>>>>>>>>>>>>>>> looking for support
>>>>>>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness
>>>>>>>>>>>>>>>>>>>>>>> theorem down to a single simple sentence. Try and
>>>>>>>>>>>>>>>>>>>>>>> find a single error of substance in my paper:
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't even
>>>>>>>>>>>>>>>>>>>>>>> take a moron.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume
>>>>>>>>>>>>>>>>>>>>>> that Truth can only be something that is proven,
>>>>>>>>>>>>>>>>>>>>>> and then from that try to prove that Truth is only
>>>>>>>>>>>>>>>>>>>>>> something that csn be proven.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement
>>>>>>>>>>>>>>>>>>>>>> is invalid.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> For example, in mathematics, there are a number of
>>>>>>>>>>>>>>>>>>>>>> statements that must either be True of False,
>>>>>>>>>>>>>>>>>>>>>> there is no possible middle ground, but these
>>>>>>>>>>>>>>>>>>>>>> statements have not been shown to be provable or
>>>>>>>>>>>>>>>>>>>>>> disprovable. An example of this is the 3x+1 problem.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Every expression of language does not count as true
>>>>>>>>>>>>>>>>>>>>> until after it has been proven. There are only two
>>>>>>>>>>>>>>>>>>>>> ways to determine if an analytical expression of
>>>>>>>>>>>>>>>>>>>>> language is true. It is an axiom that assigned the
>>>>>>>>>>>>>>>>>>>>> value of Boolean true. It is derived by sound
>>>>>>>>>>>>>>>>>>>>> deduction that is ultimately anchored in axioms.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a
>>>>>>>>>>>>>>>>>>>> axiom you need to assume.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Analytical expressions of language are verified to be
>>>>>>>>>>>>>>>>>>> true entirely on the basis of their meaning.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>>>>>>> That is a stipulated definition just like a "given" in
>>>>>>>>>>>>>>>>> geometry.
>>>>>>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> If I say that a cat is an animal and you disagree and
>>>>>>>>>>>>>>>>> say that a cat is the windows of an office building you
>>>>>>>>>>>>>>>>> are simply wrong.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Except that you can't 'stipulate' a definition for
>>>>>>>>>>>>>>>> something already defined in the system, especially to
>>>>>>>>>>>>>>>> something wrong. That violates the rules of Formal Logic.
>>>>>>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>>>>>>> "Analytic propositions are true or not true solely by
>>>>>>>>>>>>>>> virtue of their meaning"
>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>>>>>>> logic is a branch of philosophy
>>>>>>>>>>>>>
>>>>>>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> But is a different branch than your Epistemology with
>>>>>>>>>>>> different rules. Formal Logic, which mathematics uses
>>>>>>>>>>>> defines things differently than what you want to use.
>>>>>>>>>>>
>>>>>>>>>>> Yes and when formal logic diverges from applying truth
>>>>>>>>>>> preserving operations to premises that are known to be true
>>>>>>>>>>> (sound deductive inference) on the basis of the semantic
>>>>>>>>>>> relevance that is maintained in the syllogism:
>>>>>>>>>>>
>>>>>>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>>>>>>> then formal logic errs and diverges from truth.
>>>>>>>>>>>
>>>>>>>>>>> Logical entailment does not require premises to be true yet
>>>>>>>>>>> still requires true preserving operations to be applied on
>>>>>>>>>>> the basis of semantic relevance.
>>>>>>>>>>> Which just says that YOU don't agree with what the whole
>>>>>>>>>>> world agrees is
>>>>>>>>>> the truth.
>>>>>>>>>>
>>>>>>>>>> Find, you are on your own.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Things an ignoramus would say:
>>>>>>>>>> YOU have shown yourself to be incapable of understanding the
>>>>>>>>>> basic principles of Formal Logic, and are thus unqualified to
>>>>>>>>>> discuss it.
>>>>>>>>> When everything that you learn you learn by only rote
>>>>>>>>> understanding cannot possibly get any more shallow.
>>>>>>>>>
>>>>>>>>> I am discussing the philosophical underpinnings upon which
>>>>>>>>> correct reasoning is based.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Then you are doing it at the wrong place.
>>>>>>>>
>>>>>>>> If you disagree with the fundamental logic underpinnings of all
>>>>>>>> of Formal Logic, you don't start in a peripheral field. That is
>>>>>>>> useless.
>>>>>>>>
>>>>>>>
>>>>>>> Philosophical foundationalism is the ultimate basis and
>>>>>>> ground-of-being of correct reasoning and logic, thus 100%
>>>>>>> directly opposite of peripheral. It cannot possibly be any less
>>>>>>> peripheral.
>>>>>>
>>>>>> You don't read very well I see. I wasn't calling the logic
>>>>>> underpinnings peripheral, I was calling Computation Theory
>>>>>> peripheral. If you want to challenge the definition of Truth used
>>>>>> in Formal Logic, you don't work in a peripheral field, which CAN'T
>>>>>> change the definition of Truth it uses, because it has inhereted
>>>>>> it from its
>>>>>>
>>>>>
>>>>> (a) The halting problem proofs,
>>>>> (b) Gödel's 1931 incompleteness theorem,
>>>>> (c) The Tarski Undefinability theorem and
>>>>> (d) The liar paradox
>>>>> all suffer from the same foundational error.
>>>>
>>>> I will point out that the liar's paradox is a completely DIFFERENT
>>>> sort of issue,
>>>>
>>>>>
>>>>> When analytical truth is understood to be connected sets of true
>>>>> statements that necessarily derive true conclusions then all four
>>>>> of the above examples lose their basis and cease to exist.
>>>>
>>>> Except that it doesn't. Formal Logic IS built on the concept that
>>>> you can only prove a conclusion from True Premises.
>>>>
>>>> What is isn't built on that Truth has to be proven. Something can be
>>>> True even if not proven, but if you can't prove it to be true, you
>>>> can't use it for the basis of a further proof.
>>>>
>>>
>>> Within the body of analytic knowledge an expression of language is
>>> only true when a connected set of true expressions prove that it is
>>> true, thus true and unprovable cannot possibly co-exist.
>>
>> Then the body of analytic knowledge (or at least your interpreation of
>> it) can't deal with the body of knowledge of Mathematics, (and related
>> logic families) as they allow for a statement to be True without
>> needing to be connected to a proof. PERIOD.
> Lets proceed from here. How do we know that a mathematical expression is
> true aside from its proof that it is true?
>


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]

<ePadnZx8AoKir43_nZ2dnUU7-W_NnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26723&group=comp.theory#26723

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 17:56:47 -0600
Date: Fri, 18 Feb 2022 17:56:44 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ]
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<3KidneXhytFmM5D_nZ2dnUU7-UPNnZ2d@giganews.com>
<QwiPJ.68137$H_t7.60847@fx40.iad>
<pbGdnXumaLMjIZD_nZ2dnUU7-SnNnZ2d@giganews.com>
<CfjPJ.16883$K0Ga.14998@fx10.iad>
<NZednWhW8to3XpD_nZ2dnUU7-VOdnZ2d@giganews.com>
<7IjPJ.12295$XFM9.7011@fx18.iad>
<XICdnT_q4aIVV5D_nZ2dnUU7-dvNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad> <20220218234235.00006cd9@reddwarf.jmc>
From: NoO...@NoWhere.com (olcott)
Followup-To: comp.theory
In-Reply-To: <20220218234235.00006cd9@reddwarf.jmc>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <ePadnZx8AoKir43_nZ2dnUU7-W_NnZ2d@giganews.com>
Lines: 47
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-Ks4qGJD5tIHKc0d03OkYmlb6YeMmVasiWpH3cBMYKz9aAEv7/9QWYU3r1Anl6aGYG4jjew83tCoegy4!lia9eSu99OnulHPZXY8MiufqaLQj9gbkfdxUUK5/lYcbBNZ0IS+8GIFIAPZWEecwyKIyQWPMoQ==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 3759
 by: olcott - Fri, 18 Feb 2022 23:56 UTC

On 2/18/2022 5:42 PM, Mr Flibble wrote:
> On Thu, 17 Feb 2022 23:21:27 -0500
> Richard Damon <Richard@Damon-Family.org> wrote:
>
>> Again, this seems to make the logical error of assuming the
>> conclusion, by assuming something as axiomatic that has not been
>> accepted in the field as an axiom.
>>
>> When dealing with FORMAL logic systems, you are not allowed to
>> introduce 'new' axioms.
>>
>> FAIL.
>>
>
> Nonsense; a new axiom can be derived from one or more preexisting
> axioms.
>
> /Flibble
>

Validity and Soundness
A deductive argument is said to be valid if and only if it takes a form
that makes it impossible for the premises to be true and the conclusion
nevertheless to be false. https://iep.utm.edu/val-snd/

cows are not dogs
cows are not airplanes
∴ butterflies have wings

The above definition of a valid argument makes the above conclusion
logically entailed by its premises even though the conclusion is totally
unrelated to its premises.

The key change that I am making is to the above definition of valid
inference is that I am changing it back to the way it was before logic
diverged from the model of the syllogism. (semantically related is
required).

A deductive argument is said to be valid if and only if it takes a form
that makes the conclusion a necessary consequence of its premises.

--
Copyright 2021 Pete Olcott

Talent hits a target no one else can hit;
Genius hits a target no one else can see.
Arthur Schopenhauer

Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<HOmdndtjt9Xhro3_nZ2dnUU7-S_NnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26724&group=comp.theory#26724

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 18:02:04 -0600
Date: Fri, 18 Feb 2022 18:02:00 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
<2KUPJ.21827$0vE9.17210@fx17.iad>
<1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>
<0LVPJ.37393$f2a5.202@fx48.iad>
<c5ydndJBYJQ8sY3_nZ2dnUU7-TXNnZ2d@giganews.com>
<OlWPJ.67698$Lbb6.53667@fx45.iad>
Followup-To: comp.theory
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <OlWPJ.67698$Lbb6.53667@fx45.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <HOmdndtjt9Xhro3_nZ2dnUU7-S_NnZ2d@giganews.com>
Lines: 412
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-esYWYfj2ev9RlgP7jMTis2umf+5jSZKHiCb6kD7/udRxLJyjgf+x+kct5SQWCwRu+YlW/aRGOikpi4x!Yq4k2Yglxt5WJ/2MFQtChT7nxQFCPU6U24pCr9suruM1RsVS/XqFXh9xEOvadBWegiMI7cqSHw==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 24091
 by: olcott - Sat, 19 Feb 2022 00:02 UTC

On 2/18/2022 5:55 PM, Richard Damon wrote:
> On 2/18/22 6:32 PM, olcott wrote:
>> On 2/18/2022 5:14 PM, Richard Damon wrote:
>>> On 2/18/22 5:41 PM, olcott wrote:
>>>> On 2/18/2022 4:04 PM, Richard Damon wrote:
>>>>> On 2/18/22 4:39 PM, olcott wrote:
>>>>>> On 2/18/2022 3:19 PM, Richard Damon wrote:
>>>>>>>
>>>>>>> On 2/18/22 4:03 PM, olcott wrote:
>>>>>>>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>>>>>>>> On 2/18/22 2:33 PM, olcott wrote:
>>>>>>>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>>>>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>>>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> must abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the right
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> animal and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> difference betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you have proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> anything to agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> in your heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must abort
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> where this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of H <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have said that H has
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is a non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> claim does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> goes to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> shown that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> go to H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand anything about formal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> produced a counter example means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> unsond logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> meaning of the words' and not
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions being used to make
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> rhetorical arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand what you are
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to use
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Epistemological statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Philosophy, so if that is the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you just
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> don't have a background to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Theory uses.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> what you need to do to show
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> also shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> clearly don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> with your time?
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> According to medical science I have terminal
>>>>>>>>>>>>>>>>>>>>>>>>>>>> cancer with little time left. I intend my HP
>>>>>>>>>>>>>>>>>>>>>>>>>>>> proof rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>> pathological self-reference of the halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>> problem proofs makes these proof
>>>>>>>>>>>>>>>>>>>>>>>>>>>> illegitimate I have no idea why you would be
>>>>>>>>>>>>>>>>>>>>>>>>>>>> reversing course now.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to be
>>>>>>>>>>>>>>>>>>>>>>>>>>> illegitimate.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank and
>>>>>>>>>>>>>>>>>>>>>>>>> looking for support
>>>>>>>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness
>>>>>>>>>>>>>>>>>>>>>>>> theorem down to a single simple sentence. Try
>>>>>>>>>>>>>>>>>>>>>>>> and find a single error of substance in my paper:
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't
>>>>>>>>>>>>>>>>>>>>>>>> even take a moron.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and assume
>>>>>>>>>>>>>>>>>>>>>>> that Truth can only be something that is proven,
>>>>>>>>>>>>>>>>>>>>>>> and then from that try to prove that Truth is
>>>>>>>>>>>>>>>>>>>>>>> only something that csn be proven.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement
>>>>>>>>>>>>>>>>>>>>>>> is invalid.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> For example, in mathematics, there are a number
>>>>>>>>>>>>>>>>>>>>>>> of statements that must either be True of False,
>>>>>>>>>>>>>>>>>>>>>>> there is no possible middle ground, but these
>>>>>>>>>>>>>>>>>>>>>>> statements have not been shown to be provable or
>>>>>>>>>>>>>>>>>>>>>>> disprovable. An example of this is the 3x+1 problem.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Every expression of language does not count as
>>>>>>>>>>>>>>>>>>>>>> true until after it has been proven. There are
>>>>>>>>>>>>>>>>>>>>>> only two ways to determine if an analytical
>>>>>>>>>>>>>>>>>>>>>> expression of language is true. It is an axiom
>>>>>>>>>>>>>>>>>>>>>> that assigned the value of Boolean true. It is
>>>>>>>>>>>>>>>>>>>>>> derived by sound deduction that is ultimately
>>>>>>>>>>>>>>>>>>>>>> anchored in axioms.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a
>>>>>>>>>>>>>>>>>>>>> axiom you need to assume.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Analytical expressions of language are verified to
>>>>>>>>>>>>>>>>>>>> be true entirely on the basis of their meaning.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>>>>>>>> That is a stipulated definition just like a "given" in
>>>>>>>>>>>>>>>>>> geometry.
>>>>>>>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> If I say that a cat is an animal and you disagree and
>>>>>>>>>>>>>>>>>> say that a cat is the windows of an office building
>>>>>>>>>>>>>>>>>> you are simply wrong.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Except that you can't 'stipulate' a definition for
>>>>>>>>>>>>>>>>> something already defined in the system, especially to
>>>>>>>>>>>>>>>>> something wrong. That violates the rules of Formal Logic.
>>>>>>>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>>>>>>>> "Analytic propositions are true or not true solely by
>>>>>>>>>>>>>>>> virtue of their meaning"
>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>>>>>>>> logic is a branch of philosophy
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> But is a different branch than your Epistemology with
>>>>>>>>>>>>> different rules. Formal Logic, which mathematics uses
>>>>>>>>>>>>> defines things differently than what you want to use.
>>>>>>>>>>>>
>>>>>>>>>>>> Yes and when formal logic diverges from applying truth
>>>>>>>>>>>> preserving operations to premises that are known to be true
>>>>>>>>>>>> (sound deductive inference) on the basis of the semantic
>>>>>>>>>>>> relevance that is maintained in the syllogism:
>>>>>>>>>>>>
>>>>>>>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>>>>>>>> then formal logic errs and diverges from truth.
>>>>>>>>>>>>
>>>>>>>>>>>> Logical entailment does not require premises to be true yet
>>>>>>>>>>>> still requires true preserving operations to be applied on
>>>>>>>>>>>> the basis of semantic relevance.
>>>>>>>>>>>> Which just says that YOU don't agree with what the whole
>>>>>>>>>>>> world agrees is
>>>>>>>>>>> the truth.
>>>>>>>>>>>
>>>>>>>>>>> Find, you are on your own.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Things an ignoramus would say:
>>>>>>>>>>> YOU have shown yourself to be incapable of understanding the
>>>>>>>>>>> basic principles of Formal Logic, and are thus unqualified to
>>>>>>>>>>> discuss it.
>>>>>>>>>> When everything that you learn you learn by only rote
>>>>>>>>>> understanding cannot possibly get any more shallow.
>>>>>>>>>>
>>>>>>>>>> I am discussing the philosophical underpinnings upon which
>>>>>>>>>> correct reasoning is based.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Then you are doing it at the wrong place.
>>>>>>>>>
>>>>>>>>> If you disagree with the fundamental logic underpinnings of all
>>>>>>>>> of Formal Logic, you don't start in a peripheral field. That is
>>>>>>>>> useless.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Philosophical foundationalism is the ultimate basis and
>>>>>>>> ground-of-being of correct reasoning and logic, thus 100%
>>>>>>>> directly opposite of peripheral. It cannot possibly be any less
>>>>>>>> peripheral.
>>>>>>>
>>>>>>> You don't read very well I see. I wasn't calling the logic
>>>>>>> underpinnings peripheral, I was calling Computation Theory
>>>>>>> peripheral. If you want to challenge the definition of Truth used
>>>>>>> in Formal Logic, you don't work in a peripheral field, which
>>>>>>> CAN'T change the definition of Truth it uses, because it has
>>>>>>> inhereted it from its
>>>>>>>
>>>>>>
>>>>>> (a) The halting problem proofs,
>>>>>> (b) Gödel's 1931 incompleteness theorem,
>>>>>> (c) The Tarski Undefinability theorem and
>>>>>> (d) The liar paradox
>>>>>> all suffer from the same foundational error.
>>>>>
>>>>> I will point out that the liar's paradox is a completely DIFFERENT
>>>>> sort of issue,
>>>>>
>>>>>>
>>>>>> When analytical truth is understood to be connected sets of true
>>>>>> statements that necessarily derive true conclusions then all four
>>>>>> of the above examples lose their basis and cease to exist.
>>>>>
>>>>> Except that it doesn't. Formal Logic IS built on the concept that
>>>>> you can only prove a conclusion from True Premises.
>>>>>
>>>>> What is isn't built on that Truth has to be proven. Something can
>>>>> be True even if not proven, but if you can't prove it to be true,
>>>>> you can't use it for the basis of a further proof.
>>>>>
>>>>
>>>> Within the body of analytic knowledge an expression of language is
>>>> only true when a connected set of true expressions prove that it is
>>>> true, thus true and unprovable cannot possibly co-exist.
>>>
>>> Then the body of analytic knowledge (or at least your interpreation
>>> of it) can't deal with the body of knowledge of Mathematics, (and
>>> related logic families) as they allow for a statement to be True
>>> without needing to be connected to a proof. PERIOD.
>> Lets proceed from here. How do we know that a mathematical expression
>> is true aside from its proof that it is true?
>>
>
> We don't. But we might know that it is True or False, and can bifurcate
> on that knowledge.


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]

<KwWPJ.17977$V7da.6782@fx13.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26725&group=comp.theory#26725

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!news.freedyn.de!newsreader4.netcologne.de!news.netcologne.de!peer02.ams1!peer.ams1.xlned.com!news.xlned.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx13.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ]
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<QwiPJ.68137$H_t7.60847@fx40.iad>
<pbGdnXumaLMjIZD_nZ2dnUU7-SnNnZ2d@giganews.com>
<CfjPJ.16883$K0Ga.14998@fx10.iad>
<NZednWhW8to3XpD_nZ2dnUU7-VOdnZ2d@giganews.com>
<7IjPJ.12295$XFM9.7011@fx18.iad>
<XICdnT_q4aIVV5D_nZ2dnUU7-dvNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad> <20220218234235.00006cd9@reddwarf.jmc>
<ePadnZx8AoKir43_nZ2dnUU7-W_NnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <ePadnZx8AoKir43_nZ2dnUU7-W_NnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 56
Message-ID: <KwWPJ.17977$V7da.6782@fx13.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 19:07:06 -0500
X-Received-Bytes: 4012
 by: Richard Damon - Sat, 19 Feb 2022 00:07 UTC

On 2/18/22 6:56 PM, olcott wrote:
> On 2/18/2022 5:42 PM, Mr Flibble wrote:
>> On Thu, 17 Feb 2022 23:21:27 -0500
>> Richard Damon <Richard@Damon-Family.org> wrote:
>>
>>> Again, this seems to make the logical error of assuming the
>>> conclusion, by assuming something as axiomatic that has not been
>>> accepted in the field as an axiom.
>>>
>>> When dealing with FORMAL logic systems, you are not allowed to
>>> introduce 'new' axioms.
>>>
>>> FAIL.
>>>
>>
>> Nonsense; a new axiom can be derived from one or more preexisting
>> axioms.
>>
>> /Flibble
>>
>
> Validity and Soundness
> A deductive argument is said to be valid if and only if it takes a form
> that makes it impossible for the premises to be true and the conclusion
> nevertheless to be false. https://iep.utm.edu/val-snd/
>
> cows are not dogs
> cows are not airplanes
> ∴ butterflies have wings
>
> The above definition of a valid argument makes the above conclusion
> logically entailed by its premises even though the conclusion is totally
> unrelated to its premises.
>
> The key change that I am making is to the above definition of valid
> inference is that I am changing it back to the way it was before logic
> diverged from the model of the syllogism. (semantically related is
> required).
>
> A deductive argument is said to be valid if and only if it takes a form
> that makes the conclusion a necessary consequence of its premises.
>

And what does this actual achieve? (except making it harder to do things).

For the arguments that you want to allow to have been proven valid, the
conclusion would have needed to have proven true.

If you can do that, then the fact that you now have a rule that can
'illogically' prove the results doesn't matter, you have proven it already.

The only case I can see where it makes a difference is if you are
allowing bad logic with mismatched definitions so you prove the
conclusion under one set of definitons, and then use it under another.

THat is bad logic already, so doesn't need to be outlawed.

Re: Concise refutation of halting problem proofs V62 [ my legacy ]

<eO2dnfNspOyUp43_nZ2dnUU7-THNnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26726&group=comp.theory#26726

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 18:30:01 -0600
Date: Fri, 18 Feb 2022 18:29:58 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ]
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<pbGdnXumaLMjIZD_nZ2dnUU7-SnNnZ2d@giganews.com>
<CfjPJ.16883$K0Ga.14998@fx10.iad>
<NZednWhW8to3XpD_nZ2dnUU7-VOdnZ2d@giganews.com>
<7IjPJ.12295$XFM9.7011@fx18.iad>
<XICdnT_q4aIVV5D_nZ2dnUU7-dvNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad> <20220218234235.00006cd9@reddwarf.jmc>
<ePadnZx8AoKir43_nZ2dnUU7-W_NnZ2d@giganews.com>
<KwWPJ.17977$V7da.6782@fx13.iad>
From: NoO...@NoWhere.com (olcott)
Followup-To: comp.theory
In-Reply-To: <KwWPJ.17977$V7da.6782@fx13.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <eO2dnfNspOyUp43_nZ2dnUU7-THNnZ2d@giganews.com>
Lines: 65
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-3VWbD9/afVGN41ZE85GXRR8TxS0n4CDAgkGm0IdrVliSIrzft34AsFIeKZ/6B1N0/Y0OdwfPtGOi+mi!evUcErUgcxrffjICmutt6Lg5imWE6jmFUJOImeonursnPTczRt7m7lNwe0xz2bAD8PC0kiRL3A==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 4531
 by: olcott - Sat, 19 Feb 2022 00:29 UTC

On 2/18/2022 6:07 PM, Richard Damon wrote:
> On 2/18/22 6:56 PM, olcott wrote:
>> On 2/18/2022 5:42 PM, Mr Flibble wrote:
>>> On Thu, 17 Feb 2022 23:21:27 -0500
>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>
>>>> Again, this seems to make the logical error of assuming the
>>>> conclusion, by assuming something as axiomatic that has not been
>>>> accepted in the field as an axiom.
>>>>
>>>> When dealing with FORMAL logic systems, you are not allowed to
>>>> introduce 'new' axioms.
>>>>
>>>> FAIL.
>>>>
>>>
>>> Nonsense; a new axiom can be derived from one or more preexisting
>>> axioms.
>>>
>>> /Flibble
>>>
>>
>> Validity and Soundness
>> A deductive argument is said to be valid if and only if it takes a
>> form that makes it impossible for the premises to be true and the
>> conclusion nevertheless to be false. https://iep.utm.edu/val-snd/
>>
>> cows are not dogs
>> cows are not airplanes
>> ∴ butterflies have wings
>>
>> The above definition of a valid argument makes the above conclusion
>> logically entailed by its premises even though the conclusion is
>> totally unrelated to its premises.
>>
>> The key change that I am making is to the above definition of valid
>> inference is that I am changing it back to the way it was before logic
>> diverged from the model of the syllogism. (semantically related is
>> required).
>>
>> A deductive argument is said to be valid if and only if it takes a
>> form that makes the conclusion a necessary consequence of its premises.
>>
>
> And what does this actual achieve? (except making it harder to do things).
>

It defines the notion of correct reasoning and realigns logic with
Aristotle's syllogism requiring a semantic connection between the
premises and conclusion.

It over-rides and supersedes the classical logic definition of logical
entailment to make the word "proven" regain its common meaning.

We can no longer correctly say that "butterflies have wings" is "proven"
on the basis that "cows are not dogs" and "cows are not airplanes".
The principle of explosion is also cancelled by this change.

--
Copyright 2021 Pete Olcott

Talent hits a target no one else can hit;
Genius hits a target no one else can see.
Arthur Schopenhauer

Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<86XPJ.71095$H_t7.13779@fx40.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26727&group=comp.theory#26727

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!news.uzoreto.com!npeer.as286.net!npeer-ng0.as286.net!peer01.ams1!peer.ams1.xlned.com!news.xlned.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx40.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
<2KUPJ.21827$0vE9.17210@fx17.iad>
<1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>
<0LVPJ.37393$f2a5.202@fx48.iad>
<c5ydndJBYJQ8sY3_nZ2dnUU7-TXNnZ2d@giganews.com>
<OlWPJ.67698$Lbb6.53667@fx45.iad>
<HOmdndtjt9Xhro3_nZ2dnUU7-S_NnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <HOmdndtjt9Xhro3_nZ2dnUU7-S_NnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 433
Message-ID: <86XPJ.71095$H_t7.13779@fx40.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 19:47:00 -0500
X-Received-Bytes: 25026
 by: Richard Damon - Sat, 19 Feb 2022 00:47 UTC

On 2/18/22 7:02 PM, olcott wrote:
> On 2/18/2022 5:55 PM, Richard Damon wrote:
>> On 2/18/22 6:32 PM, olcott wrote:
>>> On 2/18/2022 5:14 PM, Richard Damon wrote:
>>>> On 2/18/22 5:41 PM, olcott wrote:
>>>>> On 2/18/2022 4:04 PM, Richard Damon wrote:
>>>>>> On 2/18/22 4:39 PM, olcott wrote:
>>>>>>> On 2/18/2022 3:19 PM, Richard Damon wrote:
>>>>>>>>
>>>>>>>> On 2/18/22 4:03 PM, olcott wrote:
>>>>>>>>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>>>>>>>>> On 2/18/22 2:33 PM, olcott wrote:
>>>>>>>>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>>>>>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>>>>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>>>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> must abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinite simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> right definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> animal and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> difference betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you have proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> anything to agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> in your heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on forums
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example exists
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> where this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of H <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and we
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have said that H has
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H" <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is a non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> claim does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if H
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> goes to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have just
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> shown that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> go to H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand anything about formal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> produced a counter example means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just plain
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> unsond logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> meaning of the words' and not
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions being used to make
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> rhetorical arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> don't understand what you are
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> use formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Epistemological statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Philosophy, so if that is the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> just don't have a background to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Theory uses.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> what you need to do to show
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> also shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> clearly don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> with your time?
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> According to medical science I have
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> terminal cancer with little time left. I
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> intend my HP proof rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> pathological self-reference of the halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> problem proofs makes these proof
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> illegitimate I have no idea why you would
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> be reversing course now.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to
>>>>>>>>>>>>>>>>>>>>>>>>>>>> be illegitimate.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank
>>>>>>>>>>>>>>>>>>>>>>>>>> and looking for support
>>>>>>>>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness
>>>>>>>>>>>>>>>>>>>>>>>>> theorem down to a single simple sentence. Try
>>>>>>>>>>>>>>>>>>>>>>>>> and find a single error of substance in my paper:
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't
>>>>>>>>>>>>>>>>>>>>>>>>> even take a moron.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and
>>>>>>>>>>>>>>>>>>>>>>>> assume that Truth can only be something that is
>>>>>>>>>>>>>>>>>>>>>>>> proven, and then from that try to prove that
>>>>>>>>>>>>>>>>>>>>>>>> Truth is only something that csn be proven.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole arguement
>>>>>>>>>>>>>>>>>>>>>>>> is invalid.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> For example, in mathematics, there are a number
>>>>>>>>>>>>>>>>>>>>>>>> of statements that must either be True of False,
>>>>>>>>>>>>>>>>>>>>>>>> there is no possible middle ground, but these
>>>>>>>>>>>>>>>>>>>>>>>> statements have not been shown to be provable or
>>>>>>>>>>>>>>>>>>>>>>>> disprovable. An example of this is the 3x+1
>>>>>>>>>>>>>>>>>>>>>>>> problem.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Every expression of language does not count as
>>>>>>>>>>>>>>>>>>>>>>> true until after it has been proven. There are
>>>>>>>>>>>>>>>>>>>>>>> only two ways to determine if an analytical
>>>>>>>>>>>>>>>>>>>>>>> expression of language is true. It is an axiom
>>>>>>>>>>>>>>>>>>>>>>> that assigned the value of Boolean true. It is
>>>>>>>>>>>>>>>>>>>>>>> derived by sound deduction that is ultimately
>>>>>>>>>>>>>>>>>>>>>>> anchored in axioms.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a
>>>>>>>>>>>>>>>>>>>>>> axiom you need to assume.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Analytical expressions of language are verified to
>>>>>>>>>>>>>>>>>>>>> be true entirely on the basis of their meaning.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>>>>>>>>> That is a stipulated definition just like a "given"
>>>>>>>>>>>>>>>>>>> in geometry.
>>>>>>>>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> If I say that a cat is an animal and you disagree and
>>>>>>>>>>>>>>>>>>> say that a cat is the windows of an office building
>>>>>>>>>>>>>>>>>>> you are simply wrong.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Except that you can't 'stipulate' a definition for
>>>>>>>>>>>>>>>>>> something already defined in the system, especially to
>>>>>>>>>>>>>>>>>> something wrong. That violates the rules of Formal Logic.
>>>>>>>>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>>>>>>>>> "Analytic propositions are true or not true solely by
>>>>>>>>>>>>>>>>> virtue of their meaning"
>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>>>>>>>>> logic is a branch of philosophy
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> But is a different branch than your Epistemology with
>>>>>>>>>>>>>> different rules. Formal Logic, which mathematics uses
>>>>>>>>>>>>>> defines things differently than what you want to use.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Yes and when formal logic diverges from applying truth
>>>>>>>>>>>>> preserving operations to premises that are known to be true
>>>>>>>>>>>>> (sound deductive inference) on the basis of the semantic
>>>>>>>>>>>>> relevance that is maintained in the syllogism:
>>>>>>>>>>>>>
>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>>>>>>>>> then formal logic errs and diverges from truth.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Logical entailment does not require premises to be true yet
>>>>>>>>>>>>> still requires true preserving operations to be applied on
>>>>>>>>>>>>> the basis of semantic relevance.
>>>>>>>>>>>>> Which just says that YOU don't agree with what the whole
>>>>>>>>>>>>> world agrees is
>>>>>>>>>>>> the truth.
>>>>>>>>>>>>
>>>>>>>>>>>> Find, you are on your own.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Things an ignoramus would say:
>>>>>>>>>>>> YOU have shown yourself to be incapable of understanding the
>>>>>>>>>>>> basic principles of Formal Logic, and are thus unqualified
>>>>>>>>>>>> to discuss it.
>>>>>>>>>>> When everything that you learn you learn by only rote
>>>>>>>>>>> understanding cannot possibly get any more shallow.
>>>>>>>>>>>
>>>>>>>>>>> I am discussing the philosophical underpinnings upon which
>>>>>>>>>>> correct reasoning is based.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Then you are doing it at the wrong place.
>>>>>>>>>>
>>>>>>>>>> If you disagree with the fundamental logic underpinnings of
>>>>>>>>>> all of Formal Logic, you don't start in a peripheral field.
>>>>>>>>>> That is useless.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Philosophical foundationalism is the ultimate basis and
>>>>>>>>> ground-of-being of correct reasoning and logic, thus 100%
>>>>>>>>> directly opposite of peripheral. It cannot possibly be any less
>>>>>>>>> peripheral.
>>>>>>>>
>>>>>>>> You don't read very well I see. I wasn't calling the logic
>>>>>>>> underpinnings peripheral, I was calling Computation Theory
>>>>>>>> peripheral. If you want to challenge the definition of Truth
>>>>>>>> used in Formal Logic, you don't work in a peripheral field,
>>>>>>>> which CAN'T change the definition of Truth it uses, because it
>>>>>>>> has inhereted it from its
>>>>>>>>
>>>>>>>
>>>>>>> (a) The halting problem proofs,
>>>>>>> (b) Gödel's 1931 incompleteness theorem,
>>>>>>> (c) The Tarski Undefinability theorem and
>>>>>>> (d) The liar paradox
>>>>>>> all suffer from the same foundational error.
>>>>>>
>>>>>> I will point out that the liar's paradox is a completely DIFFERENT
>>>>>> sort of issue,
>>>>>>
>>>>>>>
>>>>>>> When analytical truth is understood to be connected sets of true
>>>>>>> statements that necessarily derive true conclusions then all four
>>>>>>> of the above examples lose their basis and cease to exist.
>>>>>>
>>>>>> Except that it doesn't. Formal Logic IS built on the concept that
>>>>>> you can only prove a conclusion from True Premises.
>>>>>>
>>>>>> What is isn't built on that Truth has to be proven. Something can
>>>>>> be True even if not proven, but if you can't prove it to be true,
>>>>>> you can't use it for the basis of a further proof.
>>>>>>
>>>>>
>>>>> Within the body of analytic knowledge an expression of language is
>>>>> only true when a connected set of true expressions prove that it is
>>>>> true, thus true and unprovable cannot possibly co-exist.
>>>>
>>>> Then the body of analytic knowledge (or at least your interpreation
>>>> of it) can't deal with the body of knowledge of Mathematics, (and
>>>> related logic families) as they allow for a statement to be True
>>>> without needing to be connected to a proof. PERIOD.
>>> Lets proceed from here. How do we know that a mathematical expression
>>> is true aside from its proof that it is true?
>>>
>>
>> We don't. But we might know that it is True or False, and can
>> bifurcate on that knowledge.
>
> Yet the Gödel sentence proposed to be true and unprovable.
> That cannot possibly be. If it is true then it is provably true
> otherwise it is untrue (not the same as false).
>


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]

<WiXPJ.82617$t2Bb.4396@fx98.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26729&group=comp.theory#26729

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!newsreader4.netcologne.de!news.netcologne.de!peer03.ams1!peer.ams1.xlned.com!news.xlned.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx98.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ]
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<CfjPJ.16883$K0Ga.14998@fx10.iad>
<NZednWhW8to3XpD_nZ2dnUU7-VOdnZ2d@giganews.com>
<7IjPJ.12295$XFM9.7011@fx18.iad>
<XICdnT_q4aIVV5D_nZ2dnUU7-dvNnZ2d@giganews.com>
<c%jPJ.44955$Wdl5.32288@fx44.iad>
<vLudnchJ3YIDUJD_nZ2dnUU7-QvNnZ2d@giganews.com>
<AykPJ.64853$Lbb6.52236@fx45.iad>
<p_adnQJkRaC7Q5D_nZ2dnUU7-Q3NnZ2d@giganews.com>
<lJidnYGTm7RvQ5D_nZ2dnUU7-XPNnZ2d@giganews.com>
<tNqPJ.37317$f2a5.24020@fx48.iad> <20220217181611.000022e8@reddwarf.jmc>
<4P-dna-klb3qCpP_nZ2dnUU7-KnNnZ2d@giganews.com>
<6%DPJ.67514$Lbb6.41953@fx45.iad>
<_e6dnXea6eE3kJL_nZ2dnUU7-VnNnZ2d@giganews.com>
<sun2q5$1bkg$1@gioia.aioe.org>
<NuednUp91v5tj5L_nZ2dnUU7-fXNnZ2d@giganews.com>
<MMEPJ.35878$41E7.8164@fx37.iad> <sun608$7hm$1@dont-email.me>
<a9FPJ.6571$uW1.1454@fx27.iad> <20220218234235.00006cd9@reddwarf.jmc>
<ePadnZx8AoKir43_nZ2dnUU7-W_NnZ2d@giganews.com>
<KwWPJ.17977$V7da.6782@fx13.iad>
<eO2dnfNspOyUp43_nZ2dnUU7-THNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <eO2dnfNspOyUp43_nZ2dnUU7-THNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 82
Message-ID: <WiXPJ.82617$t2Bb.4396@fx98.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 20:00:38 -0500
X-Received-Bytes: 4913
 by: Richard Damon - Sat, 19 Feb 2022 01:00 UTC

On 2/18/22 7:29 PM, olcott wrote:
> On 2/18/2022 6:07 PM, Richard Damon wrote:
>> On 2/18/22 6:56 PM, olcott wrote:
>>> On 2/18/2022 5:42 PM, Mr Flibble wrote:
>>>> On Thu, 17 Feb 2022 23:21:27 -0500
>>>> Richard Damon <Richard@Damon-Family.org> wrote:
>>>>
>>>>> Again, this seems to make the logical error of assuming the
>>>>> conclusion, by assuming something as axiomatic that has not been
>>>>> accepted in the field as an axiom.
>>>>>
>>>>> When dealing with FORMAL logic systems, you are not allowed to
>>>>> introduce 'new' axioms.
>>>>>
>>>>> FAIL.
>>>>>
>>>>
>>>> Nonsense; a new axiom can be derived from one or more preexisting
>>>> axioms.
>>>>
>>>> /Flibble
>>>>
>>>
>>> Validity and Soundness
>>> A deductive argument is said to be valid if and only if it takes a
>>> form that makes it impossible for the premises to be true and the
>>> conclusion nevertheless to be false. https://iep.utm.edu/val-snd/
>>>
>>> cows are not dogs
>>> cows are not airplanes
>>> ∴ butterflies have wings
>>>
>>> The above definition of a valid argument makes the above conclusion
>>> logically entailed by its premises even though the conclusion is
>>> totally unrelated to its premises.
>>>
>>> The key change that I am making is to the above definition of valid
>>> inference is that I am changing it back to the way it was before
>>> logic diverged from the model of the syllogism. (semantically related
>>> is required).
>>>
>>> A deductive argument is said to be valid if and only if it takes a
>>> form that makes the conclusion a necessary consequence of its premises.
>>>
>>
>> And what does this actual achieve? (except making it harder to do
>> things).
>>
>
> It defines the notion of correct reasoning and realigns logic with
> Aristotle's syllogism requiring a semantic connection between the
> premises and conclusion.

Which does WHAT, ACTUALLY?

What useful statement does this allow you to prove, or false premise it
allows you to keep from proving.

>
> It over-rides and supersedes the classical logic definition of logical
> entailment to make the word "proven" regain its common meaning.

No, it doesn't. since the need to prove your arguement means that the
conclusion actually has been proven.

I suppose the one advantage would be it would disallow arguements based
on always false premises, which can then 'prove' false conclusions, but
that arguement can't actually be used anyway (even though you try).

>
> We can no longer correctly say that "butterflies have wings" is "proven"
> on the basis that "cows are not dogs" and "cows are not airplanes".
> The principle of explosion is also cancelled by this change.
>

Except that you never could say that, all you could say is that
butterflys have wings because it has been proven that since caows are
not dogs and cows are not airplains together are sufficient to show that
butterflies have wings. Which is true,

Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<aI2dnU5X7s7a3o3_nZ2dnUU7-TfNnZ2d@giganews.com>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26730&group=comp.theory#26730

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 18 Feb 2022 19:09:27 -0600
Date: Fri, 18 Feb 2022 19:09:23 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<sun608$7hm$1@dont-email.me> <a9FPJ.6571$uW1.1454@fx27.iad>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
<2KUPJ.21827$0vE9.17210@fx17.iad>
<1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>
<0LVPJ.37393$f2a5.202@fx48.iad>
<c5ydndJBYJQ8sY3_nZ2dnUU7-TXNnZ2d@giganews.com>
<OlWPJ.67698$Lbb6.53667@fx45.iad>
<HOmdndtjt9Xhro3_nZ2dnUU7-S_NnZ2d@giganews.com>
<86XPJ.71095$H_t7.13779@fx40.iad>
Followup-To: comp.theory
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <86XPJ.71095$H_t7.13779@fx40.iad>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <aI2dnU5X7s7a3o3_nZ2dnUU7-TfNnZ2d@giganews.com>
Lines: 443
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-uFn729kYiQEZc3vdMiutaExX9bU+ciBJEv+yqSKoj43YDcOJsIcTKa5o00knaZHpQp8nI15tL3eXmIG!o5q7LGZnEEnLPOz83Rw3WTUDbZetMhRfkiRxFXehNm3uFUj0g3WgfraE3RRmZUgj+8zWteyZdw==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 26173
 by: olcott - Sat, 19 Feb 2022 01:09 UTC

On 2/18/2022 6:47 PM, Richard Damon wrote:
> On 2/18/22 7:02 PM, olcott wrote:
>> On 2/18/2022 5:55 PM, Richard Damon wrote:
>>> On 2/18/22 6:32 PM, olcott wrote:
>>>> On 2/18/2022 5:14 PM, Richard Damon wrote:
>>>>> On 2/18/22 5:41 PM, olcott wrote:
>>>>>> On 2/18/2022 4:04 PM, Richard Damon wrote:
>>>>>>> On 2/18/22 4:39 PM, olcott wrote:
>>>>>>>> On 2/18/2022 3:19 PM, Richard Damon wrote:
>>>>>>>>>
>>>>>>>>> On 2/18/22 4:03 PM, olcott wrote:
>>>>>>>>>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>>>>>>>>>> On 2/18/22 2:33 PM, olcott wrote:
>>>>>>>>>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>>>>>>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>>>>>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>>>>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>>>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> must abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinite simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> right definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> an animal and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> difference betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you have proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> anything to agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this deep
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> in your heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> forums that don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> must abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation where this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual behavoir
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of H <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> we have said that H has
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H"
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> is a non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you claim does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H goes to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> just shown that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will also
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> go to H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> and thus is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand anything about formal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> produced a counter example means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> plain unsond logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> meaning of the words' and not
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions being used to make
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> rhetorical arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> don't understand what you are
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> use formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Epistemological statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Philosophy, so if that is the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> just don't have a background to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Theory uses.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> what you need to do to show
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> also shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> clearly don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> with your time?
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> According to medical science I have
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> terminal cancer with little time left. I
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> intend my HP proof rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> pathological self-reference of the halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> problem proofs makes these proof
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> illegitimate I have no idea why you would
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> be reversing course now.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> be illegitimate.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank
>>>>>>>>>>>>>>>>>>>>>>>>>>> and looking for support
>>>>>>>>>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness
>>>>>>>>>>>>>>>>>>>>>>>>>> theorem down to a single simple sentence. Try
>>>>>>>>>>>>>>>>>>>>>>>>>> and find a single error of substance in my paper:
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't
>>>>>>>>>>>>>>>>>>>>>>>>>> even take a moron.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume your
>>>>>>>>>>>>>>>>>>>>>>>>> conclusion as a premise.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and
>>>>>>>>>>>>>>>>>>>>>>>>> assume that Truth can only be something that is
>>>>>>>>>>>>>>>>>>>>>>>>> proven, and then from that try to prove that
>>>>>>>>>>>>>>>>>>>>>>>>> Truth is only something that csn be proven.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole
>>>>>>>>>>>>>>>>>>>>>>>>> arguement is invalid.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> For example, in mathematics, there are a number
>>>>>>>>>>>>>>>>>>>>>>>>> of statements that must either be True of
>>>>>>>>>>>>>>>>>>>>>>>>> False, there is no possible middle ground, but
>>>>>>>>>>>>>>>>>>>>>>>>> these statements have not been shown to be
>>>>>>>>>>>>>>>>>>>>>>>>> provable or disprovable. An example of this is
>>>>>>>>>>>>>>>>>>>>>>>>> the 3x+1 problem.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Every expression of language does not count as
>>>>>>>>>>>>>>>>>>>>>>>> true until after it has been proven. There are
>>>>>>>>>>>>>>>>>>>>>>>> only two ways to determine if an analytical
>>>>>>>>>>>>>>>>>>>>>>>> expression of language is true. It is an axiom
>>>>>>>>>>>>>>>>>>>>>>>> that assigned the value of Boolean true. It is
>>>>>>>>>>>>>>>>>>>>>>>> derived by sound deduction that is ultimately
>>>>>>>>>>>>>>>>>>>>>>>> anchored in axioms.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a
>>>>>>>>>>>>>>>>>>>>>>> axiom you need to assume.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Analytical expressions of language are verified to
>>>>>>>>>>>>>>>>>>>>>> be true entirely on the basis of their meaning.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>>>>>>>>>> That is a stipulated definition just like a "given"
>>>>>>>>>>>>>>>>>>>> in geometry.
>>>>>>>>>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> If I say that a cat is an animal and you disagree
>>>>>>>>>>>>>>>>>>>> and say that a cat is the windows of an office
>>>>>>>>>>>>>>>>>>>> building you are simply wrong.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Except that you can't 'stipulate' a definition for
>>>>>>>>>>>>>>>>>>> something already defined in the system, especially
>>>>>>>>>>>>>>>>>>> to something wrong. That violates the rules of Formal
>>>>>>>>>>>>>>>>>>> Logic.
>>>>>>>>>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>>>>>>>>>> "Analytic propositions are true or not true solely by
>>>>>>>>>>>>>>>>>> virtue of their meaning"
>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>>>>>>>>>> logic is a branch of philosophy
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> But is a different branch than your Epistemology with
>>>>>>>>>>>>>>> different rules. Formal Logic, which mathematics uses
>>>>>>>>>>>>>>> defines things differently than what you want to use.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Yes and when formal logic diverges from applying truth
>>>>>>>>>>>>>> preserving operations to premises that are known to be
>>>>>>>>>>>>>> true (sound deductive inference) on the basis of the
>>>>>>>>>>>>>> semantic relevance that is maintained in the syllogism:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>>>>>>>>>> then formal logic errs and diverges from truth.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Logical entailment does not require premises to be true
>>>>>>>>>>>>>> yet still requires true preserving operations to be
>>>>>>>>>>>>>> applied on the basis of semantic relevance.
>>>>>>>>>>>>>> Which just says that YOU don't agree with what the whole
>>>>>>>>>>>>>> world agrees is
>>>>>>>>>>>>> the truth.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Find, you are on your own.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Things an ignoramus would say:
>>>>>>>>>>>>> YOU have shown yourself to be incapable of understanding
>>>>>>>>>>>>> the basic principles of Formal Logic, and are thus
>>>>>>>>>>>>> unqualified to discuss it.
>>>>>>>>>>>> When everything that you learn you learn by only rote
>>>>>>>>>>>> understanding cannot possibly get any more shallow.
>>>>>>>>>>>>
>>>>>>>>>>>> I am discussing the philosophical underpinnings upon which
>>>>>>>>>>>> correct reasoning is based.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Then you are doing it at the wrong place.
>>>>>>>>>>>
>>>>>>>>>>> If you disagree with the fundamental logic underpinnings of
>>>>>>>>>>> all of Formal Logic, you don't start in a peripheral field.
>>>>>>>>>>> That is useless.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Philosophical foundationalism is the ultimate basis and
>>>>>>>>>> ground-of-being of correct reasoning and logic, thus 100%
>>>>>>>>>> directly opposite of peripheral. It cannot possibly be any
>>>>>>>>>> less peripheral.
>>>>>>>>>
>>>>>>>>> You don't read very well I see. I wasn't calling the logic
>>>>>>>>> underpinnings peripheral, I was calling Computation Theory
>>>>>>>>> peripheral. If you want to challenge the definition of Truth
>>>>>>>>> used in Formal Logic, you don't work in a peripheral field,
>>>>>>>>> which CAN'T change the definition of Truth it uses, because it
>>>>>>>>> has inhereted it from its
>>>>>>>>>
>>>>>>>>
>>>>>>>> (a) The halting problem proofs,
>>>>>>>> (b) Gödel's 1931 incompleteness theorem,
>>>>>>>> (c) The Tarski Undefinability theorem and
>>>>>>>> (d) The liar paradox
>>>>>>>> all suffer from the same foundational error.
>>>>>>>
>>>>>>> I will point out that the liar's paradox is a completely
>>>>>>> DIFFERENT sort of issue,
>>>>>>>
>>>>>>>>
>>>>>>>> When analytical truth is understood to be connected sets of true
>>>>>>>> statements that necessarily derive true conclusions then all
>>>>>>>> four of the above examples lose their basis and cease to exist.
>>>>>>>
>>>>>>> Except that it doesn't. Formal Logic IS built on the concept that
>>>>>>> you can only prove a conclusion from True Premises.
>>>>>>>
>>>>>>> What is isn't built on that Truth has to be proven. Something can
>>>>>>> be True even if not proven, but if you can't prove it to be true,
>>>>>>> you can't use it for the basis of a further proof.
>>>>>>>
>>>>>>
>>>>>> Within the body of analytic knowledge an expression of language is
>>>>>> only true when a connected set of true expressions prove that it
>>>>>> is true, thus true and unprovable cannot possibly co-exist.
>>>>>
>>>>> Then the body of analytic knowledge (or at least your interpreation
>>>>> of it) can't deal with the body of knowledge of Mathematics, (and
>>>>> related logic families) as they allow for a statement to be True
>>>>> without needing to be connected to a proof. PERIOD.
>>>> Lets proceed from here. How do we know that a mathematical
>>>> expression is true aside from its proof that it is true?
>>>>
>>>
>>> We don't. But we might know that it is True or False, and can
>>> bifurcate on that knowledge.
>>
>> Yet the Gödel sentence proposed to be true and unprovable.
>> That cannot possibly be. If it is true then it is provably true
>> otherwise it is untrue (not the same as false).
>>
>
> The Godel sentence is more complicated then that. In essence the Godel
> sentence says the Godel sentence is can not be proven to be true
> (without directly referencing th Godel sentence).
>
> Either the sentence is True, then it can not be actually PROVEN true in
> the system, since the sentence states, indirectly, that it is
> unprovable. (The connection of the statement to itself is outside the
> reach of the algerbra in question).
>
> Thus, if it IS true, it must be unprovable.


Click here to read the complete article
Re: Concise refutation of halting problem proofs V62 [ my legacy ]( the nature of truth )

<%zXPJ.52845$Tr18.11465@fx42.iad>

 copy mid

https://www.novabbs.com/devel/article-flat.php?id=26731&group=comp.theory#26731

 copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!news.freedyn.de!newsreader4.netcologne.de!news.netcologne.de!peer02.ams1!peer.ams1.xlned.com!news.xlned.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx42.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.6.1
Subject: Re: Concise refutation of halting problem proofs V62 [ my legacy ](
the nature of truth )
Content-Language: en-US
Newsgroups: comp.theory
References: <vc-dndgn0rt7amL8nZ2dnUU7-LXNnZ2d@giganews.com>
<sPOdndIGvPL7LpL_nZ2dnUU7-IfNnZ2d@giganews.com>
<%gPPJ.6578$uW1.3501@fx27.iad>
<Y6mdnbk4af9mX5L_nZ2dnUU7-YnNnZ2d@giganews.com>
<SXPPJ.26281$OT%7.18686@fx07.iad> <suoj2d$hd6$1@dont-email.me>
<7oQPJ.70759$H_t7.7988@fx40.iad>
<9YmdnWX9K7pgSZL_nZ2dnUU7-YednZ2d@giganews.com>
<H_QPJ.15490$GjY3.14197@fx01.iad>
<jOWdnb7AeZ7SdZL_nZ2dnUU7-R_NnZ2d@giganews.com>
<7cSPJ.37967$iK66.36822@fx46.iad>
<XOqdnVT5ApAbaZL_nZ2dnUU7-dvNnZ2d@giganews.com>
<CATPJ.37969$iK66.11942@fx46.iad>
<IuCdnYf-XYUHlI3_nZ2dnUU7-SXNnZ2d@giganews.com>
<t3UPJ.18686$d0Y8.5829@fx31.iad>
<4sydncDV_OW0j43_nZ2dnUU7-QfNnZ2d@giganews.com>
<2KUPJ.21827$0vE9.17210@fx17.iad>
<1pGdnYC9pcQFvY3_nZ2dnUU7-KXNnZ2d@giganews.com>
<0LVPJ.37393$f2a5.202@fx48.iad>
<c5ydndJBYJQ8sY3_nZ2dnUU7-TXNnZ2d@giganews.com>
<OlWPJ.67698$Lbb6.53667@fx45.iad>
<HOmdndtjt9Xhro3_nZ2dnUU7-S_NnZ2d@giganews.com>
<86XPJ.71095$H_t7.13779@fx40.iad>
<aI2dnU5X7s7a3o3_nZ2dnUU7-TfNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <aI2dnU5X7s7a3o3_nZ2dnUU7-TfNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 470
Message-ID: <%zXPJ.52845$Tr18.11465@fx42.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Fri, 18 Feb 2022 20:18:51 -0500
X-Received-Bytes: 27310
 by: Richard Damon - Sat, 19 Feb 2022 01:18 UTC

On 2/18/22 8:09 PM, olcott wrote:
> On 2/18/2022 6:47 PM, Richard Damon wrote:
>> On 2/18/22 7:02 PM, olcott wrote:
>>> On 2/18/2022 5:55 PM, Richard Damon wrote:
>>>> On 2/18/22 6:32 PM, olcott wrote:
>>>>> On 2/18/2022 5:14 PM, Richard Damon wrote:
>>>>>> On 2/18/22 5:41 PM, olcott wrote:
>>>>>>> On 2/18/2022 4:04 PM, Richard Damon wrote:
>>>>>>>> On 2/18/22 4:39 PM, olcott wrote:
>>>>>>>>> On 2/18/2022 3:19 PM, Richard Damon wrote:
>>>>>>>>>>
>>>>>>>>>> On 2/18/22 4:03 PM, olcott wrote:
>>>>>>>>>>> On 2/18/2022 2:46 PM, Richard Damon wrote:
>>>>>>>>>>>> On 2/18/22 2:33 PM, olcott wrote:
>>>>>>>>>>>>> On 2/18/2022 1:12 PM, Richard Damon wrote:
>>>>>>>>>>>>>> On 2/18/22 1:41 PM, olcott wrote:
>>>>>>>>>>>>>>> On 2/18/2022 11:49 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>> On 2/18/22 12:18 PM, olcott wrote:
>>>>>>>>>>>>>>>>> On 2/18/2022 11:08 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> On 2/18/22 11:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 2/18/2022 10:38 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>> On 2/18/22 11:02 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 2/18/2022 9:52 AM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2/18/22 9:55 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 10:21 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 11:06 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:55 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 10:30 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:12 PM, Python wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 9:02 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 1:44 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/2022 12:16 PM, Mr Flibble wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On Thu, 17 Feb 2022 07:00:26 -0500
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Richard Damon <Richard@Damon-Family.org>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/17/22 12:36 AM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 11:33 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:54 PM, Richard Damon
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:22 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 10:17 PM, Richard
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/22 11:09 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 2/16/2022 9:56 PM, Richard
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that must abort the simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of its input to prevent its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinite simulation correctly
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> transitions to its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> WRONG. You aren't following the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> right definitions.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to actually PROVE your statement.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Try to prove that a baby kitten is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> an animal and not the windows
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> of an office building. It is all in
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> the simple meaning of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> words.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> RED HERRING.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You just don't understand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> difference betweeen FORMAL logic
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> systems and informal ones.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have FAILED, but are too dumb to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> know it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Halting problem undecidability and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> infinitely nested simulation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> (V3)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Your monument to your stupidity.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Not ONE bit of formal prpof.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Maybe you can convince yourzelf that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you have proven something,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> but if you want anyone who means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> anything to agree with you, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have a VERY long wait.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> I think that you understand this
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> deep in your heart, which is why
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you just peddle your garbage on
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> forums that don't require peer
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> review to make statements.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Every simulating halt decider that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> must abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation correctly transitions to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its reject state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You all know that what I say is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> self-evidently true.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The fact that no counter-example
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> exists proves that I am correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Example:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A simulating halt decider that must
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> abort the simulation of its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input to prevent its infinite
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation where this input halts on
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> its own without being aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> How about our H and the H" built from it.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have shown the H must abort its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of H" or H will never
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> halt. That is accepted.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> BUT, When we look at the actual
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> behavoir of H <H"> we see that we
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> have the following trace:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We start at H".Q0 <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> We go to H".Qx <H"> <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> since H".Qx has a copy of H at it, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> we have said that H has
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> supposedly correctly decided that H"
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> is a non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> computation, and thus aborts its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simulation of its input and goes to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H.Qn, we know that at  H" will go to H".Qn
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> When H" goes to H".Qn, it Halts.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> THus we have shown that H" <H"> is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> non-halting
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we have shown that H <H"> <H"> was
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrong.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Thus we HAVE the counter example that
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you claim does not exist.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H is WRONG about H <H"> <H"> because if
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> H goes to H.Qn for this
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> input, BY DEFINITION, it means that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> simple running opf H" applied
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> to <H"> must never halt, but we have
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> just shown that BECAUSE H <H">
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> <H"> goes to H.Qn, that H"<H"> will
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> also go to H".Qn and Halt, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> thus H has violated its requirements,
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> and thus is not correct.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You have just shown that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> understand anything about formal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> logic or how to prove something.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> A claim that because someone hasn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> produced a counter example means
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> your statement must be true is just
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> plain unsond logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> TTo claim something follows, 'by the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> meaning of the words' and not
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> being able to show the actual FORMAL
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> definitions being used to make
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> that claim, is just unsound logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FORMAL LOGIC doesn't accept crude
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> rhetorical arguments, but only
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> formal step by step proofs.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> All you have done is PROVED that you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> don't understand what you are
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> doing, and you don't understand how to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> use formal logic.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> This is sort of understandable since
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> you have revealed that you goal
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> is just to try to establish an
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Epistemological statement, which isn't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> even a field of "Formal Logic', but
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Philosophy, so if that is the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> field you are used to talking in, you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> just don't have a background to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> handle Formal Logic, which Computation
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Theory uses.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> So, you have just FAILED to understand
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> what you need to do to show
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> something in COmputation Theory, which
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> also shows that you don't
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> really understand Epistimology, as you
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> clearly don't undstand the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> concept of the Knowing of the Truth of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Propositions, the idea of
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> actual 'Facts'.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> FAIL.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Have you really got nothing better to do
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> with your time?
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> /Flibble
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> According to medical science I have
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> terminal cancer with little time left. I
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> intend my HP proof rebuttal to be my legacy.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Since you already agreed that the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> pathological self-reference of the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> halting problem proofs makes these proof
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> illegitimate I have no idea why you would
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> be reversing course now.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Excpe that you HAVEN'T shown the proofs to
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> be illegitimate.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Here is Flibble's reply:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Flibble is a well known crank and troll.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> You are wasting your time acting as a crank
>>>>>>>>>>>>>>>>>>>>>>>>>>>> and looking for support
>>>>>>>>>>>>>>>>>>>>>>>>>>>> from other cranks.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> I have boiled the error of the incompleteness
>>>>>>>>>>>>>>>>>>>>>>>>>>> theorem down to a single simple sentence. Try
>>>>>>>>>>>>>>>>>>>>>>>>>>> and find a single error of substance in my
>>>>>>>>>>>>>>>>>>>>>>>>>>> paper:
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> https://www.researchgate.net/publication/333907915_Proof_that_Wittgenstein_is_correct_about_Godel
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Even a bot can be a mere naysayer it doesn't
>>>>>>>>>>>>>>>>>>>>>>>>>>> even take a moron.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Your logic is incorrect because you assume
>>>>>>>>>>>>>>>>>>>>>>>>>> your conclusion as a premise.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> You use the WRONG definition of Truth, and
>>>>>>>>>>>>>>>>>>>>>>>>>> assume that Truth can only be something that
>>>>>>>>>>>>>>>>>>>>>>>>>> is proven, and then from that try to prove
>>>>>>>>>>>>>>>>>>>>>>>>>> that Truth is only something that csn be proven.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> This is incorrect, and thus your whole
>>>>>>>>>>>>>>>>>>>>>>>>>> arguement is invalid.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> For example, in mathematics, there are a
>>>>>>>>>>>>>>>>>>>>>>>>>> number of statements that must either be True
>>>>>>>>>>>>>>>>>>>>>>>>>> of False, there is no possible middle ground,
>>>>>>>>>>>>>>>>>>>>>>>>>> but these statements have not been shown to be
>>>>>>>>>>>>>>>>>>>>>>>>>> provable or disprovable. An example of this is
>>>>>>>>>>>>>>>>>>>>>>>>>> the 3x+1 problem.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Every expression of language does not count as
>>>>>>>>>>>>>>>>>>>>>>>>> true until after it has been proven. There are
>>>>>>>>>>>>>>>>>>>>>>>>> only two ways to determine if an analytical
>>>>>>>>>>>>>>>>>>>>>>>>> expression of language is true. It is an axiom
>>>>>>>>>>>>>>>>>>>>>>>>> that assigned the value of Boolean true. It is
>>>>>>>>>>>>>>>>>>>>>>>>> derived by sound deduction that is ultimately
>>>>>>>>>>>>>>>>>>>>>>>>> anchored in axioms.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Can you PROVE that statement? or is this just a
>>>>>>>>>>>>>>>>>>>>>>>> axiom you need to assume.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Analytical expressions of language are verified
>>>>>>>>>>>>>>>>>>>>>>> to be true entirely on the basis of their meaning.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> WRONG. Formal;
>>>>>>>>>>>>>>>>>>>>> That is a stipulated definition just like a "given"
>>>>>>>>>>>>>>>>>>>>> in geometry.
>>>>>>>>>>>>>>>>>>>>> In these cases all disagreement is simply incorrect.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> If I say that a cat is an animal and you disagree
>>>>>>>>>>>>>>>>>>>>> and say that a cat is the windows of an office
>>>>>>>>>>>>>>>>>>>>> building you are simply wrong.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Except that you can't 'stipulate' a definition for
>>>>>>>>>>>>>>>>>>>> something already defined in the system, especially
>>>>>>>>>>>>>>>>>>>> to something wrong. That violates the rules of
>>>>>>>>>>>>>>>>>>>> Formal Logic.
>>>>>>>>>>>>>>>>>>> (1) That is already what analytical truth means:
>>>>>>>>>>>>>>>>>>> "Analytic propositions are true or not true solely by
>>>>>>>>>>>>>>>>>>> virtue of their meaning"
>>>>>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Analytic%E2%80%93synthetic_distinction
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Which is a definition in PHILOSOPHY, not FORMAL LOGIC.
>>>>>>>>>>>>>>>>> logic is a branch of philosophy
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> https://www.theedadvocate.org/need-know-education-understanding-4-main-branches-philosophy/#:~:text=The%20four%20main%20branches%20of%20philosophy%20are,epistemology%2C%20axiology%2C%20and%20logic.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> But is a different branch than your Epistemology with
>>>>>>>>>>>>>>>> different rules. Formal Logic, which mathematics uses
>>>>>>>>>>>>>>>> defines things differently than what you want to use.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Yes and when formal logic diverges from applying truth
>>>>>>>>>>>>>>> preserving operations to premises that are known to be
>>>>>>>>>>>>>>> true (sound deductive inference) on the basis of the
>>>>>>>>>>>>>>> semantic relevance that is maintained in the syllogism:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> https://en.wikipedia.org/wiki/Syllogism#Basic_structure
>>>>>>>>>>>>>>> then formal logic errs and diverges from truth.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Logical entailment does not require premises to be true
>>>>>>>>>>>>>>> yet still requires true preserving operations to be
>>>>>>>>>>>>>>> applied on the basis of semantic relevance.
>>>>>>>>>>>>>>> Which just says that YOU don't agree with what the whole
>>>>>>>>>>>>>>> world agrees is
>>>>>>>>>>>>>> the truth.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Find, you are on your own.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Things an ignoramus would say:
>>>>>>>>>>>>>> YOU have shown yourself to be incapable of understanding
>>>>>>>>>>>>>> the basic principles of Formal Logic, and are thus
>>>>>>>>>>>>>> unqualified to discuss it.
>>>>>>>>>>>>> When everything that you learn you learn by only rote
>>>>>>>>>>>>> understanding cannot possibly get any more shallow.
>>>>>>>>>>>>>
>>>>>>>>>>>>> I am discussing the philosophical underpinnings upon which
>>>>>>>>>>>>> correct reasoning is based.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Then you are doing it at the wrong place.
>>>>>>>>>>>>
>>>>>>>>>>>> If you disagree with the fundamental logic underpinnings of
>>>>>>>>>>>> all of Formal Logic, you don't start in a peripheral field.
>>>>>>>>>>>> That is useless.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Philosophical foundationalism is the ultimate basis and
>>>>>>>>>>> ground-of-being of correct reasoning and logic, thus 100%
>>>>>>>>>>> directly opposite of peripheral. It cannot possibly be any
>>>>>>>>>>> less peripheral.
>>>>>>>>>>
>>>>>>>>>> You don't read very well I see. I wasn't calling the logic
>>>>>>>>>> underpinnings peripheral, I was calling Computation Theory
>>>>>>>>>> peripheral. If you want to challenge the definition of Truth
>>>>>>>>>> used in Formal Logic, you don't work in a peripheral field,
>>>>>>>>>> which CAN'T change the definition of Truth it uses, because it
>>>>>>>>>> has inhereted it from its
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> (a) The halting problem proofs,
>>>>>>>>> (b) Gödel's 1931 incompleteness theorem,
>>>>>>>>> (c) The Tarski Undefinability theorem and
>>>>>>>>> (d) The liar paradox
>>>>>>>>> all suffer from the same foundational error.
>>>>>>>>
>>>>>>>> I will point out that the liar's paradox is a completely
>>>>>>>> DIFFERENT sort of issue,
>>>>>>>>
>>>>>>>>>
>>>>>>>>> When analytical truth is understood to be connected sets of
>>>>>>>>> true statements that necessarily derive true conclusions then
>>>>>>>>> all four of the above examples lose their basis and cease to
>>>>>>>>> exist.
>>>>>>>>
>>>>>>>> Except that it doesn't. Formal Logic IS built on the concept
>>>>>>>> that you can only prove a conclusion from True Premises.
>>>>>>>>
>>>>>>>> What is isn't built on that Truth has to be proven. Something
>>>>>>>> can be True even if not proven, but if you can't prove it to be
>>>>>>>> true, you can't use it for the basis of a further proof.
>>>>>>>>
>>>>>>>
>>>>>>> Within the body of analytic knowledge an expression of language
>>>>>>> is only true when a connected set of true expressions prove that
>>>>>>> it is true, thus true and unprovable cannot possibly co-exist.
>>>>>>
>>>>>> Then the body of analytic knowledge (or at least your
>>>>>> interpreation of it) can't deal with the body of knowledge of
>>>>>> Mathematics, (and related logic families) as they allow for a
>>>>>> statement to be True without needing to be connected to a proof.
>>>>>> PERIOD.
>>>>> Lets proceed from here. How do we know that a mathematical
>>>>> expression is true aside from its proof that it is true?
>>>>>
>>>>
>>>> We don't. But we might know that it is True or False, and can
>>>> bifurcate on that knowledge.
>>>
>>> Yet the Gödel sentence proposed to be true and unprovable.
>>> That cannot possibly be. If it is true then it is provably true
>>> otherwise it is untrue (not the same as false).
>>>
>>
>> The Godel sentence is more complicated then that. In essence the Godel
>> sentence says the Godel sentence is can not be proven to be true
>> (without directly referencing th Godel sentence).
>>
>> Either the sentence is True, then it can not be actually PROVEN true
>> in the system, since the sentence states, indirectly, that it is
>> unprovable. (The connection of the statement to itself is outside the
>> reach of the algerbra in question).
>>
>> Thus, if it IS true, it must be unprovable.
>
> That is exactly the same as the liar paradox:


Click here to read the complete article
Pages:1234567
server_pubkey.txt

rocksolid light 0.9.7
clearnet tor