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 | 20 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 1 of 2 [1] 2 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-27 14:34 -0500 |
| Subject | The key basis of my refutation of the halting theorem |
| Message-ID | <v_6dnQDH4-9Ggc_8nZ2dnUU7-N_NnZ2d@giganews.com> |
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
[toc] | [next] | [standalone]
| From | "dklei...@gmail.com" <dkleinecke@gmail.com> |
|---|---|
| Date | 2021-09-27 13:41 -0700 |
| Message-ID | <cd82bf61-2110-4a15-bbc3-fb9441546a39n@googlegroups.com> |
| In reply to | #39982 |
On Monday, September 27, 2021 at 12:34:58 PM UTC-7, 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. The halting theorem says no Turing Machine exists that can for any input TM tell whether that input TM halts or not. Refuting that theorem means asserting that Turing Machines exist that can for any input TM tell whether that input TM halts or not. I don't think you have even been attempting to prove that. You appear to have been trying to prove one particular proof of the theorem is flawed. This, of course, is not very helpful because other proofs exists.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-27 15:47 -0500 |
| Message-ID | <Gb6dndkFDLRJsM_8nZ2dnUU7-IWdnZ2d@giganews.com> |
| In reply to | #39985 |
On 9/27/2021 3:41 PM, dklei...@gmail.com wrote: > On Monday, September 27, 2021 at 12:34:58 PM UTC-7, 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. > > The halting theorem says no Turing Machine exists that can for any > input TM tell whether that input TM halts or not. Refuting that > theorem means asserting that > > Turing Machines exist that can for any input TM tell whether that > input TM halts or not. > > I don't think you have even been attempting to prove that. > > You appear to have been trying to prove one particular proof of > the theorem is flawed. This, of course, is not very helpful > because other proofs exists. > Apparently all of the other proofs are reducible to the one. -- 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-27 20:31 -0400 |
| Message-ID | <4ot4J.36006$6u6.20064@fx03.iad> |
| In reply to | #39987 |
On 9/27/21 4:47 PM, olcott wrote: > On 9/27/2021 3:41 PM, dklei...@gmail.com wrote: >> On Monday, September 27, 2021 at 12:34:58 PM UTC-7, 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. >> >> The halting theorem says no Turing Machine exists that can for any >> input TM tell whether that input TM halts or not. Refuting that >> theorem means asserting that >> >> Turing Machines exist that can for any input TM tell whether that >> input TM halts or not. >> >> I don't think you have even been attempting to prove that. >> >> You appear to have been trying to prove one particular proof of >> the theorem is flawed. This, of course, is not very helpful >> because other proofs exists. >> > > Apparently all of the other proofs are reducible to the one. > No, but it seems this is the only one you even think you understand, so you think it is all there is. There are many other fundamentally different proofs, but at least most of them require you to REALLY understand what a Computation or a Computatble Function is, so are over your head.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-27 22:03 +0100 |
| Message-ID | <87r1d9spdf.fsf@bsb.me.uk> |
| In reply to | #39985 |
"dklei...@gmail.com" <dkleinecke@gmail.com> writes: > On Monday, September 27, 2021 at 12:34:58 PM UTC-7, 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. > > The halting theorem says no Turing Machine exists that can for any > input TM tell whether that input TM halts or not. Refuting that > theorem means asserting that > > Turing Machines exist that can for any input TM tell whether that > input TM halts or not. > > I don't think you have even been attempting to prove that. > > You appear to have been trying to prove one particular proof of > the theorem is flawed. This, of course, is not very helpful > because other proofs exists. No, he is declaring that we've got the whole notion of halting wrong. Halting is not halting but: "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" That's from May 2017. H rejects <Ĥ>,<Ĥ> despite the fact that Ĥ(<Ĥ>) halts. The wrong answer is now correct because halting has been redefined. To give him his dues, he's not hiding the nonsense. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-27 21:52 +0100 |
| Message-ID | <87wnn1spvq.fsf@bsb.me.uk> |
| In reply to | #39982 |
olcott <NoOne@NoWhere.com> writes:
> 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.
Not a refutation of anything.
> 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.
Liar.
> Infinitely Recursive input on HP Proofs
> peteolcott Mar 11, 2017, 3:13:03 PM
> https://groups.google.com/g/comp.theory/c/NcFS02hKs1U
This was a post about a different topic. You are confused even about
what you were saying back then. I've explained in anther reply. You
are now saying the same thing over and over, so I won't copy my reply
out here.
> 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.
(There is an error of logic where you think that being specific -- some
special kind of decider -- gets round a proof that is about all TMs, but
you present that error only every now and then.)
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-27 16:38 -0500 |
| Message-ID | <GaqdnbYhY_NApM_8nZ2dnUU7-YXNnZ2d@giganews.com> |
| In reply to | #39988 |
On 9/27/2021 3:52 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> 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.
>
> Not a refutation of anything.
>
>> 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.
>
> Liar.
>
>> Infinitely Recursive input on HP Proofs
>> peteolcott Mar 11, 2017, 3:13:03 PM
>> https://groups.google.com/g/comp.theory/c/NcFS02hKs1U
>
> This was a post about a different topic. You are confused even about
> what you were saying back then. I've explained in anther reply. You
> are now saying the same thing over and over, so I won't copy my reply
> out here.
>
>> 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.
>
> (There is an error of logic where you think that being specific -- some
> special kind of decider -- gets round a proof that is about all TMs, but
> you present that error only every now and then.)
>
As I carefully think this through again and again I continue to get
deeper insights.
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
// because the simulation of ⟨Ĥ⟩ applied to ⟨Ĥ⟩ by Ĥ.qx DOES NOT HALT
The computation of Ĥ applied to ⟨Ĥ⟩ is a distinctly different
computation than the computation of the simulation of ⟨Ĥ⟩ applied to ⟨Ĥ⟩
by Ĥ.qx.
If we want to specify a computation that is equivalent to Ĥ applied to
⟨Ĥ⟩ we must specify H applied to ⟨Ĥ⟩ ⟨Ĥ⟩. H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
The difference is that the input to Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ invokes a copy of Ĥ.qx
whereas the input to H does not invoke a copy of H.
The pathological self-reference error that I first discovered in 2004 is
the key to finally resolved these otherwise undecidable decision problem
inputs.
comp.theory
Halting Problem Final Conclusion
Peter Olcott Sep 5, 2004,
The Liar Paradox can be shown to be nothing more than
a incorrectly formed statement because of its pathological
self-reference. The Halting Problem can only exist because
of this same sort of pathological self-reference.
https://groups.google.com/g/comp.theory/c/RO9Z9eCabeE/m/Ka8-xS2rdEEJ
--
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-27 20:46 -0400 |
| Message-ID | <pBt4J.72628$VZ1.31444@fx08.iad> |
| In reply to | #39991 |
On 9/27/21 5:38 PM, olcott wrote:
> On 9/27/2021 3:52 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> 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.
>>
>> Not a refutation of anything.
>>
>>> 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.
>>
>> Liar.
>>
>>> Infinitely Recursive input on HP Proofs
>>> peteolcott Mar 11, 2017, 3:13:03 PM
>>> https://groups.google.com/g/comp.theory/c/NcFS02hKs1U
>>
>> This was a post about a different topic. You are confused even about
>> what you were saying back then. I've explained in anther reply. You
>> are now saying the same thing over and over, so I won't copy my reply
>> out here.
>>
>>> 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.
>>
>> (There is an error of logic where you think that being specific -- some
>> special kind of decider -- gets round a proof that is about all TMs, but
>> you present that error only every now and then.)
>>
>
> As I carefully think this through again and again I continue to get
> deeper insights.
>
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and
>
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
> if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt
>
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
> // because the simulation of ⟨Ĥ⟩ applied to ⟨Ĥ⟩ by Ĥ.qx DOES NOT HALT
>
> The computation of Ĥ applied to ⟨Ĥ⟩ is a distinctly different
> computation than the computation of the simulation of ⟨Ĥ⟩ applied to ⟨Ĥ⟩
> by Ĥ.qx.
Maybe the partial simulation of <H^> applied to <H^> is different than
H^ applied to <H^>, but it is the latter that H is supposed to determine.
>
> If we want to specify a computation that is equivalent to Ĥ applied to
> ⟨Ĥ⟩ we must specify H applied to ⟨Ĥ⟩ ⟨Ĥ⟩. H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
No, at least not if H represents the H that H^/P was built on.
>
> The difference is that the input to Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ invokes a copy of Ĥ.qx
> whereas the input to H does not invoke a copy of H.
So.
>
> The pathological self-reference error that I first discovered in 2004 is
> the key to finally resolved these otherwise undecidable decision problem
> inputs.
It isn't pathological except to you.
>
> comp.theory
> Halting Problem Final Conclusion
> Peter Olcott Sep 5, 2004,
>
> The Liar Paradox can be shown to be nothing more than
> a incorrectly formed statement because of its pathological
> self-reference. The Halting Problem can only exist because
> of this same sort of pathological self-reference.
> https://groups.google.com/g/comp.theory/c/RO9Z9eCabeE/m/Ka8-xS2rdEEJ
>
Except that the question being asked (pr at least the question asked by
the theory you are supposedly talking aobut), "Given a defined H, does
H^(H^) Halt in finite time or not?" actually always has a definite
answer, so it isn't the liars paradox.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-28 02:52 +0100 |
| Message-ID | <871r59sbyv.fsf@bsb.me.uk> |
| In reply to | #39991 |
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.
> As I carefully think this through again and again I continue to get
> deeper insights.
But does anyone care since you are not taking about the halting problem
anymore?
> Ĥ.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.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-27 21:11 -0500 |
| Message-ID | <-uGdnb3qbuBZ5M_8nZ2dnUU7-RfNnZ2d@giganews.com> |
| In reply to | #40001 |
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.
>
>> As I carefully think this through again and again I continue to get
>> deeper insights.
>
> But does anyone care since you are not taking about the halting problem
> anymore?
>
>> Ĥ.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.
It is not about whether or not Ĥ halts on ⟨Ĥ⟩.
It is about whether or not the simulation of ⟨Ĥ⟩ on ⟨Ĥ⟩ at Ĥ.qx halts.
H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ is computationally equivalent to Ĥ applied to ⟨Ĥ⟩.
Ĥ applied to ⟨Ĥ⟩ is NOT computationally equivalent to H applied to ⟨Ĥ⟩ ⟨Ĥ⟩.
--
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-27 22:57 -0400 |
| Message-ID | <fwv4J.17542$2e3.3435@fx29.iad> |
| In reply to | #40004 |
On 9/27/21 10:11 PM, olcott wrote:
> 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.
>>
>>> As I carefully think this through again and again I continue to get
>>> deeper insights.
>>
>> But does anyone care since you are not taking about the halting problem
>> anymore?
>>
>>> Ĥ.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.
> It is not about whether or not Ĥ halts on ⟨Ĥ⟩.
> It is about whether or not the simulation of ⟨Ĥ⟩ on ⟨Ĥ⟩ at Ĥ.qx halts.
Which means you are working on POOP, not the halting problem.
>
> H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ is computationally equivalent to Ĥ applied to ⟨Ĥ⟩.
Nope. They are not the same sort of computations.
>
> Ĥ applied to ⟨Ĥ⟩ is NOT computationally equivalent to H applied to ⟨Ĥ⟩ ⟨Ĥ⟩.
>
Right, but not for the reason you think it is.
H^ applied to <H^> will have as a sub-computation inside it H applied to
<H^> <H^> but to full computation isn't the same.
Then answer of that sub computation will be computationally IDENTICAL to
what the decider actually does, as it isn't just 'equivalent' code, but
it is ALL the code (with just a small modification to the code at the
terminal state of qy) with EXACTLY the same input.
The path from H^.qx to H^.qn is IDENTICAL to H.q0 to H.qn since EVERY
step is an exact copy of the instructions with and exact copy of the input.
Also, take a look at what you just said.
If A := "H applied to <H^> <H^>" and b :- "H^ appllied to <H^>"
Your claim above is that
A is equivalet to B but B is not equivalent to A
That is crazy talk.
Shows that your thinking has skipped a beat somewhere.
You are trying to slip in that the first H is Linz H and PO-H while the
sceond is just your PO-H1 which has no equivlent in Linz, but you WANT
it to be Linz H (but since it isn't what H^ was built on, it isn't)
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-28 16:13 +0100 |
| Message-ID | <87ee98rave.fsf@bsb.me.uk> |
| In reply to | #40004 |
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.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-28 10:26 -0500 |
| Message-ID | <2Zmdnd5S2o-pqc78nZ2dnUU7-IednZ2d@giganews.com> |
| In reply to | #40026 |
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.
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 ⟨Ĥ⟩ ⟨Ĥ⟩.
Since you already know these things are true denying them is dishonest.
--
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 19:14 -0400 |
| Message-ID | <YkN4J.43372$gc3.6445@fx12.iad> |
| In reply to | #40030 |
On 9/28/21 11:26 AM, olcott wrote:
> 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.
> 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 ⟨Ĥ⟩ ⟨Ĥ⟩.
>
> Since you already know these things are true denying them is dishonest.
>
Boy you don't read.
Yes, the decider H shows up at H^.qx. The input to that computation is
<H^> <H^> and that represents H^ applied to <H^>, which is H^.q0 with
tape of <H^>.
THis is the computation that H needs to give the right answer to.
This computation has been shown to Halt when run as the 'independent'
machine.
Thus, the only right answer for H to give is HALTING.
It gets the wrong answer be cause when it looks at copies of itself, it
presumes that they will be pure simulator FOREVER, when they only are
simulators for a bit longer than H simulates them, and thus it gets the
wrong answer.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-29 02:15 +0100 |
| Message-ID | <87ilykp4gt.fsf@bsb.me.uk> |
| In reply to | #40030 |
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.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-28 20:24 -0500 |
| Message-ID | <d7qdnTavBu38Xc78nZ2dnUU7-WWdnZ2d@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.
>
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 ⟨Ĥ⟩ ⟨Ĥ⟩.
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
--
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:13 -0400 |
| Message-ID | <lZP4J.151457$o45.98381@fx46.iad> |
| In reply to | #40059 |
On 9/28/21 9:24 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.
>>
>
> 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 ⟨Ĥ⟩ ⟨Ĥ⟩.
>
> 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
>
ANd there is your problem. Read Linz.
Linz says "if M applied to w halts" or "does not halt"
It is NOT the simulated machine that matters, it is the actual machine
tha matters.
Linz calls the machine to be decided as M, and its input w. M is given
to H as a representation w-sub-M.
You are working on the wrong problem, so all you have is POOP.
FAIL.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-30 00:24 +0100 |
| Message-ID | <87h7e3nexe.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: Let me just illustrate what your poisoning of the well has done to this discussion... > The halt decider is at Ĥ.qx. The halt decider is not at Ĥ.q0. If Ĥ refers to an Ĥ with the behaviour that Linz specifies and not the limited, incorrect, behaviour you specify below, and if "halt" means what the world means by halt and not your redefined version, then almost. The TM embedded at Ĥ.qx is not a decider of anything since it has no accepting state, but you've refused to see this obvious fact despite it having no consequences for your spurious argument. > The halt decider does not decide that halt status of itself. Hard to follow, but yes. The conditions above still apply -- that you mean what the world means by halting and not your redefined version. > The halt decider decides the halt status of its input. Provided you mean halt as the world does, then yes. > The input to the halt decider at Ĥ.qx is ⟨Ĥ⟩ ⟨Ĥ⟩. The input to the slightly modified copy of H found at Ĥ.qx is indeed ⟨Ĥ⟩ ⟨Ĥ⟩. > Since you already know these things are true denying them is > dishonest. What I know relates to Linz's Ĥ and to the conventional notion of halting. And in that context you've got only one thing actually wrong above. It would be so much simpler if you stuck with your claim to be using Ĥ to mean Linz's Ĥ and not one about which Ĥ(<Ĥ>) ⊢* Ĥ.qn H(<Ĥ>,<Ĥ>) ⊢* H.qn is deemed to be "correct". I'll leave your incorrect statements about what your Ĥ (and not Linz's Ĥ) does so my reference to it above makes sense. > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ > if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ halts, and > > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn > if the simulated ⟨Ĥ⟩ applied to ⟨Ĥ⟩ does not halt -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-29 19:06 -0500 |
| Message-ID | <XpadnRblraAeYsn8nZ2dnUU7-SvNnZ2d@giganews.com> |
| In reply to | #40088 |
On 9/29/2021 6:24 PM, Ben Bacarisse wrote: > 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: > > Let me just illustrate what your poisoning of the well has done to this > discussion... > >> The halt decider is at Ĥ.qx. The halt decider is not at Ĥ.q0. > > If Ĥ refers to an Ĥ with the behaviour that Linz specifies and not the > limited, incorrect, behaviour you specify below, and if "halt" means > what the world means by halt and not your redefined version, then > almost. > > The TM embedded at Ĥ.qx is not a decider of anything since it has no > accepting state, but you've refused to see this obvious fact despite it > having no consequences for your spurious argument. > >> The halt decider does not decide that halt status of itself. > > Hard to follow, but yes. The conditions above still apply -- that you > mean what the world means by halting and not your redefined version. > >> The halt decider decides the halt status of its input. > > Provided you mean halt as the world does, then yes. > >> The input to the halt decider at Ĥ.qx is ⟨Ĥ⟩ ⟨Ĥ⟩. > > The input to the slightly modified copy of H found at Ĥ.qx is indeed ⟨Ĥ⟩ > ⟨Ĥ⟩. > >> Since you already know these things are true denying them is >> dishonest. > > What I know relates to Linz's Ĥ and to the conventional notion of > halting. And in that context you've got only one thing actually wrong > above. > > It would be so much simpler if you stuck with your claim to be using Ĥ > to mean Linz's Ĥ and not one about which > > Ĥ(<Ĥ>) ⊢* Ĥ.qn > H(<Ĥ>,<Ĥ>) ⊢* H.qn > > is deemed to be "correct". > > I'll leave your incorrect statements about what your Ĥ (and not Linz's > Ĥ) does so my reference to it above makes sense. > ---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). It is about (3) applied to (4) and (5). (4) never halts on (5) whether or not (3) aborts its simulation, therefore (3) correctly transitions 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-29 20:26 -0400 |
| Message-ID | <Du75J.85952$Dr.60216@fx40.iad> |
| In reply to | #40089 |
On 9/29/21 8:06 PM, olcott wrote: > On 9/29/2021 6:24 PM, Ben Bacarisse wrote: >> 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: >> >> Let me just illustrate what your poisoning of the well has done to this >> discussion... >> >>> The halt decider is at Ĥ.qx. The halt decider is not at Ĥ.q0. >> >> If Ĥ refers to an Ĥ with the behaviour that Linz specifies and not the >> limited, incorrect, behaviour you specify below, and if "halt" means >> what the world means by halt and not your redefined version, then >> almost. >> >> The TM embedded at Ĥ.qx is not a decider of anything since it has no >> accepting state, but you've refused to see this obvious fact despite it >> having no consequences for your spurious argument. >> >>> The halt decider does not decide that halt status of itself. >> >> Hard to follow, but yes. The conditions above still apply -- that you >> mean what the world means by halting and not your redefined version. >> >>> The halt decider decides the halt status of its input. >> >> Provided you mean halt as the world does, then yes. >> >>> The input to the halt decider at Ĥ.qx is ⟨Ĥ⟩ ⟨Ĥ⟩. >> >> The input to the slightly modified copy of H found at Ĥ.qx is indeed ⟨Ĥ⟩ >> ⟨Ĥ⟩. >> >>> Since you already know these things are true denying them is >>> dishonest. >> >> What I know relates to Linz's Ĥ and to the conventional notion of >> halting. And in that context you've got only one thing actually wrong >> above. >> >> It would be so much simpler if you stuck with your claim to be using Ĥ >> to mean Linz's Ĥ and not one about which >> >> Ĥ(<Ĥ>) ⊢* Ĥ.qn >> H(<Ĥ>,<Ĥ>) ⊢* H.qn >> >> is deemed to be "correct". >> >> I'll leave your incorrect statements about what your Ĥ (and not Linz's >> Ĥ) does so my reference to it above makes sense. >> > > ---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). > It is about (3) applied to (4) and (5). > > (4) never halts on (5) whether or not (3) aborts its simulation, > therefore (3) correctly transitions to Ĥ.qn. > > Totally WRONG. Linz says in effect that your (3) applied to (4) and (5) needs to match the behavior of (1) applied to (2) to be right. Note, (4) applied to (5), if ACTUALLY run in a UTM will give exactly the same result as (1) applied to (2), so that is ok. H is NOT a UTM, so its FAULTY simulation doesn't mean anything.
[toc] | [prev] | [next] | [standalone]
Page 1 of 2 [1] 2 Next page →
Back to top | Article view | comp.theory
csiph-web