Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.theory > #40675 > unrolled thread

Scientific reasoning

Started byolcott <NoOne@NoWhere.com>
First post2021-10-21 10:25 -0500
Last post2021-10-21 19:06 -0400
Articles 20 on this page of 85 — 10 participants

Back to article view | Back to comp.theory


Contents

  Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 10:25 -0500
    Re: Scientific reasoning wij <wyniijj@gmail.com> - 2021-10-21 09:39 -0700
      Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 12:11 -0500
        Re: Scientific reasoning André G. Isaak <agisaak@gm.invalid> - 2021-10-21 11:43 -0600
          Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 13:03 -0500
            Re: Scientific reasoning André G. Isaak <agisaak@gm.invalid> - 2021-10-21 13:58 -0600
              Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 15:40 -0500
                Re: Scientific reasoning André G. Isaak <agisaak@gm.invalid> - 2021-10-21 15:02 -0600
                  Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 16:14 -0500
                    Re: Scientific reasoning André G. Isaak <agisaak@gm.invalid> - 2021-10-21 15:45 -0600
                      Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 16:59 -0500
                        Re: Scientific reasoning André G. Isaak <agisaak@gm.invalid> - 2021-10-21 16:12 -0600
                          Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 17:23 -0500
                            Re: Scientific reasoning Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-21 23:38 +0100
                              Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 18:19 -0500
                                Re: Scientific reasoning Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-22 03:21 +0100
                                  Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 21:34 -0500
                                    Re: Scientific reasoning Richard Damon <Richard@Damon-Family.org> - 2021-10-21 23:08 -0400
                                    Re: Scientific reasoning Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-23 00:41 +0100
                                      Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-22 23:03 -0500
                                        Re: Scientific reasoning Richard Damon <Richard@Damon-Family.org> - 2021-10-23 09:06 -0400
                                        Re: Scientific reasoning Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-24 16:23 +0100
                                          Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-24 17:27 -0500
                                            Re: Scientific reasoning [ if H is correct then it is not incorrect ] Richard Damon <Richard@Damon-Family.org> - 2021-10-24 19:18 -0400
                                              Re: Scientific reasoning [ if H is correct then it is not incorrect ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-26 01:22 +0100
                                                Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-25 19:36 -0500
                                                  Re: Scientific reasoning [ if H is correct then it is not incorrect ] Richard Damon <Richard@Damon-Family.org> - 2021-10-25 20:54 -0400
                                                  Re: Scientific reasoning [ if H is correct then it is not incorrect ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-26 15:28 +0100
                                                    Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-26 09:47 -0500
                                                      Re: Scientific reasoning [ if H is correct then it is not incorrect ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-10-26 08:58 -0700
                                                        Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-26 12:13 -0500
                                                      Re: Scientific reasoning [ if H is correct then it is not incorrect ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-27 00:19 +0100
                                                        Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-26 19:05 -0500
                                                          Re: Scientific reasoning [ if H is correct then it is not incorrect ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-27 14:15 +0100
                                                            Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-27 09:21 -0500
                                                              Re: Scientific reasoning [ if H is correct then it is not incorrect ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-27 21:07 +0100
                                                              Re: Scientific reasoning [ if H is correct then it is not incorrect ] Richard Damon <Richard@Damon-Family.org> - 2021-10-27 19:46 -0400
                                                                Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-27 20:39 -0500
                                                                  Re: Scientific reasoning [ if H is correct then it is not incorrect ] Richard Damon <Richard@Damon-Family.org> - 2021-10-27 21:55 -0400
                                                                    Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-27 21:18 -0500
                                                                      Re: Scientific reasoning [ if H is correct then it is not incorrect ] Richard Damon <Richard@Damon-Family.org> - 2021-10-27 22:51 -0400
                                                                      Re: Scientific reasoning [ if H is correct then it is not incorrect ] André G. Isaak <agisaak@gm.invalid> - 2021-10-27 21:31 -0600
                                                                        Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-27 23:14 -0500
                                                                          Re: Scientific reasoning [ if H is correct then it is not incorrect ] André G. Isaak <agisaak@gm.invalid> - 2021-10-27 22:32 -0600
                                                                            Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-27 23:55 -0500
                                                                              Re: Scientific reasoning [ if H is correct then it is not incorrect ] Richard Damon <news.x.richarddamon@xoxy.net> - 2021-10-28 06:26 -0400
                                            Re: Scientific reasoning [ if H is correct then it is not incorrect ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-26 01:10 +0100
                                              Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-25 19:21 -0500
                                                Re: Scientific reasoning [ if H is correct then it is not incorrect ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-27 00:47 +0100
                                                  Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-26 19:14 -0500
                                                    Re: Scientific reasoning [ if H is correct then it is not incorrect ] Richard Damon <Richard@Damon-Family.org> - 2021-10-26 22:27 -0400
                                                    Re: Scientific reasoning [ if H is correct then it is not incorrect ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-27 14:12 +0100
                                                      Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-27 08:51 -0500
                                                        Re: Scientific reasoning [ if H is correct then it is not incorrect ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-27 17:38 +0100
                                                        Re: Scientific reasoning [ if H is correct then it is not incorrect ] Richard Damon <Richard@Damon-Family.org> - 2021-10-27 19:34 -0400
                                                          Re: Scientific reasoning [ if H is correct then it is not incorrect ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-10-28 06:52 -0700
                                                            Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-28 14:13 -0500
                                                          Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-28 10:11 -0500
                                                            Re: Scientific reasoning [ if H is correct then it is not incorrect ] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-10-28 08:36 -0700
                                                              Re: Scientific reasoning [ if H is correct then it is not incorrect ] olcott <NoOne@NoWhere.com> - 2021-10-28 11:26 -0500
                                                            Re: Scientific reasoning [ if H is correct then it is not incorrect ] Richard Damon <Richard@Damon-Family.org> - 2021-10-28 20:06 -0400
                                Re: Scientific reasoning Alan Mackenzie <acm@muc.de> - 2021-10-22 09:55 +0000
                                  Re: Scientific reasoning olcott <polcott2@gmail.com> - 2021-10-22 10:13 -0500
                                    Re: Scientific reasoning Alan Mackenzie <acm@muc.de> - 2021-10-22 17:06 +0000
                                      Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-22 12:20 -0500
                                    Re: Scientific reasoning Richard Damon <Richard@Damon-Family.org> - 2021-10-22 19:15 -0400
                                      Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-22 23:00 -0500
                                        Re: Scientific reasoning Richard Damon <Richard@Damon-Family.org> - 2021-10-23 05:53 -0400
                            Re: Scientific reasoning André G. Isaak <agisaak@gm.invalid> - 2021-10-21 16:55 -0600
                              Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 18:22 -0500
                                Re: Scientific reasoning André G. Isaak <agisaak@gm.invalid> - 2021-10-21 18:48 -0600
                                  Re: Scientific reasoning olcott <NoOne@NoWhere.com> - 2021-10-21 20:02 -0500
                                    Re: Scientific reasoning Richard Damon <Richard@Damon-Family.org> - 2021-10-22 08:04 -0400
                                      Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ olcott <NoOne@NoWhere.com> - 2021-10-22 08:33 -0500
                                        Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ Richard Damon <Richard@Damon-Family.org> - 2021-10-22 19:12 -0400
                                          Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ olcott <NoOne@NoWhere.com> - 2021-10-22 22:58 -0500
                                            Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ Richard Damon <Richard@Damon-Family.org> - 2021-10-23 05:59 -0400
                                              Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ olcott <NoOne@NoWhere.com> - 2021-10-23 08:44 -0500
                                                Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ Richard Damon <Richard@Damon-Family.org> - 2021-10-23 11:46 -0400
                                                  Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ [ infinite loops ] olcott <NoOne@NoWhere.com> - 2021-10-23 11:59 -0500
                                                    Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ [ infinite loops ] Richard Damon <Richard@Damon-Family.org> - 2021-10-23 13:13 -0400
                                                      Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ [ infinite loops ] olcott <NoOne@NoWhere.com> - 2021-10-23 12:53 -0500
                                                        Re: Scientific reasoning H(P,P) and Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ [ infinite loops ] Richard Damon <Richard@Damon-Family.org> - 2021-10-23 14:16 -0400
                                Re: Scientific reasoning Richard Damon <Richard@Damon-Family.org> - 2021-10-21 23:13 -0400
                            Re: Scientific reasoning Richard Damon <Richard@Damon-Family.org> - 2021-10-21 19:06 -0400

Page 3 of 5 — ← Prev page 1 2 [3] 4 5  Next page →


#40896 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromRichard Damon <Richard@Damon-Family.org>
Date2021-10-27 22:51 -0400
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<cfoeJ.10865$Kw9.2629@fx45.iad>
In reply to#40895
On 10/27/21 10:18 PM, olcott wrote:
> On 10/27/2021 8:55 PM, Richard Damon wrote:
>> On 10/27/21 9:39 PM, olcott wrote:
>>> On 10/27/2021 6:46 PM, Richard Damon wrote:
>>>>
>>>> On 10/27/21 10:21 AM, olcott wrote:
>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>> If the UTM simulation of the input to Ĥqx ⟨Ĥ⟩ ⟨Ĥ⟩ would never reach 
>>>>> its final state (whether or not this simulation is aborted) then it 
>>>>> is necessarily true that Ĥqx transitions to Ĥ.qn correctly.
>>

^^^^^^^^^^^^^^^^ NOTE WHAT YOU SAID HERE ^^^^^^^^^^^^^^^^^^^^^^^^

>>
>>>>
>>>> Finally, you use the right words. We Know that UTM(<H^> <H^>) will 
>>>> act exactly like H^<H^>).
>>>>
>>>> We have that:
>>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn
>>>>
>>>> Where the above initial q0 is that starting state of H^, so this is 
>>>> showing the behavior of H^ (<H^>) which we see ends up at H^qn which 
>>>> is defined as a terminal state for H^, so this PROVES that H^ 
>>>> applied to <H^> is a Halting Computation.
>>> That Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ halts is not the question.
>>> The simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by Ĥq0 never halts is the answer.
>>
>> No, as you said earlier, it is what the input to H (or H^q0) would do 
>> if it was made the input to a UTM, NOT your 'non-utm' partial 
>> simulation H.
>>
>> The right answer to the Halting Problem is ALWAYS about the actual 
>> machine who has been converted into a representation to give to the 
>> decider, never about what happens in the decider.
> 
> So then you are saying that when the halt decider does correctly decide 
> that its input never halts that it can still be wrong?
> 
> That is irrational.
> 

No, if it WAS right about the RIGHT question, it would be right.

THe problem is you look at the wrong question, because you think that a 
simulator that stops is simulation is somehow the 'same' as a simulator 
that never stops it simulation until it actually finishes.

As you said in the paragraph I pointed out above, what matters is what a 
UTM does with that input. and a real UTM doesn't stop until its 
simulation reaches an end, and when we do that, the computation halts.

(Note, that is NOT changing H to be a UTM, that is changing JUST the top 
level machien with the UTM, leaving the code for the input, which 
INCLUDES its copy of H, the original one, that does abort its 
simulation, incorrectly)

You either have the wrong answer to the right question or a maybe right 
answer to the wrong questions, but these two wrongs don't make a right, 
you are just wrong.

YOU are irrational.

FAIL.

[toc] | [prev] | [next] | [standalone]


#40897 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-10-27 21:31 -0600
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<sld5j0$qsc$1@dont-email.me>
In reply to#40895
On 2021-10-27 20:18, olcott wrote:
> On 10/27/2021 8:55 PM, Richard Damon wrote:
>> On 10/27/21 9:39 PM, olcott wrote:
>>> On 10/27/2021 6:46 PM, Richard Damon wrote:
>>>>
>>>> On 10/27/21 10:21 AM, olcott wrote:
>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>> If the UTM simulation of the input to Ĥqx ⟨Ĥ⟩ ⟨Ĥ⟩ would never reach 
>>>>> its final state (whether or not this simulation is aborted) then it 
>>>>> is necessarily true that Ĥqx transitions to Ĥ.qn correctly.
>>
>> ^^^^^^^^^^^^^^^^^ NOTE WHAT YOU SAID HERE ^^^^^^^^^^^^^^^^^^^^^^^^
>>
>>>>
>>>> Finally, you use the right words. We Know that UTM(<H^> <H^>) will 
>>>> act exactly like H^<H^>).
>>>>
>>>> We have that:
>>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn
>>>>
>>>> Where the above initial q0 is that starting state of H^, so this is 
>>>> showing the behavior of H^ (<H^>) which we see ends up at H^qn which 
>>>> is defined as a terminal state for H^, so this PROVES that H^ 
>>>> applied to <H^> is a Halting Computation.
>>> That Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ halts is not the question.
>>> The simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by Ĥq0 never halts is the answer.
>>
>> No, as you said earlier, it is what the input to H (or H^q0) would do 
>> if it was made the input to a UTM, NOT your 'non-utm' partial 
>> simulation H.
>>
>> The right answer to the Halting Problem is ALWAYS about the actual 
>> machine who has been converted into a representation to give to the 
>> decider, never about what happens in the decider.
> 
> So then you are saying that when the halt decider does correctly decide 
> that its input never halts that it can still be wrong?
> 
> That is irrational.

You've got that completely ass-backwards. You're the one arguing that 
when your decider gets the wrong answer as defined by the problem it is 
somehow still deciding 'correctly'.

*THAT's* irrational.

André


-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#40898 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

Fromolcott <NoOne@NoWhere.com>
Date2021-10-27 23:14 -0500
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<F9udnTj47-8Wvuf8nZ2dnUU7-YHNnZ2d@giganews.com>
In reply to#40897
On 10/27/2021 10:31 PM, André G. Isaak wrote:
> On 2021-10-27 20:18, olcott wrote:
>> On 10/27/2021 8:55 PM, Richard Damon wrote:
>>> On 10/27/21 9:39 PM, olcott wrote:
>>>> On 10/27/2021 6:46 PM, Richard Damon wrote:
>>>>>
>>>>> On 10/27/21 10:21 AM, olcott wrote:
>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>> If the UTM simulation of the input to Ĥqx ⟨Ĥ⟩ ⟨Ĥ⟩ would never 
>>>>>> reach its final state (whether or not this simulation is aborted) 
>>>>>> then it is necessarily true that Ĥqx transitions to Ĥ.qn correctly.
>>>
>>> ^^^^^^^^^^^^^^^^^ NOTE WHAT YOU SAID HERE ^^^^^^^^^^^^^^^^^^^^^^^^
>>>
>>>>>
>>>>> Finally, you use the right words. We Know that UTM(<H^> <H^>) will 
>>>>> act exactly like H^<H^>).
>>>>>
>>>>> We have that:
>>>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn
>>>>>
>>>>> Where the above initial q0 is that starting state of H^, so this is 
>>>>> showing the behavior of H^ (<H^>) which we see ends up at H^qn 
>>>>> which is defined as a terminal state for H^, so this PROVES that H^ 
>>>>> applied to <H^> is a Halting Computation.
>>>> That Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ halts is not the question.
>>>> The simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by Ĥq0 never halts is the answer.
>>>
>>> No, as you said earlier, it is what the input to H (or H^q0) would do 
>>> if it was made the input to a UTM, NOT your 'non-utm' partial 
>>> simulation H.
>>>
>>> The right answer to the Halting Problem is ALWAYS about the actual 
>>> machine who has been converted into a representation to give to the 
>>> decider, never about what happens in the decider.
>>
>> So then you are saying that when the halt decider does correctly 
>> decide that its input never halts that it can still be wrong?
>>
>> That is irrational.
> 
> You've got that completely ass-backwards. You're the one arguing that 
> when your decider gets the wrong answer as defined by the problem it is 
> somehow still deciding 'correctly'.
> 

As long as the halt decider correctly decides that its input never halts

Then when we directly execute Ĥ applied to ⟨Ĥ⟩ and it:
(a) Halts.
(b) Destroys the whole universe.
(c) Converts all fascists to true Christianity.
(d) Circumnavigates the globe.
(e) Cures cancer.
(f) Raises the dead.

The halt decider's halt status decision about its input remains correct.

If we know that we have a black cat then saying that we don't have a
cat is irrational. Tautologies cannot possibly fail. If you believe
that they can fail then you must be irrational.


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#40899 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromAndré G. Isaak <agisaak@gm.invalid>
Date2021-10-27 22:32 -0600
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<sld94d$b1n$1@dont-email.me>
In reply to#40898
On 2021-10-27 22:14, olcott wrote:
> On 10/27/2021 10:31 PM, André G. Isaak wrote:
>> On 2021-10-27 20:18, olcott wrote:
>>> On 10/27/2021 8:55 PM, Richard Damon wrote:
>>>> On 10/27/21 9:39 PM, olcott wrote:
>>>>> On 10/27/2021 6:46 PM, Richard Damon wrote:
>>>>>>
>>>>>> On 10/27/21 10:21 AM, olcott wrote:
>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>> If the UTM simulation of the input to Ĥqx ⟨Ĥ⟩ ⟨Ĥ⟩ would never 
>>>>>>> reach its final state (whether or not this simulation is aborted) 
>>>>>>> then it is necessarily true that Ĥqx transitions to Ĥ.qn correctly.
>>>>
>>>> ^^^^^^^^^^^^^^^^^ NOTE WHAT YOU SAID HERE ^^^^^^^^^^^^^^^^^^^^^^^^
>>>>
>>>>>>
>>>>>> Finally, you use the right words. We Know that UTM(<H^> <H^>) will 
>>>>>> act exactly like H^<H^>).
>>>>>>
>>>>>> We have that:
>>>>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn
>>>>>>
>>>>>> Where the above initial q0 is that starting state of H^, so this 
>>>>>> is showing the behavior of H^ (<H^>) which we see ends up at H^qn 
>>>>>> which is defined as a terminal state for H^, so this PROVES that 
>>>>>> H^ applied to <H^> is a Halting Computation.
>>>>> That Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ halts is not the question.
>>>>> The simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by Ĥq0 never halts is the answer.
>>>>
>>>> No, as you said earlier, it is what the input to H (or H^q0) would 
>>>> do if it was made the input to a UTM, NOT your 'non-utm' partial 
>>>> simulation H.
>>>>
>>>> The right answer to the Halting Problem is ALWAYS about the actual 
>>>> machine who has been converted into a representation to give to the 
>>>> decider, never about what happens in the decider.
>>>
>>> So then you are saying that when the halt decider does correctly 
>>> decide that its input never halts that it can still be wrong?
>>>
>>> That is irrational.
>>
>> You've got that completely ass-backwards. You're the one arguing that 
>> when your decider gets the wrong answer as defined by the problem it 
>> is somehow still deciding 'correctly'.
>>
> 
> As long as the halt decider correctly decides that its input never halts

But it doesn't decide this correctly. You keep *claiming* that it 
decides correctly, but that's just your delusions talking.

> Then when we directly execute Ĥ applied to ⟨Ĥ⟩ and it:
> (a) Halts.
> (b) Destroys the whole universe.
> (c) Converts all fascists to true Christianity.
> (d) Circumnavigates the globe.
> (e) Cures cancer.
> (f) Raises the dead.
> 
> The halt decider's halt status decision about its input remains correct.

No. If the halt decider's decision were correct, then we would expect 
(g) when we directly execute Ĥ applied to ⟨Ĥ⟩ it runs forever, because 
that's what the claim that Ĥ applied to ⟨Ĥ⟩ doesn't halt *means*, and 
that's what the halt decider is supposed to be deciding.

> If we know that we have a black cat then saying that we don't have a > cat is irrational. Tautologies cannot possibly fail. If you believe
> that they can fail then you must be irrational.

But none of your claims consitute tautologies.

Besides, last I checked a 'black cat' was a WWII-era bomber. Or a type 
of firecracker. Or a Marvel comic-book character. Or a brand of peanut 
butter.

André


-- 
To email remove 'invalid' & replace 'gm' with well known Google mail 
service.

[toc] | [prev] | [next] | [standalone]


#40900 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

Fromolcott <NoOne@NoWhere.com>
Date2021-10-27 23:55 -0500
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<5qadnRfuipXIsOf8nZ2dnUU7-IXNnZ2d@giganews.com>
In reply to#40899
On 10/27/2021 11:32 PM, André G. Isaak wrote:
> On 2021-10-27 22:14, olcott wrote:
>> On 10/27/2021 10:31 PM, André G. Isaak wrote:
>>> On 2021-10-27 20:18, olcott wrote:
>>>> On 10/27/2021 8:55 PM, Richard Damon wrote:
>>>>> On 10/27/21 9:39 PM, olcott wrote:
>>>>>> On 10/27/2021 6:46 PM, Richard Damon wrote:
>>>>>>>
>>>>>>> On 10/27/21 10:21 AM, olcott wrote:
>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>>> If the UTM simulation of the input to Ĥqx ⟨Ĥ⟩ ⟨Ĥ⟩ would never 
>>>>>>>> reach its final state (whether or not this simulation is 
>>>>>>>> aborted) then it is necessarily true that Ĥqx transitions to 
>>>>>>>> Ĥ.qn correctly.
>>>>>
>>>>> ^^^^^^^^^^^^^^^^^ NOTE WHAT YOU SAID HERE ^^^^^^^^^^^^^^^^^^^^^^^^
>>>>>
>>>>>>>
>>>>>>> Finally, you use the right words. We Know that UTM(<H^> <H^>) 
>>>>>>> will act exactly like H^<H^>).
>>>>>>>
>>>>>>> We have that:
>>>>>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn
>>>>>>>
>>>>>>> Where the above initial q0 is that starting state of H^, so this 
>>>>>>> is showing the behavior of H^ (<H^>) which we see ends up at H^qn 
>>>>>>> which is defined as a terminal state for H^, so this PROVES that 
>>>>>>> H^ applied to <H^> is a Halting Computation.
>>>>>> That Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ halts is not the question.
>>>>>> The simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by Ĥq0 never halts is the answer.
>>>>>
>>>>> No, as you said earlier, it is what the input to H (or H^q0) would 
>>>>> do if it was made the input to a UTM, NOT your 'non-utm' partial 
>>>>> simulation H.
>>>>>
>>>>> The right answer to the Halting Problem is ALWAYS about the actual 
>>>>> machine who has been converted into a representation to give to the 
>>>>> decider, never about what happens in the decider.
>>>>
>>>> So then you are saying that when the halt decider does correctly 
>>>> decide that its input never halts that it can still be wrong?
>>>>
>>>> That is irrational.
>>>
>>> You've got that completely ass-backwards. You're the one arguing that 
>>> when your decider gets the wrong answer as defined by the problem it 
>>> is somehow still deciding 'correctly'.
>>>
>>
>> As long as the halt decider correctly decides that its input never halts
> 
> But it doesn't decide this correctly. You keep *claiming* that it 
> decides correctly, but that's just your delusions talking.
> 
>> Then when we directly execute Ĥ applied to ⟨Ĥ⟩ and it:
>> (a) Halts.
>> (b) Destroys the whole universe.
>> (c) Converts all fascists to true Christianity.
>> (d) Circumnavigates the globe.
>> (e) Cures cancer.
>> (f) Raises the dead.
>>
>> The halt decider's halt status decision about its input remains correct.
> 
> No. If the halt decider's decision were correct, then we would expect 
> (g) when we directly execute Ĥ applied to ⟨Ĥ⟩ it runs forever, because 
> that's what the claim that Ĥ applied to ⟨Ĥ⟩ doesn't halt *means*, and 
> that's what the halt decider is supposed to be deciding.
> 
>> If we know that we have a black cat then saying that we don't have a > 
>> cat is irrational. Tautologies cannot possibly fail. If you believe
>> that they can fail then you must be irrational.
> 
> But none of your claims consitute tautologies.
> 

When the halt decider correctly decides that the simulation of its input 
never reaches the final state of this input (whether or not this 
simulation is aborted) then the halt decider has decided the halt status 
of this input correctly. If you don't understand that is a tautology 
then you are not very bright.

> Besides, last I checked a 'black cat' was a WWII-era bomber. Or a type 
> of firecracker. Or a Marvel comic-book character. Or a brand of peanut 
> butter.
> 
> André
> 
> 


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#40901 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromRichard Damon <news.x.richarddamon@xoxy.net>
Date2021-10-28 06:26 -0400
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<sldtt7$764$1@dont-email.me>
In reply to#40900
On 10/28/21 12:55 AM, olcott wrote:
> On 10/27/2021 11:32 PM, André G. Isaak wrote:
>> On 2021-10-27 22:14, olcott wrote:
>>> On 10/27/2021 10:31 PM, André G. Isaak wrote:
>>>> On 2021-10-27 20:18, olcott wrote:
>>>>> On 10/27/2021 8:55 PM, Richard Damon wrote:
>>>>>> On 10/27/21 9:39 PM, olcott wrote:
>>>>>>> On 10/27/2021 6:46 PM, Richard Damon wrote:
>>>>>>>>
>>>>>>>> On 10/27/21 10:21 AM, olcott wrote:
>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>>>> If the UTM simulation of the input to Ĥqx ⟨Ĥ⟩ ⟨Ĥ⟩ would never 
>>>>>>>>> reach its final state (whether or not this simulation is 
>>>>>>>>> aborted) then it is necessarily true that Ĥqx transitions to 
>>>>>>>>> Ĥ.qn correctly.
>>>>>>

       ^^^^^^^^^^^^^^^^^ NOTE WHAT YOU SAID HERE ^^^^^^^^^^^^^^^^^^^^^^^^

>>>>>>
>>>>>>>>
>>>>>>>> Finally, you use the right words. We Know that UTM(<H^> <H^>) 
>>>>>>>> will act exactly like H^<H^>).
>>>>>>>>
>>>>>>>> We have that:
>>>>>>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn
>>>>>>>>
>>>>>>>> Where the above initial q0 is that starting state of H^, so this 
>>>>>>>> is showing the behavior of H^ (<H^>) which we see ends up at 
>>>>>>>> H^qn which is defined as a terminal state for H^, so this PROVES 
>>>>>>>> that H^ applied to <H^> is a Halting Computation.
>>>>>>> That Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ halts is not the question.
>>>>>>> The simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by Ĥq0 never halts is the answer.
>>>>>>
>>>>>> No, as you said earlier, it is what the input to H (or H^q0) would 
>>>>>> do if it was made the input to a UTM, NOT your 'non-utm' partial 
>>>>>> simulation H.
>>>>>>
>>>>>> The right answer to the Halting Problem is ALWAYS about the actual 
>>>>>> machine who has been converted into a representation to give to 
>>>>>> the decider, never about what happens in the decider.
>>>>>
>>>>> So then you are saying that when the halt decider does correctly 
>>>>> decide that its input never halts that it can still be wrong?
>>>>>
>>>>> That is irrational.
>>>>
>>>> You've got that completely ass-backwards. You're the one arguing 
>>>> that when your decider gets the wrong answer as defined by the 
>>>> problem it is somehow still deciding 'correctly'.
>>>>
>>>
>>> As long as the halt decider correctly decides that its input never halts
>>
>> But it doesn't decide this correctly. You keep *claiming* that it 
>> decides correctly, but that's just your delusions talking.
>>
>>> Then when we directly execute Ĥ applied to ⟨Ĥ⟩ and it:
>>> (a) Halts.
>>> (b) Destroys the whole universe.
>>> (c) Converts all fascists to true Christianity.
>>> (d) Circumnavigates the globe.
>>> (e) Cures cancer.
>>> (f) Raises the dead.
>>>
>>> The halt decider's halt status decision about its input remains correct.
>>
>> No. If the halt decider's decision were correct, then we would expect 
>> (g) when we directly execute Ĥ applied to ⟨Ĥ⟩ it runs forever, because 
>> that's what the claim that Ĥ applied to ⟨Ĥ⟩ doesn't halt *means*, and 
>> that's what the halt decider is supposed to be deciding.
>>
>>> If we know that we have a black cat then saying that we don't have a 
>>> > cat is irrational. Tautologies cannot possibly fail. If you believe
>>> that they can fail then you must be irrational.
>>
>> But none of your claims consitute tautologies.
>>
> 
> When the halt decider correctly decides that the simulation of its input 
> never reaches the final state of this input (whether or not this 
> simulation is aborted) then the halt decider has decided the halt status 
> of this input correctly. If you don't understand that is a tautology 
> then you are not very bright.
> 

The problem is you are using two different definitions of 'simulation'

The problem statement uses simulation by a real UTM (see your statement 
marked above).

Your proof looks at the partial simulation done by H (or the copy of it 
in H^). There REAL simulation by the UTM does reach a Halting State. The 
partial simulation doesn't because it stops the simulation too soon 
because the decider used unsound logic to 'show' that the simulation 
won't halt (it treats it as a different machine built with a different 
decider).

This is why H is wrong, its whole logic is about a different problem. 
Maybe it is right about that other problem, but it isn't right about the 
actual Halting Problem.

You are using properties of 'simulation' that depend on the simulation 
being by an actual UTM that totally simulates its input, but then you 
assume they also hold for your partial simulation also, which they don't.

It doesn't matter that it acts like one until it decides, to be one it 
needs to NEVER stop.

THat is like claiming your immotal because you haven't died yet.

>> Besides, last I checked a 'black cat' was a WWII-era bomber. Or a type 
>> of firecracker. Or a Marvel comic-book character. Or a brand of peanut 
>> butter.
>>
>> André
>>
>>
> 
> 

[toc] | [prev] | [next] | [standalone]


#40812 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-10-26 01:10 +0100
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<87r1c81w9s.fsf@bsb.me.uk>
In reply to#40782
olcott <NoOne@NoWhere.com> writes:

> On 10/24/2021 10:23 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>> 
>>> On 10/22/2021 6:41 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 10/21/2021 9:21 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 10/21/2021 5:38 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>
>>>>>>>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn
>>>>>>>>> We can tell that Ĥq0 correctly determines the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩
>>>>>>>>> entirely on the basis of the meaning of the words.
>>>>>>>> We can tell, based entirely on how Ĥ is defined, that no such Ĥ can
>>>>>>>> exit.
>>>>>>>
>>>>>>> You can only "tell" this by making sure to dismiss what I say
>>>>>>> out-of-hand without carefully evaluating it point-by-point.
>>>>>>
>>>>>> Everyone (except you) can tell it by reading the proof given in Linz.
>>>>>> Everything Linz says applies to what you consider your very special
>>>>>> "simulating halt deciders".
>>>>>>
>>>>>
>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>>
>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>>
>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>>
>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>>
>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>
>>>> You are being childish again.  It's not a good look.  You should try
>>>> engaging with the point I made.
>>>
>>> The words above are like say that when we know that we have a black
>>> cat then we know that we have a cat, and yet you still disagree.
>> We know there are black cats.  We know they are all cats.  We know there
>> are no halt deciders using a few trivial steps that you pretend to not
>> (or perhaps really don't) understand.
>
> Of course when you say there are no halt decider you do not mean that
> they are no halt deciders you mean that there are no universal halt
> deciders. It would be better if you say exactly what you mean and mean
> exactly what you say.

There is no need for the qualification.  A halt decider is well know
term.  What's more, /you/ are talking about halt deciders (what you now
want to call "universal" halt deciders) because you are using Linz's Ĥ
to refer to the same class of TM that Linz does.  Or was that a lie?

You can't keep equivocating.  If you write Ĥ to mean what Linz means,
then the H from which it is derived is a (universal) halt decider.

But if you want to talk about TMs that only get only some (special) case
right, then you need to define the expected behaviour and, unless you
want to spread more confusion, use a different letter.  I am certain you
won't do this.  You will keep dishonestly referring to Ĥ.

> As long as I can show how the impossible input is correctly decided as
> not halting I have totally refuted the proof. No more details than
> this are required.

I am only correcting the dishonest discussion of Linz's Ĥ.  Linz's Ĥ is
defined from an H that gets all cases right.

> If someone claims X cannot possibly be done and I show X being done,
> then I have totally proved them wrong. That you disagree with this is
> either ridiculous or dishonest.

You are talking about Linz's H/Ĥ pair and deceptively removing key
conditions.  That does not show that what you claim can be done.  You
have not even stated what your TM J should do.

If you want to go back to the claim from Dec 2018 that turned out to be
"poetic licence" then, if you won't publish the TM, you need at least to
specify it.  You can't "borrow" Linz's specification without having to
accept the consequences of it.

>> At the key step you simply remove the condition that
>> applies and you replace it with your own words.  That's not how
>> mathematics works!
>
>> If you write the line
>>    q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn
>> and you follow that with any condition other than "if Ĥ applied ⟨Ĥ⟩ does
>> not halt" then you are not talking about Linz's Ĥ.  
>
> If the halt decider at Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ correctly determines that its input
> never halts then even the fact that Ĥ applied to ⟨Ĥ⟩ halts cannot
> possibly contradict this.

Asserting what is "correct" does not make it so.

For Linz's Ĥ, Ĥ applied to ⟨Ĥ⟩ halts (in state Ĥqn) if (and only if) Ĥ
applied to ⟨Ĥ⟩ does not halt.

> YOU DISAGREE WITH THIS:
> If X is correct about Y then X is not incorrect about Y.

No.  I disagree that your words reflect how Linz's Ĥ is specified.  Your
assertions of what is a correct determination is just so much hot air.

When you write:

  q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn

always add "if (and only if) Ĥ applied to ⟨Ĥ⟩ does not halt".  Any
waffle you care to add on top of that is up to you, but deleting the key
phrase is lying.

> If the halt decider at Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ correctly determines that its input never halts then even the fact that Ĥ applied to ⟨Ĥ⟩ halts cannot 
> possibly contradict this.
>
> YOU DISAGREE WITH THIS:
> If X is correct about Y then X is not incorrect about Y.
>
> If the halt decider at Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ correctly determines that its input never halts then even the fact that Ĥ applied to ⟨Ĥ⟩ halts cannot 
> possibly contradict this.
>
> YOU DISAGREE WITH THIS:
> If X is correct about Y then X is not incorrect about Y.

How very childish.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#40818 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

Fromolcott <NoOne@NoWhere.com>
Date2021-10-25 19:21 -0500
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<hN-dnXD4w_me1-r8nZ2dnUU7-dnNnZ2d@giganews.com>
In reply to#40812
On 10/25/2021 7:10 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 10/24/2021 10:23 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 10/22/2021 6:41 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 10/21/2021 9:21 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> On 10/21/2021 5:38 PM, Ben Bacarisse wrote:
>>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>>>
>>>>>>>>>> q0 ⟨Ĥ⟩ ⊢* Ĥq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥqn
>>>>>>>>>> We can tell that Ĥq0 correctly determines the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩
>>>>>>>>>> entirely on the basis of the meaning of the words.
>>>>>>>>> We can tell, based entirely on how Ĥ is defined, that no such Ĥ can
>>>>>>>>> exit.
>>>>>>>>
>>>>>>>> You can only "tell" this by making sure to dismiss what I say
>>>>>>>> out-of-hand without carefully evaluating it point-by-point.
>>>>>>>
>>>>>>> Everyone (except you) can tell it by reading the proof given in Linz.
>>>>>>> Everything Linz says applies to what you consider your very special
>>>>>>> "simulating halt deciders".
>>>>>>>
>>>>>>
>>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>>>
>>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>>>
>>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>>>
>>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>>>
>>>>>> The halt decider must only correctly decide whether or not its input halts on its input. As long as this decision is correct then it is
>>>>>> impossible for anything else to show that the halt decider is incorrect.
>>>>>
>>>>> You are being childish again.  It's not a good look.  You should try
>>>>> engaging with the point I made.
>>>>
>>>> The words above are like say that when we know that we have a black
>>>> cat then we know that we have a cat, and yet you still disagree.
>>> We know there are black cats.  We know they are all cats.  We know there
>>> are no halt deciders using a few trivial steps that you pretend to not
>>> (or perhaps really don't) understand.
>>
>> Of course when you say there are no halt decider you do not mean that
>> they are no halt deciders you mean that there are no universal halt
>> deciders. It would be better if you say exactly what you mean and mean
>> exactly what you say.
> 
> There is no need for the qualification.  A halt decider is well know
> term.  What's more, /you/ are talking about halt deciders (what you now
> want to call "universal" halt deciders) because you are using Linz's Ĥ
> to refer to the same class of TM that Linz does.  Or was that a lie?
> 
> You can't keep equivocating.  If you write Ĥ to mean what Linz means,
> then the H from which it is derived is a (universal) halt decider.
> 
> But if you want to talk about TMs that only get only some (special) case
> right, then you need to define the expected behaviour and, unless you
> want to spread more confusion, use a different letter.  I am certain you
> won't do this.  You will keep dishonestly referring to Ĥ.
> 
>> As long as I can show how the impossible input is correctly decided as
>> not halting I have totally refuted the proof. No more details than
>> this are required.
> 
> I am only correcting the dishonest discussion of Linz's Ĥ.  Linz's Ĥ is
> defined from an H that gets all cases right.
> 
Within the specific context of the details of the proof ⟨Ĥ⟩ ⟨Ĥ⟩ is 
defined as an input that H gets wrong thus when I show that H decides 
⟨Ĥ⟩ ⟨Ĥ⟩ correctly Linz has been refuted.

Are you willing to admit that if it is shown that H correctly decides 
the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going 
to dishonestly dodge this key point?


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#40873 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-10-27 00:47 +0100
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<87tuh3xsav.fsf@bsb.me.uk>
In reply to#40818
olcott <NoOne@NoWhere.com> writes:

> Within the specific context of the details of the proof ⟨Ĥ⟩ ⟨Ĥ⟩ is
> defined as an input that H gets wrong thus when I show that H decides
> ⟨Ĥ⟩ ⟨Ĥ⟩ correctly Linz has been refuted.

All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.

> Are you willing to admit that if it is shown that H correctly decides
> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
> to dishonestly dodge this key point?

I keep trying not to dodge it but you keep ignoring my answer.  No proof
is invalided by other truths.  You might render all of mathematics
inconsistent, but previously valid chains of reasoning remains valid.
You made it plain that don't accept what a proof is when you stated that
if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
retracted this incorrect statement.

As it happens, you can't show that Linz's H is correct about the input
⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to note
my answer to this hypothetical question for years, but you keep
pretending not to notice.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#40875 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

Fromolcott <NoOne@NoWhere.com>
Date2021-10-26 19:14 -0500
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<M9CdnUcw9-hMBOX8nZ2dnUU7-IXNnZ2d@giganews.com>
In reply to#40873
On 10/26/2021 6:47 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> Within the specific context of the details of the proof ⟨Ĥ⟩ ⟨Ĥ⟩ is
>> defined as an input that H gets wrong thus when I show that H decides
>> ⟨Ĥ⟩ ⟨Ĥ⟩ correctly Linz has been refuted.
> 
> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.
> 
>> Are you willing to admit that if it is shown that H correctly decides
>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
>> to dishonestly dodge this key point?
> 
> I keep trying not to dodge it but you keep ignoring my answer.  No proof
> is invalided by other truths.  You might render all of mathematics
> inconsistent, but previously valid chains of reasoning remains valid.
> You made it plain that don't accept what a proof is when you stated that
> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
> retracted this incorrect statement.
> 
> As it happens, you can't show that Linz's H is correct about the input
> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to note
> my answer to this hypothetical question for years, but you keep
> pretending not to notice.
> 

I ask you a YES / NO question and you dodge. I did not ask you to 
analyze the question you don't understand it well enough to do this 
correctly.

That you keep dodging questions like this proves that you desperately 
want to avoid any mutual understanding and only care about rebuttal even 
at the cost of truth.

THIS IS A FREAKING MANDATORY PREREQUISITE:
Are you willing to admit that if it is shown that H correctly decides
the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
to dishonestly dodge this key point?


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#40879 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromRichard Damon <Richard@Damon-Family.org>
Date2021-10-26 22:27 -0400
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<1O2eJ.309$831.208@fx40.iad>
In reply to#40875
On 10/26/21 8:14 PM, olcott wrote:
> On 10/26/2021 6:47 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> Within the specific context of the details of the proof ⟨Ĥ⟩ ⟨Ĥ⟩ is
>>> defined as an input that H gets wrong thus when I show that H decides
>>> ⟨Ĥ⟩ ⟨Ĥ⟩ correctly Linz has been refuted.
>>
>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.
>>
>>> Are you willing to admit that if it is shown that H correctly decides
>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
>>> to dishonestly dodge this key point?
>>
>> I keep trying not to dodge it but you keep ignoring my answer.  No proof
>> is invalided by other truths.  You might render all of mathematics
>> inconsistent, but previously valid chains of reasoning remains valid.
>> You made it plain that don't accept what a proof is when you stated that
>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
>> retracted this incorrect statement.
>>
>> As it happens, you can't show that Linz's H is correct about the input
>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to note
>> my answer to this hypothetical question for years, but you keep
>> pretending not to notice.
>>
> 
> I ask you a YES / NO question and you dodge. I did not ask you to 
> analyze the question you don't understand it well enough to do this 
> correctly.
> 
> That you keep dodging questions like this proves that you desperately 
> want to avoid any mutual understanding and only care about rebuttal even 
> at the cost of truth.
> 
> THIS IS A FREAKING MANDATORY PREREQUISITE:
> Are you willing to admit that if it is shown that H correctly decides
> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
> to dishonestly dodge this key point?
> 
> 

Well, the problem is that <H^> <H^> is just a string, and strings don't 
have behavior.

The Halting Problem is asking if UTM(<H^><H^>) will halt.

You are talking about the nonsense of will H abort is simulation of 
<H^><H^> before it sees a halting state.

The nonsese of adding things like whether or not it aborts the 
simulation is just blather, as for a given H, that is a fixed fact and 
the fact that the machine being looked at contains a copy of H, you 
can't change the 'global' definition of H and reason about the given input.

If you change your logic to whether or not THIS copy is changed to not 
halt, then you would get something, except for that fact that this just 
proves that your assertion is WRONG, as replacing that top level H with 
a UTM (but keeping the copy in H^ to still be the original) shows that 
it halts.

[toc] | [prev] | [next] | [standalone]


#40880 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-10-27 14:12 +0100
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<87fssmy5ko.fsf@bsb.me.uk>
In reply to#40875
olcott <NoOne@NoWhere.com> writes:

> On 10/26/2021 6:47 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:

>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.
>> 
>>> Are you willing to admit that if it is shown that H correctly decides
>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
>>> to dishonestly dodge this key point?
>>
>> I keep trying not to dodge it but you keep ignoring my answer.  No proof
>> is invalided by other truths.  You might render all of mathematics
>> inconsistent, but previously valid chains of reasoning remains valid.
>>
>> You made it plain that don't accept what a proof is when you stated that
>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
>> retracted this incorrect statement.
>>
>> As it happens, you can't show that Linz's H is correct about the input
>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to note
>> my answer to this hypothetical question for years, but you keep
>> pretending not to notice. 
>
> I ask you a YES / NO question and you dodge.

How could you miss the answer yet again?  Clearly it's no: I don't
accept that if it is shown that H correctly decides the halt status of
⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted.  How was "no proof is invalided by
other truths" not clearly a "no"?  I had no idea you would need it
spelled out.

Anyway, I've spelled it out now: no.  If you want to see why you are
wrong to think the answer might be yes, the explanation is all there.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#40882 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

Fromolcott <NoOne@NoWhere.com>
Date2021-10-27 08:51 -0500
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<IvidnQKtStfgxOT8nZ2dnUU7-Y3NnZ2d@giganews.com>
In reply to#40880
On 10/27/2021 8:12 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 10/26/2021 6:47 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
> 
>>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.
>>>
>>>> Are you willing to admit that if it is shown that H correctly decides
>>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
>>>> to dishonestly dodge this key point?
>>>
>>> I keep trying not to dodge it but you keep ignoring my answer.  No proof
>>> is invalided by other truths.  You might render all of mathematics
>>> inconsistent, but previously valid chains of reasoning remains valid.
>>>
>>> You made it plain that don't accept what a proof is when you stated that
>>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
>>> retracted this incorrect statement.
>>>
>>> As it happens, you can't show that Linz's H is correct about the input
>>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to note
>>> my answer to this hypothetical question for years, but you keep
>>> pretending not to notice.
>>
>> I ask you a YES / NO question and you dodge.
> 
> How could you miss the answer yet again?  Clearly it's no: I don't
> accept that if it is shown that H correctly decides the halt status of
> ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted. 

So you reject the idea of a semantic tautology.
If X says Y is true and I prove that Y is false then X could still be 
correct. No wonder we are having trouble communicating, you are simply 
irrational.

>  How was "no proof is invalided by
> other truths" not clearly a "no"?  I had no idea you would need it
> spelled out.
> 
> Anyway, I've spelled it out now: no.  If you want to see why you are
> wrong to think the answer might be yes, the explanation is all there.
> 


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#40884 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-10-27 17:38 +0100
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<871r46xw16.fsf@bsb.me.uk>
In reply to#40882
olcott <NoOne@NoWhere.com> writes:

> On 10/27/2021 8:12 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>> 
>>> On 10/26/2021 6:47 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>> 
>>>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.
>>>>
>>>>> Are you willing to admit that if it is shown that H correctly decides
>>>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
>>>>> to dishonestly dodge this key point?
>>>>
>>>> I keep trying not to dodge it but you keep ignoring my answer.  No proof
>>>> is invalided by other truths.  You might render all of mathematics
>>>> inconsistent, but previously valid chains of reasoning remains valid.
>>>>
>>>> You made it plain that don't accept what a proof is when you stated that
>>>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
>>>> retracted this incorrect statement.
>>>>
>>>> As it happens, you can't show that Linz's H is correct about the input
>>>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to note
>>>> my answer to this hypothetical question for years, but you keep
>>>> pretending not to notice.
>>>
>>> I ask you a YES / NO question and you dodge.
>> How could you miss the answer yet again?  Clearly it's no: I don't
>> accept that if it is shown that H correctly decides the halt status of
>> ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted. 
>
> So you reject the idea of a semantic tautology.

No.  I reject what you said, not any further extension of it that you
care to propose.  Proofs are logical entailments, and as such are not
invalidated by any others.  To invalidate the poof you have struggled
with for decades, you need to show an error in it (ut you can't because
it's valid).  If, in the unlikely event you prove something that
contradicts it, you will have shown an inconsistency.  The original
proof remains valid (though pointless).

> If X says Y is true and I prove that Y is false then X could still be
> correct. No wonder we are having trouble communicating, you are simply
> irrational.

No, the explanation lies in the fact that you don't know that you have
said three different things, only one of which I reject.  Here is what I
reject, re-phrased for this last scenario: if X proves Y and you prove
~Y, X's proof would still be valid, but the whole deductive system would
have been shown to be inconsistent.

You don't know what other people (logicians, mathematicians, educated
lay people) mean when that talk about proofs.  You still claim that if
A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  The problem communicating comes from not
having a shared understanding of the basic terms.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#40891 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromRichard Damon <Richard@Damon-Family.org>
Date2021-10-27 19:34 -0400
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<rmleJ.761$6a3.581@fx41.iad>
In reply to#40882
On 10/27/21 9:51 AM, olcott wrote:
> On 10/27/2021 8:12 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 10/26/2021 6:47 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>
>>>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.
>>>>
>>>>> Are you willing to admit that if it is shown that H correctly decides
>>>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
>>>>> to dishonestly dodge this key point?
>>>>
>>>> I keep trying not to dodge it but you keep ignoring my answer.  No 
>>>> proof
>>>> is invalided by other truths.  You might render all of mathematics
>>>> inconsistent, but previously valid chains of reasoning remains valid.
>>>>
>>>> You made it plain that don't accept what a proof is when you stated 
>>>> that
>>>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
>>>> retracted this incorrect statement.
>>>>
>>>> As it happens, you can't show that Linz's H is correct about the input
>>>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to 
>>>> note
>>>> my answer to this hypothetical question for years, but you keep
>>>> pretending not to notice.
>>>
>>> I ask you a YES / NO question and you dodge.
>>
>> How could you miss the answer yet again?  Clearly it's no: I don't
>> accept that if it is shown that H correctly decides the halt status of
>> ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted. 
> 
> So you reject the idea of a semantic tautology.
> If X says Y is true and I prove that Y is false then X could still be 
> correct. No wonder we are having trouble communicating, you are simply 
> irrational.
> 

Perhaps in smaller words so you can understand.

IF we have one proof that says X.

And we then come up with another proof that says Not X.

That second proof does NOT 'disprove' the first proof.

What it does is point out that either there is a flaw in ONE of the 
proofs, or the logical system is invalid.

Linz's proof does rigerously show that by the logic, there exists no H 
that that can correctly predict that halting status of all possible 
inputs by showing an input that he logically proves can such an h can 
not answer.

Even if you show an H that you claim solves that input, that in no way 
'disproves' Linz proof. All it shows is that one of the two proofs, 
either Linz's or yours has a logical flaw, or that the logic system used 
is flawed as it has gone inconsistent.

You do NOT disprove a proof by showing a counter example. You can 
disprove an UNPROVEN theorem or supposition by showing a counter 
example, but this does NOT apply to a proven statement.

To disprove a proof, you have to point out an actual logical flaw in the 
proof, that is show that some logical operation performed is not a valid 
logical operation or that some input proposition taken as true is incorrect.

You have not done this, so you can NOT have 'disproven Linz'. At best 
you have shown the logic system to be inconsistent, but in truth, the 
errors in your proof have been pointed out, so all you have really 
proven is that you don't know how to make a proper logical proof.


>>  How was "no proof is invalided by
>> other truths" not clearly a "no"?  I had no idea you would need it
>> spelled out.
>>
>> Anyway, I've spelled it out now: no.  If you want to see why you are
>> wrong to think the answer might be yes, the explanation is all there.
>>
> 
> 

[toc] | [prev] | [next] | [standalone]


#40903 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromMalcolm McLean <malcolm.arthur.mclean@gmail.com>
Date2021-10-28 06:52 -0700
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<6ab23da9-6b13-40a2-80a9-478cdc70dab4n@googlegroups.com>
In reply to#40891
On Thursday, 28 October 2021 at 00:34:50 UTC+1, richar...@gmail.com wrote:
> On 10/27/21 9:51 AM, olcott wrote: 
> > On 10/27/2021 8:12 AM, Ben Bacarisse wrote: 
> >> olcott <No...@NoWhere.com> writes: 
> >> 
> >>> On 10/26/2021 6:47 PM, Ben Bacarisse wrote: 
> >>>> olcott <No...@NoWhere.com> writes: 
> >> 
> >>>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly. 
> >>>> 
> >>>>> Are you willing to admit that if it is shown that H correctly decides 
> >>>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going 
> >>>>> to dishonestly dodge this key point? 
> >>>> 
> >>>> I keep trying not to dodge it but you keep ignoring my answer.  No 
> >>>> proof 
> >>>> is invalided by other truths.  You might render all of mathematics 
> >>>> inconsistent, but previously valid chains of reasoning remains valid. 
> >>>> 
> >>>> You made it plain that don't accept what a proof is when you stated 
> >>>> that 
> >>>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never 
> >>>> retracted this incorrect statement. 
> >>>> 
> >>>> As it happens, you can't show that Linz's H is correct about the input 
> >>>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to 
> >>>> note 
> >>>> my answer to this hypothetical question for years, but you keep 
> >>>> pretending not to notice. 
> >>> 
> >>> I ask you a YES / NO question and you dodge. 
> >> 
> >> How could you miss the answer yet again?  Clearly it's no: I don't 
> >> accept that if it is shown that H correctly decides the halt status of 
> >> ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted. 
> > 
> > So you reject the idea of a semantic tautology. 
> > If X says Y is true and I prove that Y is false then X could still be 
> > correct. No wonder we are having trouble communicating, you are simply 
> > irrational. 
> >
> Perhaps in smaller words so you can understand. 
> 
> IF we have one proof that says X. 
> 
> And we then come up with another proof that says Not X. 
> 
> That second proof does NOT 'disprove' the first proof. 
> 
> What it does is point out that either there is a flaw in ONE of the 
> proofs, or the logical system is invalid. 
> 
I remember one question from my Oxford entrance examination:

"The language of poetry is the language of the everyday".
"The language of the everyday is never the language of poetry".

Both statements are true, of course.

[toc] | [prev] | [next] | [standalone]


#40915 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

Fromolcott <NoOne@NoWhere.com>
Date2021-10-28 14:13 -0500
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<wu-dnSiZjqTfa-f8nZ2dnUU7-Q-dnZ2d@giganews.com>
In reply to#40903
On 10/28/2021 8:52 AM, Malcolm McLean wrote:
> On Thursday, 28 October 2021 at 00:34:50 UTC+1, richar...@gmail.com wrote:
>> On 10/27/21 9:51 AM, olcott wrote:
>>> On 10/27/2021 8:12 AM, Ben Bacarisse wrote:
>>>> olcott <No...@NoWhere.com> writes:
>>>>
>>>>> On 10/26/2021 6:47 PM, Ben Bacarisse wrote:
>>>>>> olcott <No...@NoWhere.com> writes:
>>>>
>>>>>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.
>>>>>>
>>>>>>> Are you willing to admit that if it is shown that H correctly decides
>>>>>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you going
>>>>>>> to dishonestly dodge this key point?
>>>>>>
>>>>>> I keep trying not to dodge it but you keep ignoring my answer.  No
>>>>>> proof
>>>>>> is invalided by other truths.  You might render all of mathematics
>>>>>> inconsistent, but previously valid chains of reasoning remains valid.
>>>>>>
>>>>>> You made it plain that don't accept what a proof is when you stated
>>>>>> that
>>>>>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
>>>>>> retracted this incorrect statement.
>>>>>>
>>>>>> As it happens, you can't show that Linz's H is correct about the input
>>>>>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to
>>>>>> note
>>>>>> my answer to this hypothetical question for years, but you keep
>>>>>> pretending not to notice.
>>>>>
>>>>> I ask you a YES / NO question and you dodge.
>>>>
>>>> How could you miss the answer yet again?  Clearly it's no: I don't
>>>> accept that if it is shown that H correctly decides the halt status of
>>>> ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted.
>>>
>>> So you reject the idea of a semantic tautology.
>>> If X says Y is true and I prove that Y is false then X could still be
>>> correct. No wonder we are having trouble communicating, you are simply
>>> irrational.
>>>
>> Perhaps in smaller words so you can understand.
>>
>> IF we have one proof that says X.
>>
>> And we then come up with another proof that says Not X.
>>
>> That second proof does NOT 'disprove' the first proof.
>>
>> What it does is point out that either there is a flaw in ONE of the
>> proofs, or the logical system is invalid.
>>
> I remember one question from my Oxford entrance examination:
> 
> "The language of poetry is the language of the everyday".
> "The language of the everyday is never the language of poetry".
> 
> Both statements are true, of course.
> 

These are the simple words that Ben cannot understand:
If Linz says that H cannot correctly decide the halt
status of ⟨Ĥ⟩ ⟨Ĥ⟩ and I show exactly how H correctly decides
the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ then I have proved Linz wrong.

https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
Since that time I did find the exact mistake that Linz made on the top 
of page 320.

Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
Linz incorrectly believes that Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ is deciding the halt status 
of itself rather than the halt status of its input.

The thing that leads to his confusion is that on line 7 of the top of 
page 320 he simply deletes most of the details of Ĥ: q0ŵ ⊢* Ĥqn, he 
skips the point in Ĥ that actually determines the halt decider of its input.


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#40911 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

Fromolcott <NoOne@NoWhere.com>
Date2021-10-28 10:11 -0500
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<K8ednTxMK80IIOf8nZ2dnUU7-VXNnZ2d@giganews.com>
In reply to#40891
On 10/27/2021 6:34 PM, Richard Damon wrote:
> On 10/27/21 9:51 AM, olcott wrote:
>> On 10/27/2021 8:12 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 10/26/2021 6:47 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.
>>>>>
>>>>>> Are you willing to admit that if it is shown that H correctly decides
>>>>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you 
>>>>>> going
>>>>>> to dishonestly dodge this key point?
>>>>>
>>>>> I keep trying not to dodge it but you keep ignoring my answer.  No 
>>>>> proof
>>>>> is invalided by other truths.  You might render all of mathematics
>>>>> inconsistent, but previously valid chains of reasoning remains valid.
>>>>>
>>>>> You made it plain that don't accept what a proof is when you stated 
>>>>> that
>>>>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
>>>>> retracted this incorrect statement.
>>>>>
>>>>> As it happens, you can't show that Linz's H is correct about the input
>>>>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to 
>>>>> note
>>>>> my answer to this hypothetical question for years, but you keep
>>>>> pretending not to notice.
>>>>
>>>> I ask you a YES / NO question and you dodge.
>>>
>>> How could you miss the answer yet again?  Clearly it's no: I don't
>>> accept that if it is shown that H correctly decides the halt status of
>>> ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted. 
>>
>> So you reject the idea of a semantic tautology.
>> If X says Y is true and I prove that Y is false then X could still be 
>> correct. No wonder we are having trouble communicating, you are simply 
>> irrational.
>>
> 
> Perhaps in smaller words so you can understand.
> 
> IF we have one proof that says X.
> 
> And we then come up with another proof that says Not X.
> 
> That second proof does NOT 'disprove' the first proof.
> 
These are the simple words that Ben cannot understand:
If Linz says that H cannot correctly decide the halt
status of ⟨Ĥ⟩ ⟨Ĥ⟩ and I show exactly how H correctly decides
the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ then I have proved Linz wrong.

https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
Since that time I did find the exact mistake that Linz made on the top 
of page 320.

Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
Linz incorrectly believes that Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ is deciding the halt status 
of itself rather than the halt status of its input.

The thing that leads to his confusion is that on line 7 of the top of 
page 320 he simply deletes most of the details of Ĥ: q0ŵ ⊢* Ĥqn, he 
skips the point in Ĥ that actually determines the halt decider of its 
input.


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#40912 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

FromDaniel Pehoushek <pehoushek1@gmail.com>
Date2021-10-28 08:36 -0700
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<abc1a649-437a-4a84-8a77-7f1ed8688e8an@googlegroups.com>
In reply to#40911
On Thursday, October 28, 2021 at 11:11:24 AM UTC-4, olcott wrote:
> On 10/27/2021 6:34 PM, Richard Damon wrote: 
> > On 10/27/21 9:51 AM, olcott wrote: 
> >> On 10/27/2021 8:12 AM, Ben Bacarisse wrote: 
> >>> olcott <No...@NoWhere.com> writes: 
> >>> 
> >>>> On 10/26/2021 6:47 PM, Ben Bacarisse wrote: 
> >>>>> olcott <No...@NoWhere.com> writes: 
> >>> 
> >>>>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly. 
> >>>>> 
> >>>>>> Are you willing to admit that if it is shown that H correctly decides 
> >>>>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you 
> >>>>>> going 
> >>>>>> to dishonestly dodge this key point? 
> >>>>> 
> >>>>> I keep trying not to dodge it but you keep ignoring my answer.  No 
> >>>>> proof 
> >>>>> is invalided by other truths.  You might render all of mathematics 
> >>>>> inconsistent, but previously valid chains of reasoning remains valid. 
> >>>>> 
> >>>>> You made it plain that don't accept what a proof is when you stated 
> >>>>> that 
> >>>>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never 
> >>>>> retracted this incorrect statement. 
> >>>>> 
> >>>>> As it happens, you can't show that Linz's H is correct about the input 
> >>>>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to 
> >>>>> note 
> >>>>> my answer to this hypothetical question for years, but you keep 
> >>>>> pretending not to notice. 
> >>>> 
> >>>> I ask you a YES / NO question and you dodge. 
> >>> 
> >>> How could you miss the answer yet again?  Clearly it's no: I don't 
> >>> accept that if it is shown that H correctly decides the halt status of 
> >>> ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted. 
> >> 
> >> So you reject the idea of a semantic tautology. 
> >> If X says Y is true and I prove that Y is false then X could still be 
> >> correct. No wonder we are having trouble communicating, you are simply 
> >> irrational. 
> >> 
> > 
> > Perhaps in smaller words so you can understand. 
> > 
> > IF we have one proof that says X. 
> > 
> > And we then come up with another proof that says Not X. 
> > 
> > That second proof does NOT 'disprove' the first proof. 
> >
> These are the simple words that Ben cannot understand: 
> If Linz says that H cannot correctly decide the halt 
> status of ⟨Ĥ⟩ ⟨Ĥ⟩ and I show exactly how H correctly decides 
> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ then I have proved Linz wrong. 
> 
> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf 
> Since that time I did find the exact mistake that Linz made on the top 
> of page 320.
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
> Linz incorrectly believes that Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ is deciding the halt status 
> of itself rather than the halt status of its input. 
> 
> The thing that leads to his confusion is that on line 7 of the top of 
> page 320 he simply deletes most of the details of Ĥ: q0ŵ ⊢* Ĥqn, he 
> skips the point in Ĥ that actually determines the halt decider of its 
> input.
> -- 
> Copyright 2021 Pete Olcott 
> 
> "Great spirits have always encountered violent opposition from mediocre 
> minds." Einstein

+ If Linz says that 
+ H cannot correctly 
+ decide the halt

i am totally confused at this point in the parse.
daniel 2380 seven sigma claim again but 
i have terrible troubles with negation.

[toc] | [prev] | [next] | [standalone]


#40914 — Re: Scientific reasoning [ if H is correct then it is not incorrect ]

Fromolcott <NoOne@NoWhere.com>
Date2021-10-28 11:26 -0500
SubjectRe: Scientific reasoning [ if H is correct then it is not incorrect ]
Message-ID<7NadnZKsxoy8Uuf8nZ2dnUU7-VfNnZ2d@giganews.com>
In reply to#40912
On 10/28/2021 10:36 AM, Daniel Pehoushek wrote:
> On Thursday, October 28, 2021 at 11:11:24 AM UTC-4, olcott wrote:
>> On 10/27/2021 6:34 PM, Richard Damon wrote:
>>> On 10/27/21 9:51 AM, olcott wrote:
>>>> On 10/27/2021 8:12 AM, Ben Bacarisse wrote:
>>>>> olcott <No...@NoWhere.com> writes:
>>>>>
>>>>>> On 10/26/2021 6:47 PM, Ben Bacarisse wrote:
>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>
>>>>>>> All you do is assert that H decides ⟨Ĥ⟩ ⟨Ĥ⟩ correctly.
>>>>>>>
>>>>>>>> Are you willing to admit that if it is shown that H correctly decides
>>>>>>>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted or are you
>>>>>>>> going
>>>>>>>> to dishonestly dodge this key point?
>>>>>>>
>>>>>>> I keep trying not to dodge it but you keep ignoring my answer.  No
>>>>>>> proof
>>>>>>> is invalided by other truths.  You might render all of mathematics
>>>>>>> inconsistent, but previously valid chains of reasoning remains valid.
>>>>>>>
>>>>>>> You made it plain that don't accept what a proof is when you stated
>>>>>>> that
>>>>>>> if A,B,C ⊦ X, then ~A,A,B,C ⊬ X.  As far as I know you have never
>>>>>>> retracted this incorrect statement.
>>>>>>>
>>>>>>> As it happens, you can't show that Linz's H is correct about the input
>>>>>>> ⟨Ĥ⟩ ⟨Ĥ⟩, so the point is moot, but I have been trying to get you to
>>>>>>> note
>>>>>>> my answer to this hypothetical question for years, but you keep
>>>>>>> pretending not to notice.
>>>>>>
>>>>>> I ask you a YES / NO question and you dodge.
>>>>>
>>>>> How could you miss the answer yet again?  Clearly it's no: I don't
>>>>> accept that if it is shown that H correctly decides the halt status of
>>>>> ⟨Ĥ⟩ ⟨Ĥ⟩ that Linz has been refuted.
>>>>
>>>> So you reject the idea of a semantic tautology.
>>>> If X says Y is true and I prove that Y is false then X could still be
>>>> correct. No wonder we are having trouble communicating, you are simply
>>>> irrational.
>>>>
>>>
>>> Perhaps in smaller words so you can understand.
>>>
>>> IF we have one proof that says X.
>>>
>>> And we then come up with another proof that says Not X.
>>>
>>> That second proof does NOT 'disprove' the first proof.
>>>
>> These are the simple words that Ben cannot understand:
>> If Linz says that H cannot correctly decide the halt
>> status of ⟨Ĥ⟩ ⟨Ĥ⟩ and I show exactly how H correctly decides
>> the halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ then I have proved Linz wrong.
>>
>> https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>> Since that time I did find the exact mistake that Linz made on the top
>> of page 320.
>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>> Linz incorrectly believes that Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ is deciding the halt status
>> of itself rather than the halt status of its input.
>>
>> The thing that leads to his confusion is that on line 7 of the top of
>> page 320 he simply deletes most of the details of Ĥ: q0ŵ ⊢* Ĥqn, he
>> skips the point in Ĥ that actually determines the halt decider of its
>> input.
>> -- 
>> Copyright 2021 Pete Olcott
>>
>> "Great spirits have always encountered violent opposition from mediocre
>> minds." Einstein
> 
> + If Linz says that
> + H cannot correctly
> + decide the halt
> 
> i am totally confused at this point in the parse.
> daniel 2380 seven sigma claim again but
> i have terrible troubles with negation.
> 

Linz says that Turing Machine H cannot possibly correctly decide the 
actual halt status of Turing machine description ⟨Ĥ⟩ applied to ⟨Ĥ⟩.

As soon as I show all of the details of exactly how H correctly decides 
the actual halt status of ⟨Ĥ⟩ ⟨Ĥ⟩ I have proved Linz wrong.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


Page 3 of 5 — ← Prev page 1 2 [3] 4 5  Next page →

Back to top | Article view | comp.theory


csiph-web