Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #39982 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-09-27 14:34 -0500 |
| Last post | 2021-09-30 14:54 -0500 |
| Articles | 19 on this page of 39 — 5 participants |
Back to article view | Back to comp.theory
The key basis of my refutation of the halting theorem olcott <NoOne@NoWhere.com> - 2021-09-27 14:34 -0500
Re: The key basis of my refutation of the halting theorem "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-09-27 13:41 -0700
Re: The key basis of my refutation of the halting theorem olcott <NoOne@NoWhere.com> - 2021-09-27 15:47 -0500
Re: The key basis of my refutation of the halting theorem Richard Damon <Richard@Damon-Family.org> - 2021-09-27 20:31 -0400
Re: The key basis of my refutation of the halting theorem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-27 22:03 +0100
Re: The key basis of my refutation of the halting theorem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-27 21:52 +0100
Re: The key basis of my refutation of the halting theorem olcott <NoOne@NoWhere.com> - 2021-09-27 16:38 -0500
Re: The key basis of my refutation of the halting theorem Richard Damon <Richard@Damon-Family.org> - 2021-09-27 20:46 -0400
Re: The key basis of my refutation of the halting theorem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-28 02:52 +0100
Re: The key basis of my refutation of the halting theorem olcott <NoOne@NoWhere.com> - 2021-09-27 21:11 -0500
Re: The key basis of my refutation of the halting theorem Richard Damon <Richard@Damon-Family.org> - 2021-09-27 22:57 -0400
Re: The key basis of my refutation of the halting theorem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-28 16:13 +0100
Re: The key basis of my refutation of the halting theorem olcott <NoOne@NoWhere.com> - 2021-09-28 10:26 -0500
Re: The key basis of my refutation of the halting theorem Richard Damon <Richard@Damon-Family.org> - 2021-09-28 19:14 -0400
Re: The key basis of my refutation of the halting theorem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-29 02:15 +0100
Re: The key basis of my refutation of the halting theorem olcott <NoOne@NoWhere.com> - 2021-09-28 20:24 -0500
Re: The key basis of my refutation of the halting theorem Richard Damon <Richard@Damon-Family.org> - 2021-09-28 22:13 -0400
Re: The key basis of my refutation of the halting theorem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-30 00:24 +0100
Re: The key basis of my refutation of the halting theorem olcott <NoOne@NoWhere.com> - 2021-09-29 19:06 -0500
Re: The key basis of my refutation of the halting theorem Richard Damon <Richard@Damon-Family.org> - 2021-09-29 20:26 -0400
Re: The key basis of my refutation of the halting theorem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-30 02:37 +0100
Re: The key basis of my refutation of the halting theorem [ difficult ] olcott <NoOne@NoWhere.com> - 2021-09-29 20:45 -0500
Re: The key basis of my refutation of the halting theorem [ difficult ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-30 03:04 +0100
Re: The key basis of my refutation of the halting theorem [ difficult ] olcott <NoOne@NoWhere.com> - 2021-09-29 21:15 -0500
Re: The key basis of my refutation of the halting theorem [ difficult ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-30 03:44 +0100
Re: The key basis of my refutation of the halting theorem [ difficult ] olcott <NoOne@NoWhere.com> - 2021-09-29 21:50 -0500
Re: The key basis of my refutation of the halting theorem [ difficult ] Richard Damon <news.x.richarddamon@xoxy.net> - 2021-09-30 06:13 -0400
Re: The key basis of my refutation of the halting theorem [ difficult ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-01 00:31 +0100
Re: The key basis of my refutation of the halting theorem [ difficult ] olcott <NoOne@NoWhere.com> - 2021-09-30 19:00 -0500
Re: The key basis of my refutation of the halting theorem [ difficult ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-10-01 02:53 +0100
Re: The key basis of my refutation of the halting theorem [ difficult ] olcott <NoOne@NoWhere.com> - 2021-09-30 21:11 -0500
Re: The key basis of my refutation of the halting theorem [ difficult ] Richard Damon <Richard@Damon-Family.org> - 2021-09-30 21:55 -0400
Re: The key basis of my refutation of the halting theorem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-30 02:38 +0100
Re: The key basis of my refutation of the halting theorem [ better wording ] olcott <NoOne@NoWhere.com> - 2021-09-28 20:31 -0500
Re: The key basis of my refutation of the halting theorem [ better wording ] Richard Damon <Richard@Damon-Family.org> - 2021-09-28 22:17 -0400
Re: The key basis of my refutation of the halting theorem olcott <NoOne@NoWhere.com> - 2021-09-29 13:36 -0500
Re: The key basis of my refutation of the halting theorem Richard Damon <Richard@Damon-Family.org> - 2021-09-29 19:12 -0400
Re: The key basis of my refutation of the halting theorem Richard Damon <Richard@Damon-Family.org> - 2021-09-27 20:24 -0400
Re: The key basis of my refutation of the halting theorem olcott <NoOne@NoWhere.com> - 2021-09-30 14:54 -0500
Page 2 of 2 — ← Prev page 1 [2]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-30 02:37 +0100 |
| Message-ID | <87zgrun8ry.fsf@bsb.me.uk> |
| In reply to | #40089 |
olcott <NoOne@NoWhere.com> writes: > ---1----2-----3-----4--5-----6 >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and >>> >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt > > The Linz proof is not about (1) applied to (2). Of course it is. The proof absolutely centres around Ĥ(⟨Ĥ⟩). Only while you continue to lie about Ĥ(⟨Ĥ⟩) can you continue to pretend you don't get the proof: Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ if Ĥ applied to ⟨Ĥ⟩ halts and that Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn if Ĥ applied to ⟨Ĥ⟩ does not halt. > It is about (3) applied to (4) and (5). It's all part of the same argument. The annotations you dishonestly remove come from what Linz asserts about H(<M>, w) which informs what (3) applied to (4) and (5) do. > (4) never halts on (5) Silly. (4) is a string. And whose halting are you talking about? The real halting as understood by everyone but you, or your pointless redefined "halting" that no one cares about? Since strings are now "halting" it must be your POOH problem. > whether or not (3) aborts its simulation, therefore (3) correctly > transitions to Ĥ.qn. TMs don't abort. And Linz does not limit his proof like this. Linz's proof is not about anything that aborts, nor is it limited to things that simulate. Once you say things like this it's clear you are no longer talking about Linz's H/Ĥ pair. You are talking about your POOH problem: This definition of halting circumvents the pathological self-reference error for every simulating halt decider: An input is decided to be halting only if its simulation never needs to be stopped by any simulating halt decider anywhere in its entire invocation chain. On that basis: Ĥ(<Ĥ>) ⊢* Ĥ.qn H(<Ĥ>,<Ĥ>) ⊢* H.qn where H rejects halting computations as shown right there. At least you are not shy about admitting you're not talking about halting. Shame you dishonestly keep calling it halting. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-29 20:45 -0500 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <Ar2dndiUksNYi8j8nZ2dnUU7-anNnZ2d@giganews.com> |
| In reply to | #40095 |
On 9/29/2021 8:37 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> ---1----2-----3-----4--5-----6 >>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and >>>> >>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >> >> The Linz proof is not about (1) applied to (2). > > Of course it is. The proof absolutely centres around Ĥ(⟨Ĥ⟩). Only > while you continue to lie about Ĥ(⟨Ĥ⟩) can you continue to pretend you > don't get the proof: > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ > if Ĥ applied to ⟨Ĥ⟩ halts > > and that > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > if Ĥ applied to ⟨Ĥ⟩ does not halt. > >> It is about (3) applied to (4) and (5). > > It's all part of the same argument. The annotations you dishonestly > remove come from what Linz asserts about H(<M>, w) which informs what > (3) applied to (4) and (5) do. > >> (4) never halts on (5) > > Silly. (4) is a string. And whose halting are you talking about? The > real halting as understood by everyone but you, or your pointless > redefined "halting" that no one cares about? Since strings are now > "halting" it must be your POOH problem. > >> whether or not (3) aborts its simulation, therefore (3) correctly >> transitions to Ĥ.qn. > > TMs don't abort. And Linz does not limit his proof like this. Linz's > proof is not about anything that aborts, nor is it limited to things > that simulate. > > Once you say things like this it's clear you are no longer talking about > Linz's H/Ĥ pair. You are talking about your POOH problem: > > This definition of halting circumvents the pathological self-reference > error for every simulating halt decider: > > An input is decided to be halting only if its simulation never needs > to be stopped by any simulating halt decider anywhere in its entire > invocation chain. > > On that basis: > Ĥ(<Ĥ>) ⊢* Ĥ.qn > H(<Ĥ>,<Ĥ>) ⊢* H.qn > > where H rejects halting computations as shown right there. At least you > are not shy about admitting you're not talking about halting. Shame you > dishonestly keep calling it halting. > 1----2-----3-----4--5-----6 Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn If is very difficult to understand that Ĥ applied to ⟨Ĥ⟩ (1) applied to (2) is an entirely different computation than Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ (3) simulating (4) applied to (5). -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-30 03:04 +0100 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <87fstmn7i0.fsf@bsb.me.uk> |
| In reply to | #40099 |
olcott <NoOne@NoWhere.com> writes:
> On 9/29/2021 8:37 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> ---1----2-----3-----4--5-----6
>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and
>>>>>
>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt
>>>
>>> The Linz proof is not about (1) applied to (2).
>> Of course it is. The proof absolutely centres around Ĥ(⟨Ĥ⟩). Only
>> while you continue to lie about Ĥ(⟨Ĥ⟩) can you continue to pretend you
>> don't get the proof:
>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
>> if Ĥ applied to ⟨Ĥ⟩ halts
>> and that
>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>> if Ĥ applied to ⟨Ĥ⟩ does not halt.
>>
>>> It is about (3) applied to (4) and (5).
>> It's all part of the same argument. The annotations you dishonestly
>> remove come from what Linz asserts about H(<M>, w) which informs what
>> (3) applied to (4) and (5) do.
>>
>>> (4) never halts on (5)
>> Silly. (4) is a string. And whose halting are you talking about? The
>> real halting as understood by everyone but you, or your pointless
>> redefined "halting" that no one cares about? Since strings are now
>> "halting" it must be your POOH problem.
>>
>>> whether or not (3) aborts its simulation, therefore (3) correctly
>>> transitions to Ĥ.qn.
>> TMs don't abort. And Linz does not limit his proof like this. Linz's
>> proof is not about anything that aborts, nor is it limited to things
>> that simulate.
>> Once you say things like this it's clear you are no longer talking about
>> Linz's H/Ĥ pair. You are talking about your POOH problem:
>> This definition of halting circumvents the pathological self-reference
>> error for every simulating halt decider:
>> An input is decided to be halting only if its simulation never needs
>> to be stopped by any simulating halt decider anywhere in its entire
>> invocation chain.
>> On that basis:
>> Ĥ(<Ĥ>) ⊢* Ĥ.qn
>> H(<Ĥ>,<Ĥ>) ⊢* H.qn
>> where H rejects halting computations as shown right there. At least you
>> are not shy about admitting you're not talking about halting. Shame you
>> dishonestly keep calling it halting.
>
> 1----2-----3-----4--5-----6
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>
> If is very difficult to understand that Ĥ applied to ⟨Ĥ⟩
> (1) applied to (2)
>
> is an entirely different computation than Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩
> (3) simulating (4) applied to (5).
It's utterly trivial. Of course they are different. You often do this.
I've explained why your whole project is junk, and your only reply is to
assert something silly and utterly trivial. (OK, sometime you assert
something wrong in an attempt to draw fire, but not in this case.)
The problem is you're not talking about the hating problem. You are
talking about your POOH problem as you defined it so clearly in 2017.
Linz's H/Ĥ don't behave as your H/Ĥ do:
Ĥ(<Ĥ>) ⊢* Ĥ.qn
H(<Ĥ>,<Ĥ>) ⊢* H.qn
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-29 21:15 -0500 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <f--dnWuFhKxRgMj8nZ2dnUU7-W3NnZ2d@giganews.com> |
| In reply to | #40104 |
On 9/29/2021 9:04 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/29/2021 8:37 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> ---1----2-----3-----4--5-----6 >>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and >>>>>> >>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >>>> >>>> The Linz proof is not about (1) applied to (2). >>> Of course it is. The proof absolutely centres around Ĥ(⟨Ĥ⟩). Only >>> while you continue to lie about Ĥ(⟨Ĥ⟩) can you continue to pretend you >>> don't get the proof: >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>> if Ĥ applied to ⟨Ĥ⟩ halts >>> and that >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>> if Ĥ applied to ⟨Ĥ⟩ does not halt. >>> >>>> It is about (3) applied to (4) and (5). >>> It's all part of the same argument. The annotations you dishonestly >>> remove come from what Linz asserts about H(<M>, w) which informs what >>> (3) applied to (4) and (5) do. >>> >>>> (4) never halts on (5) >>> Silly. (4) is a string. And whose halting are you talking about? The >>> real halting as understood by everyone but you, or your pointless >>> redefined "halting" that no one cares about? Since strings are now >>> "halting" it must be your POOH problem. >>> >>>> whether or not (3) aborts its simulation, therefore (3) correctly >>>> transitions to Ĥ.qn. >>> TMs don't abort. And Linz does not limit his proof like this. Linz's >>> proof is not about anything that aborts, nor is it limited to things >>> that simulate. >>> Once you say things like this it's clear you are no longer talking about >>> Linz's H/Ĥ pair. You are talking about your POOH problem: >>> This definition of halting circumvents the pathological self-reference >>> error for every simulating halt decider: >>> An input is decided to be halting only if its simulation never needs >>> to be stopped by any simulating halt decider anywhere in its entire >>> invocation chain. >>> On that basis: >>> Ĥ(<Ĥ>) ⊢* Ĥ.qn >>> H(<Ĥ>,<Ĥ>) ⊢* H.qn >>> where H rejects halting computations as shown right there. At least you >>> are not shy about admitting you're not talking about halting. Shame you >>> dishonestly keep calling it halting. >> >> 1----2-----3-----4--5-----6 >> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >> >> If is very difficult to understand that Ĥ applied to ⟨Ĥ⟩ >> (1) applied to (2) >> >> is an entirely different computation than Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ >> (3) simulating (4) applied to (5). > > It's utterly trivial. Of course they are different. You often do this. > I've explained why your whole project is junk, and your only reply is to > assert something silly and utterly trivial. (OK, sometime you assert > something wrong in an attempt to draw fire, but not in this case.) > > The problem is you're not talking about the hating problem. You are > talking about your POOH problem as you defined it so clearly in 2017. > Linz's H/Ĥ don't behave as your H/Ĥ do: > > Ĥ(<Ĥ>) ⊢* Ĥ.qn > H(<Ĥ>,<Ĥ>) ⊢* H.qn > Ĥ(<Ĥ>) ⊢* Ĥ.qn AND H(<Ĥ>,<Ĥ>) ⊢* H.qy Is too difficult for you to understand because it is very very difficult to understand. We only get these weird kind of results when we have what is essentially (for all practical purposes) a self-contradictory input. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-30 03:44 +0100 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <87v92ilr3j.fsf@bsb.me.uk> |
| In reply to | #40107 |
olcott <NoOne@NoWhere.com> writes: > On 9/29/2021 9:04 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/29/2021 8:37 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> ---1----2-----3-----4--5-----6 >>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and >>>>>>> >>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >>>>> >>>>> The Linz proof is not about (1) applied to (2). >>>> Of course it is. The proof absolutely centres around Ĥ(⟨Ĥ⟩). Only >>>> while you continue to lie about Ĥ(⟨Ĥ⟩) can you continue to pretend you >>>> don't get the proof: >>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>> if Ĥ applied to ⟨Ĥ⟩ halts >>>> and that >>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>> if Ĥ applied to ⟨Ĥ⟩ does not halt. >>>> >>>>> It is about (3) applied to (4) and (5). >>>> It's all part of the same argument. The annotations you dishonestly >>>> remove come from what Linz asserts about H(<M>, w) which informs what >>>> (3) applied to (4) and (5) do. >>>> >>>>> (4) never halts on (5) >>>> Silly. (4) is a string. And whose halting are you talking about? The >>>> real halting as understood by everyone but you, or your pointless >>>> redefined "halting" that no one cares about? Since strings are now >>>> "halting" it must be your POOH problem. >>>> >>>>> whether or not (3) aborts its simulation, therefore (3) correctly >>>>> transitions to Ĥ.qn. >>>> TMs don't abort. And Linz does not limit his proof like this. Linz's >>>> proof is not about anything that aborts, nor is it limited to things >>>> that simulate. >>>> Once you say things like this it's clear you are no longer talking about >>>> Linz's H/Ĥ pair. You are talking about your POOH problem: >>>> This definition of halting circumvents the pathological self-reference >>>> error for every simulating halt decider: >>>> An input is decided to be halting only if its simulation never needs >>>> to be stopped by any simulating halt decider anywhere in its entire >>>> invocation chain. >>>> On that basis: >>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn >>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn >>>> where H rejects halting computations as shown right there. At least you >>>> are not shy about admitting you're not talking about halting. Shame you >>>> dishonestly keep calling it halting. >>> >>> 1----2-----3-----4--5-----6 >>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>> >>> If is very difficult to understand that Ĥ applied to ⟨Ĥ⟩ >>> (1) applied to (2) >>> >>> is an entirely different computation than Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ >>> (3) simulating (4) applied to (5). >> It's utterly trivial. Of course they are different. You often do this. >> I've explained why your whole project is junk, and your only reply is to >> assert something silly and utterly trivial. (OK, sometime you assert >> something wrong in an attempt to draw fire, but not in this case.) >> The problem is you're not talking about the hating problem. You are >> talking about your POOH problem as you defined it so clearly in 2017. >> Linz's H/Ĥ don't behave as your H/Ĥ do: >> Ĥ(<Ĥ>) ⊢* Ĥ.qn >> H(<Ĥ>,<Ĥ>) ⊢* H.qn > > Ĥ(<Ĥ>) ⊢* Ĥ.qn AND H(<Ĥ>,<Ĥ>) ⊢* H.qy Either H(<Ĥ>,<Ĥ>) ⊢* H.qn as you said before, or H(<Ĥ>,<Ĥ>) ⊢* H.qy as you say now. It can't be both. > Is too difficult for you to understand because it is very very > difficult to understand. We only get these weird kind of results when > we have what is essentially (for all practical purposes) a > self-contradictory input. You get these weird kind of results when someone doesn't know what a TM is! Either H(<Ĥ>,<Ĥ>) ⊢* H.qn or H(<Ĥ>,<Ĥ>) ⊢* H.qy and now no one (not even you) knows which! -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-29 21:50 -0500 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <UKWdnShSLp6Uu8j8nZ2dnUU7-LmdnZ2d@giganews.com> |
| In reply to | #40109 |
On 9/29/2021 9:44 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/29/2021 9:04 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/29/2021 8:37 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> ---1----2-----3-----4--5-----6 >>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and >>>>>>>> >>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >>>>>> >>>>>> The Linz proof is not about (1) applied to (2). >>>>> Of course it is. The proof absolutely centres around Ĥ(⟨Ĥ⟩). Only >>>>> while you continue to lie about Ĥ(⟨Ĥ⟩) can you continue to pretend you >>>>> don't get the proof: >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>>> if Ĥ applied to ⟨Ĥ⟩ halts >>>>> and that >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>> if Ĥ applied to ⟨Ĥ⟩ does not halt. >>>>> >>>>>> It is about (3) applied to (4) and (5). >>>>> It's all part of the same argument. The annotations you dishonestly >>>>> remove come from what Linz asserts about H(<M>, w) which informs what >>>>> (3) applied to (4) and (5) do. >>>>> >>>>>> (4) never halts on (5) >>>>> Silly. (4) is a string. And whose halting are you talking about? The >>>>> real halting as understood by everyone but you, or your pointless >>>>> redefined "halting" that no one cares about? Since strings are now >>>>> "halting" it must be your POOH problem. >>>>> >>>>>> whether or not (3) aborts its simulation, therefore (3) correctly >>>>>> transitions to Ĥ.qn. >>>>> TMs don't abort. And Linz does not limit his proof like this. Linz's >>>>> proof is not about anything that aborts, nor is it limited to things >>>>> that simulate. >>>>> Once you say things like this it's clear you are no longer talking about >>>>> Linz's H/Ĥ pair. You are talking about your POOH problem: >>>>> This definition of halting circumvents the pathological self-reference >>>>> error for every simulating halt decider: >>>>> An input is decided to be halting only if its simulation never needs >>>>> to be stopped by any simulating halt decider anywhere in its entire >>>>> invocation chain. >>>>> On that basis: >>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn >>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn >>>>> where H rejects halting computations as shown right there. At least you >>>>> are not shy about admitting you're not talking about halting. Shame you >>>>> dishonestly keep calling it halting. >>>> >>>> 1----2-----3-----4--5-----6 >>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>> >>>> If is very difficult to understand that Ĥ applied to ⟨Ĥ⟩ >>>> (1) applied to (2) >>>> >>>> is an entirely different computation than Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ >>>> (3) simulating (4) applied to (5). >>> It's utterly trivial. Of course they are different. You often do this. >>> I've explained why your whole project is junk, and your only reply is to >>> assert something silly and utterly trivial. (OK, sometime you assert >>> something wrong in an attempt to draw fire, but not in this case.) >>> The problem is you're not talking about the hating problem. You are >>> talking about your POOH problem as you defined it so clearly in 2017. >>> Linz's H/Ĥ don't behave as your H/Ĥ do: >>> Ĥ(<Ĥ>) ⊢* Ĥ.qn >>> H(<Ĥ>,<Ĥ>) ⊢* H.qn >> >> Ĥ(<Ĥ>) ⊢* Ĥ.qn AND H(<Ĥ>,<Ĥ>) ⊢* H.qy > The above two are correct. > Either H(<Ĥ>,<Ĥ>) ⊢* H.qn as you said before, or H(<Ĥ>,<Ĥ>) ⊢* H.qy as > you say now. It can't be both. > >> Is too difficult for you to understand because it is very very >> difficult to understand. We only get these weird kind of results when >> we have what is essentially (for all practical purposes) a >> self-contradictory input. > > You get these weird kind of results when someone doesn't know what a TM > is! Either H(<Ĥ>,<Ĥ>) ⊢* H.qn or H(<Ĥ>,<Ĥ>) ⊢* H.qy and now no one (not > even you) knows which! > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <news.x.richarddamon@xoxy.net> |
|---|---|
| Date | 2021-09-30 06:13 -0400 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <sj42jn$80g$1@dont-email.me> |
| In reply to | #40110 |
On 9/29/21 10:50 PM, olcott wrote: > On 9/29/2021 9:44 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/29/2021 9:04 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 9/29/2021 8:37 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> ---1----2-----3-----4--5-----6 >>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and >>>>>>>>> >>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt >>>>>>> >>>>>>> The Linz proof is not about (1) applied to (2). >>>>>> Of course it is. The proof absolutely centres around Ĥ(⟨Ĥ⟩). Only >>>>>> while you continue to lie about Ĥ(⟨Ĥ⟩) can you continue to pretend >>>>>> you >>>>>> don't get the proof: >>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>>>> if Ĥ applied to ⟨Ĥ⟩ halts >>>>>> and that >>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>>> if Ĥ applied to ⟨Ĥ⟩ does not halt. >>>>>> >>>>>>> It is about (3) applied to (4) and (5). >>>>>> It's all part of the same argument. The annotations you dishonestly >>>>>> remove come from what Linz asserts about H(<M>, w) which informs what >>>>>> (3) applied to (4) and (5) do. >>>>>> >>>>>>> (4) never halts on (5) >>>>>> Silly. (4) is a string. And whose halting are you talking >>>>>> about? The >>>>>> real halting as understood by everyone but you, or your pointless >>>>>> redefined "halting" that no one cares about? Since strings are now >>>>>> "halting" it must be your POOH problem. >>>>>> >>>>>>> whether or not (3) aborts its simulation, therefore (3) correctly >>>>>>> transitions to Ĥ.qn. >>>>>> TMs don't abort. And Linz does not limit his proof like this. >>>>>> Linz's >>>>>> proof is not about anything that aborts, nor is it limited to things >>>>>> that simulate. >>>>>> Once you say things like this it's clear you are no longer talking >>>>>> about >>>>>> Linz's H/Ĥ pair. You are talking about your POOH problem: >>>>>> This definition of halting circumvents the pathological >>>>>> self-reference >>>>>> error for every simulating halt decider: >>>>>> An input is decided to be halting only if its simulation >>>>>> never needs >>>>>> to be stopped by any simulating halt decider anywhere in its >>>>>> entire >>>>>> invocation chain. >>>>>> On that basis: >>>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn >>>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn >>>>>> where H rejects halting computations as shown right there. At >>>>>> least you >>>>>> are not shy about admitting you're not talking about halting. >>>>>> Shame you >>>>>> dishonestly keep calling it halting. >>>>> >>>>> 1----2-----3-----4--5-----6 >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>> >>>>> If is very difficult to understand that Ĥ applied to ⟨Ĥ⟩ >>>>> (1) applied to (2) >>>>> >>>>> is an entirely different computation than Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ >>>>> (3) simulating (4) applied to (5). >>>> It's utterly trivial. Of course they are different. You often do >>>> this. >>>> I've explained why your whole project is junk, and your only reply >>>> is to >>>> assert something silly and utterly trivial. (OK, sometime you assert >>>> something wrong in an attempt to draw fire, but not in this case.) >>>> The problem is you're not talking about the hating problem. You are >>>> talking about your POOH problem as you defined it so clearly in 2017. >>>> Linz's H/Ĥ don't behave as your H/Ĥ do: >>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn >>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn >>> >>> Ĥ(<Ĥ>) ⊢* Ĥ.qn AND H(<Ĥ>,<Ĥ>) ⊢* H.qy >> > > The above two are correct. They are inconsistent, as is your whole logic system. The H that H^/P is built on goes to qn, not qy, if some other copy of it goes to qy then you have just PROVED that H is not a Computation, and thus not eligible to be a Decider. FAIL. > >> Either H(<Ĥ>,<Ĥ>) ⊢* H.qn as you said before, or H(<Ĥ>,<Ĥ>) ⊢* H.qy as >> you say now. It can't be both. >> >>> Is too difficult for you to understand because it is very very >>> difficult to understand. We only get these weird kind of results when >>> we have what is essentially (for all practical purposes) a >>> self-contradictory input. >> >> You get these weird kind of results when someone doesn't know what a TM >> is! Either H(<Ĥ>,<Ĥ>) ⊢* H.qn or H(<Ĥ>,<Ĥ>) ⊢* H.qy and now no one (not >> even you) knows which! >> > >
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-01 00:31 +0100 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <87bl49ljyi.fsf@bsb.me.uk> |
| In reply to | #40110 |
olcott <NoOne@NoWhere.com> writes: > On 9/29/2021 9:44 PM, Ben Bacarisse wrote: >>> Ĥ(<Ĥ>) ⊢* Ĥ.qn AND H(<Ĥ>,<Ĥ>) ⊢* H.qy > > The above two are correct. They are wrong for a different reason, but that is hardly the point anymore. Where is the apology for all the times you've stated something you now know to be wrong? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-30 19:00 -0500 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <kKednd5V4Iw70sv8nZ2dnUU7-YWdnZ2d@giganews.com> |
| In reply to | #40137 |
On 9/30/2021 6:31 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/29/2021 9:44 PM, Ben Bacarisse wrote:
>
>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn AND H(<Ĥ>,<Ĥ>) ⊢* H.qy
>>
>> The above two are correct.
>
> They are wrong for a different reason, but that is hardly the point
> anymore. Where is the apology for all the times you've stated
> something you now know to be wrong?
>
You are wrong that they are wrong.
If you want to try to form an actual rebuttal and not just some form of
the strawman error that looks like a rebuttal to gullible fools that are
hardly paying attention you must address the following POINT-BY-POINT.
(A) Ĥ(<Ĥ>) ⊢* Ĥ.qn
(B) Ĥ.qx(<Ĥ>,<Ĥ>) ⊢* H.qn
Your whole basis of rebuttal from the beginning has been that (B) must
be wrong because it disagrees with the actual behavior of (A).
Now that I know that H(<Ĥ>,<Ĥ>) ⊢* H.qy
I have directly contradicted the Linz conclusion.
The contradiction tells us that our assumption
of the existence of H, and hence the assumption
of the decidability of the halting problem, must
be false. (Linz:1990:320)
https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
Linz, Peter 1990. An Introduction to Formal Languages and Automata.
Lexington/Toronto: D. C. Heath and Company. (318-320)
Ĥ.qx(<Ĥ>,<Ĥ>) ⊢* H.qn is correct because the simulation of <Ĥ> applied
to <Ĥ> never reaches any final state whether or not the simulating halt
decider at Ĥ.qx aborts its simulation of this input.
You can dishonestly call this another different halting problem yet you
know damn well it is the original halting problem.
That a computation never reaches its final state when this computation
is allowed to continue unabated is the very conventional definition of
not halting.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-10-01 02:53 +0100 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <87zgrtjysr.fsf@bsb.me.uk> |
| In reply to | #40139 |
olcott <NoOne@NoWhere.com> writes: > On 9/30/2021 6:31 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/29/2021 9:44 PM, Ben Bacarisse wrote: >> >>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn AND H(<Ĥ>,<Ĥ>) ⊢* H.qy >>> >>> The above two are correct. >> They are wrong for a different reason, but that is hardly the point >> anymore. Where is the apology for all the times you've stated >> something you now know to be wrong? > > You are wrong that they are wrong. Only one of us has had to admit to being wrong about the very core of what they have been claiming for years. Your track record is: admittedly wrong for years, now claiming to be correct. See my other reply for why you are still wrong. I'm not going to copy and paste it as you did with the rest of your reply. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-30 21:11 -0500 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <lP6dnYzcvoDf88v8nZ2dnUU7-YnNnZ2d@giganews.com> |
| In reply to | #40150 |
On 9/30/2021 8:53 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 9/30/2021 6:31 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 9/29/2021 9:44 PM, Ben Bacarisse wrote: >>> >>>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn AND H(<Ĥ>,<Ĥ>) ⊢* H.qy >>>> >>>> The above two are correct. >>> They are wrong for a different reason, but that is hardly the point >>> anymore. Where is the apology for all the times you've stated >>> something you now know to be wrong? >> >> You are wrong that they are wrong. > > Only one of us has had to admit to being wrong about the very core of > what they have been claiming for years. Your track record is: > admittedly wrong for years, now claiming to be correct. See my other > reply for why you are still wrong. I'm not going to copy and paste it > as you did with the rest of your reply. > I use categorically exhaustive reasoning to interpolate on the best solution to complex problems. This is similar to Elon Musk's https://jamesclear.com/first-principles As with proper software development there is progressive refinement. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-30 21:55 -0400 |
| Subject | Re: The key basis of my refutation of the halting theorem [ difficult ] |
| Message-ID | <%Tt5J.21186$2e3.10381@fx29.iad> |
| In reply to | #40139 |
On 9/30/21 8:00 PM, olcott wrote: > On 9/30/2021 6:31 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/29/2021 9:44 PM, Ben Bacarisse wrote: >> >>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn AND H(<Ĥ>,<Ĥ>) ⊢* H.qy >>> >>> The above two are correct. >> >> They are wrong for a different reason, but that is hardly the point >> anymore. Where is the apology for all the times you've stated >> something you now know to be wrong? >> > > You are wrong that they are wrong. > > If you want to try to form an actual rebuttal and not just some form of > the strawman error that looks like a rebuttal to gullible fools that are > hardly paying attention you must address the following POINT-BY-POINT. > > (A) Ĥ(<Ĥ>) ⊢* Ĥ.qn > (B) Ĥ.qx(<Ĥ>,<Ĥ>) ⊢* H.qn Whats to rebute. The first says that H^(<H^>) when run as a computaition HALTS, in state H^.qn. THe second says that the copy of H embedded in H^ says that H(<H^>,<H^>) said that H^(<H^>) would not halt, and thus was wrong. > > Your whole basis of rebuttal from the beginning has been that (B) must > be wrong because it disagrees with the actual behavior of (A). Right. The behavior of H^ that is measures is DOES IT HALT. H^.qn is a Halting State. The answer from H is a decision, will the machine represented by the input Halt or not. H.qn is the prediction that the machine represented by its input will not Halt. The Machine reprented by its input is H^(<N^>) which is the first computation, which DID halt. Are confused that it halted in a state named H^.qn? > > Now that I know that H(<Ĥ>,<Ĥ>) ⊢* H.qy > I have directly contradicted the Linz conclusion. Wait, you just said that H^.qx when to H.qn, and at H^.qx is the copy of H so to say that H(<H^>,<H^>) goes to qy is a contradiction. Either you built H^ wrong, or H isn't actually a computation. We know that H, to meet the requirements needs to have gone to qy, but the fact that it went to qn says that your H doesn't meet the requirements. > > The contradiction tells us that our assumption > of the existence of H, and hence the assumption > of the decidability of the halting problem, must > be false. (Linz:1990:320) > > https://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf > > Linz, Peter 1990. An Introduction to Formal Languages and Automata. > Lexington/Toronto: D. C. Heath and Company. (318-320) > > Ĥ.qx(<Ĥ>,<Ĥ>) ⊢* H.qn is correct because the simulation of <Ĥ> applied > to <Ĥ> never reaches any final state whether or not the simulating halt > decider at Ĥ.qx aborts its simulation of this input. WRONG. Read the requirements, It is NOT a question of if the 'simulation' of <H^> ever reaches any final state, but the ACTUAL MACHINE. Yes, you can replace the running of the actual machine by the simulation with a UTM, but H is NOT a UTM, since it stops its simulation, so the fact that the PARTIAL simulation doesn't reach a final halting state means NOTHING. > > You can dishonestly call this another different halting problem yet you > know damn well it is the original halting problem. YOU are the one being dishonest. Are you really that dum. Where does Linz EVER talk about > > That a computation never reaches its final state when this computation > is allowed to continue unabated is the very conventional definition of > not halting. > Given that H(<H^>,<H^>) can give an answer: H^(<H^>) when run unabated does Halt. <H^> <H^> when simulated by a simulator that doesn't stop, will Halt Remember, You need to FIRST define fully and completely the step by step algorithm that H is going to use. THEN you can define the machine H^. THEN you can ask the two computations: H(<H^>,<H^>) and H^(<H^>) H is correct if the answer it gives matches the behavior of H^. In your case, you keep on insisting that H will 'correctly' answer Non-Halting, but we KNOW that if it does, then H^ will Halt, so H will be wrong. Yes, H's simulation of H^ won't get there, but being an aborted simulation, that doesn't actually mean anything. Just simply running H^(<H^>) we see that it halts just a bit after H gave up on its simulation. FAIL.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-30 02:38 +0100 |
| Message-ID | <87wnmyn8px.fsf@bsb.me.uk> |
| In reply to | #40059 |
olcott <NoOne@NoWhere.com> writes: > No point by point direct rebuttal of the mistakes that I have made in > the following because you know there are no mistakes: > > The halt decider is at Ĥ.qx. The halt decider is not at Ĥ.q0. > The halt decider does not decide that halt status of itself. > The halt decider decides the halt status of its input. > The input to the halt decider at Ĥ.qx is ⟨Ĥ⟩ ⟨Ĥ⟩. This is a curious tactic. I show you that you are catastrophically wrong (in the sense that you are not even talking about the halting problem) and you just state a few facts and challenge me to object to them. But I can't honestly talk about them because you've redefined halting! Are you talking about "actual halting" or your junk version on the basis of which H may reject "actual halting" computations and be deemed to be correct? You refuse to say, so that stops me addressing these "facts". Until you name your new (and useless) problem (I call is POOH), discussions using the word "halt" are impossible. I can quote your explicit redefinition: This definition of halting circumvents the pathological self-reference error for every simulating halt decider: An input is decided to be halting only if its simulation never needs to be stopped by any simulating halt decider anywhere in its entire invocation chain. On that basis: Ĥ(<Ĥ>) ⊢* Ĥ.qn H(<Ĥ>,<Ĥ>) ⊢* H.qn and point out that everything you say from now on about "halting" is not about Linz's halting problem, but that's about all I can say. > Since you already know these things are true denying them is dishonest. > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ > if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt Oh, and I can say you are lying about Linz's Ĥ because you've replaced his annotations with you own silly ones. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-28 20:31 -0500 |
| Subject | Re: The key basis of my refutation of the halting theorem [ better wording ] |
| Message-ID | <-rWdnXMCPMGZX878nZ2dnUU7-bvNnZ2d@giganews.com> |
| In reply to | #40056 |
On 9/28/2021 8:15 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/28/2021 10:13 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 9/27/2021 8:52 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 9/27/2021 3:52 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>>>> All of the "rebuttals" to the {key basis of my refutation} have taken
>>>>>>>> the form of the strawman error, here is the most common
>>>>>>>> The halting theorem does not specify a simulating halt decider.
>>>>>>>
>>>>>>> The most common one is that false is the wrong answer for a halting
>>>>>>> computation. That's the error I see most commonly pointed out.
>>>>>>>
>>>>>>> You were clear, even then, that your "solution" or "rebuttal" or
>>>>>>> whatever was to redefine halting:
>>>>>>>
>>>>>>> "This definition of halting circumvents the pathological
>>>>>>> self-reference error for every simulating halt decider:
>>>>>>>
>>>>>>> An input is decided to be halting only if its simulation never needs
>>>>>>> to be stopped by any simulating halt decider anywhere in its entire
>>>>>>> invocation chain.
>>>>>>>
>>>>>>> On that basis:
>>>>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn
>>>>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn"
>>>>>>>
>>>>>>> There you are (May 17 2017) clearly stating that you've defined H
>>>>>>> rejecting a halting computation to be correct! I must say I'd forgotten
>>>>>>> how long you have been flogging this dead horse.
>>> No answer to this of course.
>>>
>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and
>>>>>>
>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt
>>>>>
>>>>> Deceptive removal of Linz's annotations. I've told you before that you
>>>>> should not do that.
>>>>
>>>> I merely adapted his annotations to be more clear.
>>> "if Ĥ applied to ⟨Ĥ⟩ halts" and "if Ĥ applied to ⟨Ĥ⟩ does not halt" are
>>> perfectly clear. There are what the halting theorem is about --
>>> halting. Replacing then with your junk is dishonest. Stop it.
>>
>> The halt decider is at Ĥ.qx. The halt decider is not at Ĥ.q0.
>
> And Linz's annotations are the correct ones. If you don't understand
> why, ask. If you do (and you claim to simply ave clified them) leave
> them in place.
>
>> The halt decider does not decide that halt status of itself.
>
> And Linz's annotation are the correct ones.
>
>> The halt decider decides the halt status of its input.
>
> And Linz's annotation are still the correct ones.
>
>> The input to the halt decider at Ĥ.qx is ⟨Ĥ⟩ ⟨Ĥ⟩.
>
> And it is still a lie to remove Linz's correct annotations from the
> lines you write above.
>
>> Since you already know these things are true denying them is
>> dishonest.
>
> I have not denied these things. You have removed the correct
> descriptions about which lines apply in which situations and I telling
> you to stop being so dishonest.
>
> It's clear from the fact that you think what you've written here is
> relevant, that you don't know /why/ Linz says "if Ĥ applied to ⟨Ĥ⟩
> halts" about the first and "if Ĥ applied to ⟨Ĥ⟩ does not halt" about the
> second, but your inability to understand is no excuse for replacing them
> with your junk versions.
>
-----1-----------2--3----------
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
If the simulation of the TM description of the 2nd instance of ⟨Ĥ⟩
applied to the TM description of the 3rd instance of ⟨Ĥ⟩ never reaches
its final state then transition to Ĥ.qn.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-28 22:17 -0400 |
| Subject | Re: The key basis of my refutation of the halting theorem [ better wording ] |
| Message-ID | <11Q4J.151458$o45.109030@fx46.iad> |
| In reply to | #40060 |
On 9/28/21 9:31 PM, olcott wrote:
> On 9/28/2021 8:15 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 9/28/2021 10:13 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 9/27/2021 8:52 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 9/27/2021 3:52 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>>>> All of the "rebuttals" to the {key basis of my refutation} have
>>>>>>>>> taken
>>>>>>>>> the form of the strawman error, here is the most common
>>>>>>>>> The halting theorem does not specify a simulating halt decider.
>>>>>>>>
>>>>>>>> The most common one is that false is the wrong answer for a halting
>>>>>>>> computation. That's the error I see most commonly pointed out.
>>>>>>>>
>>>>>>>> You were clear, even then, that your "solution" or "rebuttal" or
>>>>>>>> whatever was to redefine halting:
>>>>>>>>
>>>>>>>> "This definition of halting circumvents the pathological
>>>>>>>> self-reference error for every simulating halt decider:
>>>>>>>>
>>>>>>>> An input is decided to be halting only if its simulation
>>>>>>>> never needs
>>>>>>>> to be stopped by any simulating halt decider anywhere in
>>>>>>>> its entire
>>>>>>>> invocation chain.
>>>>>>>>
>>>>>>>> On that basis:
>>>>>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn
>>>>>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn"
>>>>>>>>
>>>>>>>> There you are (May 17 2017) clearly stating that you've defined H
>>>>>>>> rejecting a halting computation to be correct! I must say I'd
>>>>>>>> forgotten
>>>>>>>> how long you have been flogging this dead horse.
>>>> No answer to this of course.
>>>>
>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
>>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and
>>>>>>>
>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt
>>>>>>
>>>>>> Deceptive removal of Linz's annotations. I've told you before
>>>>>> that you
>>>>>> should not do that.
>>>>>
>>>>> I merely adapted his annotations to be more clear.
>>>> "if Ĥ applied to ⟨Ĥ⟩ halts" and "if Ĥ applied to ⟨Ĥ⟩ does not halt" are
>>>> perfectly clear. There are what the halting theorem is about --
>>>> halting. Replacing then with your junk is dishonest. Stop it.
>>>
>>> The halt decider is at Ĥ.qx. The halt decider is not at Ĥ.q0.
>>
>> And Linz's annotations are the correct ones. If you don't understand
>> why, ask. If you do (and you claim to simply ave clified them) leave
>> them in place.
>>
>>> The halt decider does not decide that halt status of itself.
>>
>> And Linz's annotation are the correct ones.
>>
>>> The halt decider decides the halt status of its input.
>>
>> And Linz's annotation are still the correct ones.
>>
>>> The input to the halt decider at Ĥ.qx is ⟨Ĥ⟩ ⟨Ĥ⟩.
>>
>> And it is still a lie to remove Linz's correct annotations from the
>> lines you write above.
>>
>>> Since you already know these things are true denying them is
>>> dishonest.
>>
>> I have not denied these things. You have removed the correct
>> descriptions about which lines apply in which situations and I telling
>> you to stop being so dishonest.
>>
>> It's clear from the fact that you think what you've written here is
>> relevant, that you don't know /why/ Linz says "if Ĥ applied to ⟨Ĥ⟩
>> halts" about the first and "if Ĥ applied to ⟨Ĥ⟩ does not halt" about the
>> second, but your inability to understand is no excuse for replacing them
>> with your junk versions.
>>
>
> -----1-----------2--3----------
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>
> If the simulation of the TM description of the 2nd instance of ⟨Ĥ⟩
> applied to the TM description of the 3rd instance of ⟨Ĥ⟩ never reaches
> its final state then transition to Ĥ.qn.
>
>
Linz NEVER said 'simulation'
If you want, you COULD use 'simulation' here, but the it must be an
ACTUAL PURE Simulation, ala UTM, not a machine that creates only a
partial simulation.
Or, do you think it is ok if your doctor just decides to stop half way
through some treatment, and say thats good enough, we won't bother
finishing even though there is still some important steps to come.
H is NOT a UTM (or at least the H that answers isn't) Thus H not getting
to that halting state doesn't actually mean anything. It isn't the right
machine for that test.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-29 13:36 -0500 |
| Message-ID | <0_ednXzQlOe6L8n8nZ2dnUU7-IudnZ2d@giganews.com> |
| In reply to | #40056 |
On 9/28/2021 8:15 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 9/28/2021 10:13 AM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> On 9/27/2021 8:52 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> On 9/27/2021 3:52 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>>>> All of the "rebuttals" to the {key basis of my refutation} have taken
>>>>>>>> the form of the strawman error, here is the most common
>>>>>>>> The halting theorem does not specify a simulating halt decider.
>>>>>>>
>>>>>>> The most common one is that false is the wrong answer for a halting
>>>>>>> computation. That's the error I see most commonly pointed out.
>>>>>>>
>>>>>>> You were clear, even then, that your "solution" or "rebuttal" or
>>>>>>> whatever was to redefine halting:
>>>>>>>
>>>>>>> "This definition of halting circumvents the pathological
>>>>>>> self-reference error for every simulating halt decider:
>>>>>>>
>>>>>>> An input is decided to be halting only if its simulation never needs
>>>>>>> to be stopped by any simulating halt decider anywhere in its entire
>>>>>>> invocation chain.
>>>>>>>
>>>>>>> On that basis:
>>>>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn
>>>>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn"
>>>>>>>
>>>>>>> There you are (May 17 2017) clearly stating that you've defined H
>>>>>>> rejecting a halting computation to be correct! I must say I'd forgotten
>>>>>>> how long you have been flogging this dead horse.
>>> No answer to this of course.
>>>
>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and
>>>>>>
>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt
>>>>>
>>>>> Deceptive removal of Linz's annotations. I've told you before that you
>>>>> should not do that.
>>>>
>>>> I merely adapted his annotations to be more clear.
>>> "if Ĥ applied to ⟨Ĥ⟩ halts" and "if Ĥ applied to ⟨Ĥ⟩ does not halt" are
>>> perfectly clear. There are what the halting theorem is about --
>>> halting. Replacing then with your junk is dishonest. Stop it.
>>
>> The halt decider is at Ĥ.qx. The halt decider is not at Ĥ.q0.
>
> And Linz's annotations are the correct ones. If you don't understand
> why, ask. If you do (and you claim to simply ave clified them) leave
> them in place.
>
>> The halt decider does not decide that halt status of itself.
>
> And Linz's annotation are the correct ones.
>
>> The halt decider decides the halt status of its input.
>
> And Linz's annotation are still the correct ones.
>
>> The input to the halt decider at Ĥ.qx is ⟨Ĥ⟩ ⟨Ĥ⟩.
>
> And it is still a lie to remove Linz's correct annotations from the
> lines you write above.
>
>> Since you already know these things are true denying them is
>> dishonest.
>
> I have not denied these things. You have removed the correct
> descriptions about which lines apply in which situations and I telling
> you to stop being so dishonest.
>
> It's clear from the fact that you think what you've written here is
> relevant, that you don't know /why/ Linz says "if Ĥ applied to ⟨Ĥ⟩
> halts" about the first and "if Ĥ applied to ⟨Ĥ⟩ does not halt" about the
> second, but your inability to understand is no excuse for replacing them
> with your junk versions.
>
The following simplifies the syntax for the definition of the Linz
Turing machine Ĥ, it is now a single machine with a single start state.
A simulating halt decider is embedded at Ĥ.qx. It has been annotated so
that it only shows Ĥ applied to ⟨Ĥ⟩, converting the variables to constants.
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
if the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ reaches its final
state. (Halts)
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
if the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its
final state. (Does not halt)
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-29 19:12 -0400 |
| Message-ID | <jp65J.38922$tA2.31684@fx02.iad> |
| In reply to | #40077 |
On 9/29/21 2:36 PM, olcott wrote:
> On 9/28/2021 8:15 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 9/28/2021 10:13 AM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> On 9/27/2021 8:52 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> On 9/27/2021 3:52 PM, Ben Bacarisse wrote:
>>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>>>> All of the "rebuttals" to the {key basis of my refutation} have
>>>>>>>>> taken
>>>>>>>>> the form of the strawman error, here is the most common
>>>>>>>>> The halting theorem does not specify a simulating halt decider.
>>>>>>>>
>>>>>>>> The most common one is that false is the wrong answer for a halting
>>>>>>>> computation. That's the error I see most commonly pointed out.
>>>>>>>>
>>>>>>>> You were clear, even then, that your "solution" or "rebuttal" or
>>>>>>>> whatever was to redefine halting:
>>>>>>>>
>>>>>>>> "This definition of halting circumvents the pathological
>>>>>>>> self-reference error for every simulating halt decider:
>>>>>>>>
>>>>>>>> An input is decided to be halting only if its simulation
>>>>>>>> never needs
>>>>>>>> to be stopped by any simulating halt decider anywhere in
>>>>>>>> its entire
>>>>>>>> invocation chain.
>>>>>>>>
>>>>>>>> On that basis:
>>>>>>>> Ĥ(<Ĥ>) ⊢* Ĥ.qn
>>>>>>>> H(<Ĥ>,<Ĥ>) ⊢* H.qn"
>>>>>>>>
>>>>>>>> There you are (May 17 2017) clearly stating that you've defined H
>>>>>>>> rejecting a halting computation to be correct! I must say I'd
>>>>>>>> forgotten
>>>>>>>> how long you have been flogging this dead horse.
>>>> No answer to this of course.
>>>>
>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
>>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and
>>>>>>>
>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>>> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt
>>>>>>
>>>>>> Deceptive removal of Linz's annotations. I've told you before
>>>>>> that you
>>>>>> should not do that.
>>>>>
>>>>> I merely adapted his annotations to be more clear.
>>>> "if Ĥ applied to ⟨Ĥ⟩ halts" and "if Ĥ applied to ⟨Ĥ⟩ does not halt" are
>>>> perfectly clear. There are what the halting theorem is about --
>>>> halting. Replacing then with your junk is dishonest. Stop it.
>>>
>>> The halt decider is at Ĥ.qx. The halt decider is not at Ĥ.q0.
>>
>> And Linz's annotations are the correct ones. If you don't understand
>> why, ask. If you do (and you claim to simply ave clified them) leave
>> them in place.
>>
>>> The halt decider does not decide that halt status of itself.
>>
>> And Linz's annotation are the correct ones.
>>
>>> The halt decider decides the halt status of its input.
>>
>> And Linz's annotation are still the correct ones.
>>
>>> The input to the halt decider at Ĥ.qx is ⟨Ĥ⟩ ⟨Ĥ⟩.
>>
>> And it is still a lie to remove Linz's correct annotations from the
>> lines you write above.
>>
>>> Since you already know these things are true denying them is
>>> dishonest.
>>
>> I have not denied these things. You have removed the correct
>> descriptions about which lines apply in which situations and I telling
>> you to stop being so dishonest.
>>
>> It's clear from the fact that you think what you've written here is
>> relevant, that you don't know /why/ Linz says "if Ĥ applied to ⟨Ĥ⟩
>> halts" about the first and "if Ĥ applied to ⟨Ĥ⟩ does not halt" about the
>> second, but your inability to understand is no excuse for replacing them
>> with your junk versions.
>>
>
> The following simplifies the syntax for the definition of the Linz
> Turing machine Ĥ, it is now a single machine with a single start state.
> A simulating halt decider is embedded at Ĥ.qx. It has been annotated so
> that it only shows Ĥ applied to ⟨Ĥ⟩, converting the variables to constants.
>
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
> if the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ reaches its final
> state. (Halts)
>
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
> if the simulated input to Ĥ.qx ⟨Ĥ⟩ applied to ⟨Ĥ⟩ never reaches its
> final state. (Does not halt)
>
WRONG.
That may be what YOU think it is and what you inplemented it, but you
have the conditionns it is supposed to decide on wrong.
Linz does NOT limit himself to just looking at Simulating Halt deciders,
so the answer that H is supposed to get is based purely on things that
are Univeral, and what is cared about, the behavior of the actual
machine whose representation is given to the decider.
FAIL. Try again.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-27 20:24 -0400 |
| Message-ID | <Ogt4J.150725$o45.30388@fx46.iad> |
| In reply to | #39982 |
On 9/27/21 3:34 PM, olcott wrote:
> This is the key basis of my refutation of the halting theorem:
> The halting theorem counter-examples present infinitely nested
> simulation (non-halting) behavior to every simulating halt decider.
No, it doesn't.
If it was, then the Halt Decider would be unable to answer the question
of the machine, as the decider is PART of that loop, and thus is also
stuck in it.
>
> I presented this to Ben more than four years ago and he successfully
> changed the subject with various dishonest dodges so that it could not
> be properly evaluated until now.
>
> Infinitely Recursive input on HP Proofs
> peteolcott Mar 11, 2017, 3:13:03 PM
> https://groups.google.com/g/comp.theory/c/NcFS02hKs1U
>
> I had to stop tolerating dishonest dodges that changed the subject
> rather than directly addressed the point at hand. A dishonest dodge most
> often is an example of the strawman error.
>
> A straw man (sometimes written as strawman) is a form of argument and an
> informal fallacy of having the impression of refuting an argument,
> whereas the real subject of the argument was not addressed or refuted,
> but instead replaced with a false one.
> https://en.wikipedia.org/wiki/Straw_man
>
> All of the "rebuttals" to the {key basis of my refutation} have taken
> the form of the strawman error, here is the most common one:
> The halting theorem does not specify a simulating halt decider.
> This is no actual rebuttal to the original claim at all.
>
> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
>
>
No, YOU present straw men, and refues to actually answer the problems in
your argument.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-30 14:54 -0500 |
| Message-ID | <eu6dnRfavt-Ii8v8nZ2dnUU7-Y_NnZ2d@giganews.com> |
| In reply to | #39982 |
On 9/30/2021 4:38 AM, zelos...@gmail.com wrote:
> måndag 27 september 2021 kl. 21:35:05 UTC+2 skrev olcott:
>> This is the key basis of my refutation of the halting theorem:
>> The halting theorem counter-examples present infinitely nested
>> simulation (non-halting) behavior to every simulating halt decider.
>>
>> I presented this to Ben more than four years ago and he successfully
>> changed the subject with various dishonest dodges so that it could not
>> be properly evaluated until now.
>>
>> Infinitely Recursive input on HP Proofs
>> peteolcott Mar 11, 2017, 3:13:03 PM
>> https://groups.google.com/g/comp.theory/c/NcFS02hKs1U
>>
>> I had to stop tolerating dishonest dodges that changed the subject
>> rather than directly addressed the point at hand. A dishonest dodge most
>> often is an example of the strawman error.
>>
>> A straw man (sometimes written as strawman) is a form of argument and an
>> informal fallacy of having the impression of refuting an argument,
>> whereas the real subject of the argument was not addressed or refuted,
>> but instead replaced with a false one.
>> https://en.wikipedia.org/wiki/Straw_man
>>
>> All of the "rebuttals" to the {key basis of my refutation} have taken
>> the form of the strawman error, here is the most common one:
>> The halting theorem does not specify a simulating halt decider.
>> This is no actual rebuttal to the original claim at all.
>>
>> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
>>
>>
>> --
>> Copyright 2021 Pete Olcott
>>
>> "Great spirits have always encountered violent opposition from mediocre
>> minds." Einstein
>
> it is not a refutation because if you have a machine that can solve the halting problem then we can construct a machine that the previous machine cannot determine if it holds or not. Ergo it has no solution
>
With my solution that does not work:
The halting theorem counter-examples present infinitely nested
simulation (non-halting) behavior to every simulating halt decider.
The pathological self-reference of the conventional halting problem
proof counter-examples is overcome.
The halt status of these examples is correctly determined. A simulating
halt decider remains in pure simulation mode until after it determines
that its input will never reach its final state.
This eliminates the conventional feedback loop where the behavior of the
halt decider effects the behavior of its input.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [standalone]
Page 2 of 2 — ← Prev page 1 [2]
Back to top | Article view | comp.theory
csiph-web