Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #33635 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-05-15 14:52 -0500 |
| Last post | 2021-05-16 18:02 +0200 |
| Articles | 20 on this page of 43 — 6 participants |
Back to article view | Back to comp.theory
Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 14:52 -0500
Re: Refuting the halting problem proofs Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-15 20:47 +0000
Re: Refuting the halting problem proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-15 21:48 +0100
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 21:33 -0500
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-16 09:08 -0500
Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:08 -0400
Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 07:58 -0400
Re: Refuting the halting problem proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-16 17:42 +0100
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-16 12:26 -0500
Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:46 -0400
Re: Refuting the halting problem proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 01:58 +0100
Re: Refuting the halting problem proofs Mr Flibble <flibble@reddwarf.jmc> - 2021-05-15 21:55 +0000
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 18:23 -0500
Re: Refuting the halting problem proofs Mr Flibble <flibble@reddwarf.jmc> - 2021-05-15 23:28 +0000
Re: Refuting the halting problem proofs (solving the halting problem) olcott <NoOne@NoWhere.com> - 2021-05-16 09:22 -0500
Re: Refuting the halting problem proofs (solving the halting problem) Mr Flibble <flibble@reddwarf.jmc> - 2021-05-16 15:15 +0000
Re: Refuting the halting problem proofs (solving the halting problem) olcott <NoOne@NoWhere.com> - 2021-05-16 10:19 -0500
Re: Refuting the halting problem proofs (solving the halting problem) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:55 +0000
Re: Refuting the halting problem proofs (solving the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:11 -0400
Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-15 19:37 -0400
Re: Refuting the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 05:57 +0200
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 23:29 -0500
Re: Refuting the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 10:11 +0200
Re: Refuting the halting problem proofs (in C) olcott <NoOne@NoWhere.com> - 2021-05-16 08:43 -0500
Re: Refuting the halting problem proofs (in C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:16 +0000
Re: Refuting the halting problem proofs (in C) olcott <NoOne@NoWhere.com> - 2021-05-16 10:25 -0500
Re: Refuting the halting problem proofs (in C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:57 +0000
Re: Refuting the halting problem proofs (in C) Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 18:28 +0200
Re: Refuting the halting problem proofs (in C) olcott <NoOne@NoWhere.com> - 2021-05-16 10:53 -0500
Re: Refuting the halting problem proofs (in C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:58 +0000
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 11:23 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 17:26 +0000
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 13:33 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 18:54 +0000
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 14:19 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 16:09 -0400
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 15:17 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 16:42 -0400
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 16:20 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 17:30 -0400
Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 16:07 -0400
Re: Refuting the halting problem proofs (in C) Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:17 -0400
Re: Refuting the halting problem proofs (in C) Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 18:02 +0200
Page 1 of 3 [1] 2 3 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-15 14:52 -0500 |
| Subject | Refuting the halting problem proofs |
| Message-ID | <17udnVv_WIjVuz39nZ2dnUU7-e3NnZ2d@giganews.com> |
To overcome the pathological self-reference error of the conventional
halting problem proofs we simply define halt decider H such that every
input P to halt decider H that itself calls H has the same halting value
as the halting value as input P2 adapted from input P where all calls to
H have been replaced with calls to Simulate.
We can see that on the basis of this corrected criteria the actual Linz
H would correctly decide not halting on the actual Linz Ĥ shown on page
319. http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
Does the simulation of input P by simulating (at least partial) halt
decider H have to be stopped to prevent the infinite execution of P?
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
THIS IS A TRUISM:
If the simulation never needs to be stopped then we can swap
Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
simulation must have needed to have been stopped at some point.
http://www.liarparadox.org/Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-15 20:47 +0000 |
| Message-ID | <20210515134642.357@kylheku.com> |
| In reply to | #33635 |
On 2021-05-15, olcott <NoOne@NoWhere.com> wrote: > To overcome the pathological self-reference error of the conventional > halting problem proofs we simply ... ... delve into our life savings and pay for some counselling.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-15 21:48 +0100 |
| Message-ID | <87pmxroh9a.fsf@bsb.me.uk> |
| In reply to | #33635 |
olcott <NoOne@NoWhere.com> writes: > To overcome the pathological self-reference error of the conventional > halting problem proofs we simply define halt decider H such that every > input P to halt decider H that itself calls H has the same halting > value as the halting value as input P2 adapted from input P where all > calls to H have been replaced with calls to Simulate. What are you going to call this new decision problem? You've come up with classification for encoded TN/input pair that may well be decidable. No one will know until you define it (so we won't ever know!), but at least let's have a name for it so we don't confuse it with the simple notion of dividing encoded TM/input pairs into those that halt and those that don't. I don't think my "not-quite-halting problem" or my "other-halting problem" are going to catch on, but you never know. I tried calling it "other-halting" because some halting inputs are classified as non-halting because of the behaviour of another, related, input. It's a clumsy name, but it's more descriptive than the "not-quite-halting problem". Anyway, your suggestions are welcome. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-15 21:33 -0500 |
| Message-ID | <kvednXSpm864GT39nZ2dnUU7-X-dnZ2d@giganews.com> |
| In reply to | #33640 |
On 5/15/2021 3:48 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> To overcome the pathological self-reference error of the conventional >> halting problem proofs we simply define halt decider H such that every >> input P to halt decider H that itself calls H has the same halting >> value as the halting value as input P2 adapted from input P where all >> calls to H have been replaced with calls to Simulate. > > What are you going to call this new decision problem? You've come up > with classification for encoded TN/input pair that may well be > decidable. No one will know until you define it (so we won't ever > know!), but at least let's have a name for it so we don't confuse it > with the simple notion of dividing encoded TM/input pairs into those > that halt and those that don't. > It it the halting problem where there are two choices (a) Halting (b) never_halts_unless_aborted == non_halting Such that the pathological self-reference halting problem instances become decidable on the basis of matching the the [infinitely_nested_simulation] not halting behavior pattern. > I don't think my "not-quite-halting problem" or my "other-halting > problem" are going to catch on, but you never know. I tried calling it > "other-halting" because some halting inputs are classified as > non-halting because of the behaviour of another, related, input. It's a > clumsy name, but it's more descriptive than the "not-quite-halting > problem". Anyway, your suggestions are welcome. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 09:08 -0500 |
| Message-ID | <nu2dnTxIrra_ujz9nZ2dnUU7-W_NnZ2d@giganews.com> |
| In reply to | #33659 |
On 5/16/2021 6:58 AM, Richard Damon wrote: > On 5/15/21 10:33 PM, olcott wrote: >> On 5/15/2021 3:48 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> To overcome the pathological self-reference error of the conventional >>>> halting problem proofs we simply define halt decider H such that every >>>> input P to halt decider H that itself calls H has the same halting >>>> value as the halting value as input P2 adapted from input P where all >>>> calls to H have been replaced with calls to Simulate. >>> >>> What are you going to call this new decision problem? You've come up >>> with classification for encoded TN/input pair that may well be >>> decidable. No one will know until you define it (so we won't ever >>> know!), but at least let's have a name for it so we don't confuse it >>> with the simple notion of dividing encoded TM/input pairs into those >>> that halt and those that don't. >>> >> >> It it the halting problem where there are two choices >> (a) Halting >> (b) never_halts_unless_aborted == non_halting >> >> Such that the pathological self-reference halting problem instances >> become decidable on the basis of matching the the >> [infinitely_nested_simulation] not halting behavior pattern. >> > > And what good is that? > > Since the original halting problem still exists and is shown to be > non-decidable, the proofs that use it still stand. > Based on my earlier work: peteolcott comp.theory Mar 11, 2017, 3:13:03 PM Infinitely Recursive input on HP Proofs https://groups.google.com/g/comp.theory/c/NcFS02hKs1U/m/PlBF-1LRBAAJ Copyright 2016 and 2017 Pete Olcott. Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn H.qx wM wM ⊢* H.qy H.qx wM wM ⊢* H.qn H applied to input (Ĥ, Ĥ) transitions to H.qn on the basis that the behavior of Ĥ matches the [infinitely_nested_simulation] not halting behavior pattern. http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf http://www.liarparadox.org/Halting_problem_undecidability_and_infinitely_nested_simulation.pdf > Does anyone really want the answer you give, one that is a function of > the decider as well as the machine being decided on? > All of the halting problem instances are such a function. -- 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-05-16 13:08 -0400 |
| Message-ID | <xkcoI.76326$RC2.25943@fx27.iad> |
| In reply to | #33667 |
On 5/16/21 10:08 AM, olcott wrote: > On 5/16/2021 6:58 AM, Richard Damon wrote: >> On 5/15/21 10:33 PM, olcott wrote: >>> On 5/15/2021 3:48 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> To overcome the pathological self-reference error of the conventional >>>>> halting problem proofs we simply define halt decider H such that every >>>>> input P to halt decider H that itself calls H has the same halting >>>>> value as the halting value as input P2 adapted from input P where all >>>>> calls to H have been replaced with calls to Simulate. >>>> >>>> What are you going to call this new decision problem? You've come up >>>> with classification for encoded TN/input pair that may well be >>>> decidable. No one will know until you define it (so we won't ever >>>> know!), but at least let's have a name for it so we don't confuse it >>>> with the simple notion of dividing encoded TM/input pairs into those >>>> that halt and those that don't. >>>> >>> >>> It it the halting problem where there are two choices >>> (a) Halting >>> (b) never_halts_unless_aborted == non_halting >>> >>> Such that the pathological self-reference halting problem instances >>> become decidable on the basis of matching the the >>> [infinitely_nested_simulation] not halting behavior pattern. >>> >> >> And what good is that? >> >> Since the original halting problem still exists and is shown to be >> non-decidable, the proofs that use it still stand. >> > > Based on my earlier work: > peteolcott comp.theory Mar 11, 2017, 3:13:03 PM > Infinitely Recursive input on HP Proofs > https://groups.google.com/g/comp.theory/c/NcFS02hKs1U/m/PlBF-1LRBAAJ > Copyright 2016 and 2017 Pete Olcott. > > > > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ > Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn > > H.qx wM wM ⊢* H.qy > H.qx wM wM ⊢* H.qn > > H applied to input (Ĥ, Ĥ) transitions to H.qn on the basis that > the behavior of Ĥ matches the [infinitely_nested_simulation] > not halting behavior pattern. > > http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf > > > > http://www.liarparadox.org/Halting_problem_undecidability_and_infinitely_nested_simulation.pdf > > But, we still have the fact that when we have that your H will say that H^(H^) will be non-halting, when we actually run the machine H^(H^) we find that it halts. Even you have admitted that, This means H was wrong, and thus is NOT a counter example. Only by 'redefining' what YOU mean by Halting, and asking H to answer a different question can you possibly claim it to be right. Since it IS a different definintion of the question, your proof has ZERO bearing on the actual halting problem. >> Does anyone really want the answer you give, one that is a function of >> the decider as well as the machine being decided on? >> > > All of the halting problem instances are such a function. > > Not any proper answers. That RIGHT answer to the question of whether P(I) is a halting computation or not is NOT dependent on what halt decider you are going to ask. Yes, different deciders might give different answers if some are right and some are wrong. Also, we may have different H^s for different Halt deciders, but these are supposed to be differet machines, and I think that the H^ built on Halts was really supposed to be called Halts^, it being the machine build by the 'hat' formula from Halts. With YOUR 'definition', suddenly the 'right' answer depends on what halt decider you are going to ask. H^ is non-halting to H, but Halting to other deciders
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-16 07:58 -0400 |
| Message-ID | <PN7oI.60215$7u1.59179@fx12.iad> |
| In reply to | #33659 |
On 5/15/21 10:33 PM, olcott wrote: > On 5/15/2021 3:48 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> To overcome the pathological self-reference error of the conventional >>> halting problem proofs we simply define halt decider H such that every >>> input P to halt decider H that itself calls H has the same halting >>> value as the halting value as input P2 adapted from input P where all >>> calls to H have been replaced with calls to Simulate. >> >> What are you going to call this new decision problem? You've come up >> with classification for encoded TN/input pair that may well be >> decidable. No one will know until you define it (so we won't ever >> know!), but at least let's have a name for it so we don't confuse it >> with the simple notion of dividing encoded TM/input pairs into those >> that halt and those that don't. >> > > It it the halting problem where there are two choices > (a) Halting > (b) never_halts_unless_aborted == non_halting > > Such that the pathological self-reference halting problem instances > become decidable on the basis of matching the the > [infinitely_nested_simulation] not halting behavior pattern. > And what good is that? Since the original halting problem still exists and is shown to be non-decidable, the proofs that use it still stand. Does anyone really want the answer you give, one that is a function of the decider as well as the machine being decided on?
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-16 17:42 +0100 |
| Message-ID | <87r1i6636v.fsf@bsb.me.uk> |
| In reply to | #33659 |
olcott <NoOne@NoWhere.com> writes:
> On 5/15/2021 3:48 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> To overcome the pathological self-reference error of the conventional
>>> halting problem proofs we simply define halt decider H such that every
>>> input P to halt decider H that itself calls H has the same halting
>>> value as the halting value as input P2 adapted from input P where all
>>> calls to H have been replaced with calls to Simulate.
>>
>> What are you going to call this new decision problem? You've come up
>> with classification for encoded TN/input pair that may well be
>> decidable. No one will know until you define it (so we won't ever
>> know!), but at least let's have a name for it so we don't confuse it
>> with the simple notion of dividing encoded TM/input pairs into those
>> that halt and those that don't.
>
> It it the halting problem where there are two choices
It is /a/ halting problem, not /the/ halting problem. You really need a
name for it to avoid confusion. /The/ halting is defined by two rules
you reject
(A1) For every instance of the halting problem that represents a
finite computation, the correct answer is "yes".
(A2) For every instance of the halting problem that does not represent
a finite computation, the correct answer is "no".
> (a) Halting
> (b) never_halts_unless_aborted == non_halting
Some of your (a) computations (halting ones) have a correct answer of
false (or "no"), apparently, so a new name is essential.
>> I don't think my "not-quite-halting problem" or my "other-halting
>> problem" are going to catch on, but you never know.
How do you feel about other-halting as a name for it? It captures the
gist of the rule you keep re-wording.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 12:26 -0500 |
| Message-ID | <d56dnY742YIDyDz9nZ2dnUU7-W3NnZ2d@giganews.com> |
| In reply to | #33693 |
On 5/16/2021 11:42 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 5/15/2021 3:48 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> To overcome the pathological self-reference error of the conventional >>>> halting problem proofs we simply define halt decider H such that every >>>> input P to halt decider H that itself calls H has the same halting >>>> value as the halting value as input P2 adapted from input P where all >>>> calls to H have been replaced with calls to Simulate. >>> >>> What are you going to call this new decision problem? You've come up >>> with classification for encoded TN/input pair that may well be >>> decidable. No one will know until you define it (so we won't ever >>> know!), but at least let's have a name for it so we don't confuse it >>> with the simple notion of dividing encoded TM/input pairs into those >>> that halt and those that don't. >> >> It it the halting problem where there are two choices > > It is /a/ halting problem, not /the/ halting problem. You really need a > name for it to avoid confusion. /The/ halting is defined by two rules > you reject > > (A1) For every instance of the halting problem that represents a > finite computation, the correct answer is "yes". > > (A2) For every instance of the halting problem that does not represent > a finite computation, the correct answer is "no". > >> (a) Halting >> (b) never_halts_unless_aborted == non_halting > > Some of your (a) computations (halting ones) have a correct answer of > false (or "no"), apparently, so a new name is essential. > In the same way that an infinite loop specifies an infinite computation even when the partial simulation of this computation is terminated the entire computation of H_Hat(H_Hat) specifies [infinitely_nested_simulation] no matter what point this computation is terminated. >>> I don't think my "not-quite-halting problem" or my "other-halting >>> problem" are going to catch on, but you never know. > > How do you feel about other-halting as a name for it? It captures the > gist of the rule you keep re-wording. > -- 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-05-16 13:46 -0400 |
| Message-ID | <3UcoI.132052$Y87.29396@fx08.iad> |
| In reply to | #33697 |
On 5/16/21 1:26 PM, olcott wrote: > On 5/16/2021 11:42 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 5/15/2021 3:48 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> To overcome the pathological self-reference error of the conventional >>>>> halting problem proofs we simply define halt decider H such that every >>>>> input P to halt decider H that itself calls H has the same halting >>>>> value as the halting value as input P2 adapted from input P where all >>>>> calls to H have been replaced with calls to Simulate. >>>> >>>> What are you going to call this new decision problem? You've come up >>>> with classification for encoded TN/input pair that may well be >>>> decidable. No one will know until you define it (so we won't ever >>>> know!), but at least let's have a name for it so we don't confuse it >>>> with the simple notion of dividing encoded TM/input pairs into those >>>> that halt and those that don't. >>> >>> It it the halting problem where there are two choices >> >> It is /a/ halting problem, not /the/ halting problem. You really need a >> name for it to avoid confusion. /The/ halting is defined by two rules >> you reject >> >> (A1) For every instance of the halting problem that represents a >> finite computation, the correct answer is "yes". >> >> (A2) For every instance of the halting problem that does not represent >> a finite computation, the correct answer is "no". >> >>> (a) Halting >>> (b) never_halts_unless_aborted == non_halting >> >> Some of your (a) computations (halting ones) have a correct answer of >> false (or "no"), apparently, so a new name is essential. >> > > In the same way that an infinite loop specifies an infinite computation > even when the partial simulation of this computation is terminated the > entire computation of H_Hat(H_Hat) specifies > [infinitely_nested_simulation] no matter what point this computation is > terminated. > Except that H_Hat does NOT represent an infinitely nested recursion because the Halts function inside it will (incorrectly) decide to terminate the simulation, and thus the recursion, keeping it from being an infinite recursion. Your whole logic neglect to consider that H_Hat contains all the logic of Halts, and can use that logic to keep it from being an infinite recursion. The ONLY way that H_Hat can become infinitely recursive is for Halts to fail at its requirement to decide in finite time, at which point H_Hat doesn't need to do anything to refute Halts, as Halts fails before it gives its answer.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-05-18 01:58 +0100 |
| Message-ID | <87o8d826yl.fsf@bsb.me.uk> |
| In reply to | #33697 |
olcott <NoOne@NoWhere.com> writes: > On 5/16/2021 11:42 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 5/15/2021 3:48 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> To overcome the pathological self-reference error of the conventional >>>>> halting problem proofs we simply define halt decider H such that every >>>>> input P to halt decider H that itself calls H has the same halting >>>>> value as the halting value as input P2 adapted from input P where all >>>>> calls to H have been replaced with calls to Simulate. >>>> >>>> What are you going to call this new decision problem? You've come up >>>> with classification for encoded TN/input pair that may well be >>>> decidable. No one will know until you define it (so we won't ever >>>> know!), but at least let's have a name for it so we don't confuse it >>>> with the simple notion of dividing encoded TM/input pairs into those >>>> that halt and those that don't. >>> >>> It it the halting problem where there are two choices >> >> It is /a/ halting problem, not /the/ halting problem. You really need a >> name for it to avoid confusion. /The/ halting is defined by two rules >> you reject >> >> (A1) For every instance of the halting problem that represents a >> finite computation, the correct answer is "yes". >> >> (A2) For every instance of the halting problem that does not represent >> a finite computation, the correct answer is "no". All I'll say here is you missed another opportunity to show that you know what /the/ halting problem is. Since you are not addressing it anymore it surely can't do any harm to show you know what it is. >>> (a) Halting >>> (b) never_halts_unless_aborted == non_halting >> >> Some of your (a) computations (halting ones) have a correct answer of >> false (or "no"), apparently, so a new name is essential. > > In the same way that an infinite loop specifies an infinite > computation even when the partial simulation of this computation is > terminated the entire computation of H_Hat(H_Hat) specifies > [infinitely_nested_simulation] no matter what point this computation > is terminated. I can't tell if you are reading anything anymore because your answers are non-responsive. Since you won't pick a name, I'll have to pick one for you.... We know very little about your silly-non-halting problem, but we do know that a silly-non-halting decider does not accept the same set of strings as a halting decider would. Since you are having trouble defining the silly-non-halting problem, maybe you could home in on the differences: Are there any strings representing non-finite computations which a silly-non-halting decider should accept? (A halt decider would reject them all.) Maybe you could give an example? Are there any strings representing finite computations which a silly-non-halting decider should reject? (A halt decider would accept them all.) Maybe you could give an example? -- Ben. "the fact that a computation halts does not entail that it is a halting computation" Peter Olcott, May 2021.
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@reddwarf.jmc> |
|---|---|
| Date | 2021-05-15 21:55 +0000 |
| Message-ID | <NrXnI.274919$ON31.197342@fx23.ams4> |
| In reply to | #33635 |
On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
> To overcome the pathological self-reference error of the conventional
> halting problem proofs we simply define halt decider H such that every
> input P to halt decider H that itself calls H has the same halting value
> as the halting value as input P2 adapted from input P where all calls to
> H have been replaced with calls to Simulate.
>
> We can see that on the basis of this corrected criteria the actual Linz
> H would correctly decide not halting on the actual Linz Ĥ shown on page
> 319. http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>
>
>
> Does the simulation of input P by simulating (at least partial) halt
> decider H have to be stopped to prevent the infinite execution of P?
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> THIS IS A TRUISM:
> If the simulation never needs to be stopped then we can swap
> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
> simulation must have needed to have been stopped at some point.
>
> http://www.liarparadox.org/
Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
You have not refuted Turing until your halt decider can cope with
branching logic predicated on program state predicated on arbitrary
program input.
/Flibble
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-15 18:23 -0500 |
| Message-ID | <wd-dnW08RPQsyj39nZ2dnUU7-KednZ2d@giganews.com> |
| In reply to | #33642 |
On 5/15/2021 4:55 PM, Mr Flibble wrote:
> On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
>
>> To overcome the pathological self-reference error of the conventional
>> halting problem proofs we simply define halt decider H such that every
>> input P to halt decider H that itself calls H has the same halting value
>> as the halting value as input P2 adapted from input P where all calls to
>> H have been replaced with calls to Simulate.
>>
>> We can see that on the basis of this corrected criteria the actual Linz
>> H would correctly decide not halting on the actual Linz Ĥ shown on page
>> 319. http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>
>>
>>
>> Does the simulation of input P by simulating (at least partial) halt
>> decider H have to be stopped to prevent the infinite execution of P?
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Halts = Halts(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> }
>>
>> THIS IS A TRUISM:
>> If the simulation never needs to be stopped then we can swap
>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
>> simulation must have needed to have been stopped at some point.
>>
>> http://www.liarparadox.org/
> Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
>
> You have not refuted Turing until your halt decider can cope with
> branching logic predicated on program state predicated on arbitrary
> program input.
>
> /Flibble
>
Your error is the same as this:
No one has cured any disease until they have cured every disease.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@reddwarf.jmc> |
|---|---|
| Date | 2021-05-15 23:28 +0000 |
| Message-ID | <EOYnI.579933$BHVc.546077@fx32.ams4> |
| In reply to | #33648 |
On Sat, 15 May 2021 18:23:21 -0500, olcott wrote:
> On 5/15/2021 4:55 PM, Mr Flibble wrote:
>> On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
>>
>>> To overcome the pathological self-reference error of the conventional
>>> halting problem proofs we simply define halt decider H such that every
>>> input P to halt decider H that itself calls H has the same halting
>>> value as the halting value as input P2 adapted from input P where all
>>> calls to H have been replaced with calls to Simulate.
>>>
>>> We can see that on the basis of this corrected criteria the actual
>>> Linz H would correctly decide not halting on the actual Linz Ĥ shown
>>> on page 319.
>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>>
>>>
>>>
>>> Does the simulation of input P by simulating (at least partial) halt
>>> decider H have to be stopped to prevent the infinite execution of P?
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>>
>>> THIS IS A TRUISM:
>>> If the simulation never needs to be stopped then we can swap
>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that
>>> the simulation must have needed to have been stopped at some point.
>>>
>>> http://www.liarparadox.org/
>> Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
>>
>> You have not refuted Turing until your halt decider can cope with
>> branching logic predicated on program state predicated on arbitrary
>> program input.
>>
>> /Flibble
>>
>>
> Your error is the same as this:
> No one has cured any disease until they have cured every disease.
Nope. I said the other month that I don't care about any schoolboy proofs
that might be wrong; as far as the Halting Problem is concerned I only
care about Turing's proof which you have failed to refute and will
continue to fail to refute until you address the issues I describe. Your
halting decider can only decide on a useless finite subset of problems
that nobody cares about.
/Flibble
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 09:22 -0500 |
| Subject | Re: Refuting the halting problem proofs (solving the halting problem) |
| Message-ID | <l4KdnbyNwt3itzz9nZ2dnUU7-XXNnZ2d@giganews.com> |
| In reply to | #33649 |
On 5/15/2021 6:28 PM, Mr Flibble wrote:
> On Sat, 15 May 2021 18:23:21 -0500, olcott wrote:
>
>> On 5/15/2021 4:55 PM, Mr Flibble wrote:
>>> On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
>>>
>>>> To overcome the pathological self-reference error of the conventional
>>>> halting problem proofs we simply define halt decider H such that every
>>>> input P to halt decider H that itself calls H has the same halting
>>>> value as the halting value as input P2 adapted from input P where all
>>>> calls to H have been replaced with calls to Simulate.
>>>>
>>>> We can see that on the basis of this corrected criteria the actual
>>>> Linz H would correctly decide not halting on the actual Linz Ĥ shown
>>>> on page 319.
>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>>>
>>>>
>>>>
>>>> Does the simulation of input P by simulating (at least partial) halt
>>>> decider H have to be stopped to prevent the infinite execution of P?
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Halts = Halts(P, P);
>>>> if (Input_Halts)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>> THIS IS A TRUISM:
>>>> If the simulation never needs to be stopped then we can swap
>>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that
>>>> the simulation must have needed to have been stopped at some point.
>>>>
>>>> http://www.liarparadox.org/
>>> Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
>>>
>>> You have not refuted Turing until your halt decider can cope with
>>> branching logic predicated on program state predicated on arbitrary
>>> program input.
>>>
>>> /Flibble
>>>
>>>
>> Your error is the same as this:
>> No one has cured any disease until they have cured every disease.
>
> Nope. I said the other month that I don't care about any schoolboy proofs
> that might be wrong; as far as the Halting Problem is concerned I only
> care about Turing's proof which you have failed to refute and will
> continue to fail to refute until you address the issues I describe. Your
> halting decider can only decide on a useless finite subset of problems
> that nobody cares about.
>
> /Flibble
>
With a complete set of non-halting behavior patterns this algorithm
solves the halting problem:
THIS IS A TRUISM:
When the behavior of the input Ĥ to simulating halt decider H
(a) correctly matches
(b) a correct non-halting behavior pattern
then H decides non-halting on Ĥ correctly.
I only provide one [infinitely_nested_simulation] behavior pattern that
correctly decides the simplest one of the conventional halting problem
instances. When this pattern is elaborated it decides all of the
conventional halting problem instances.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Mr Flibble <flibble@reddwarf.jmc> |
|---|---|
| Date | 2021-05-16 15:15 +0000 |
| Subject | Re: Refuting the halting problem proofs (solving the halting problem) |
| Message-ID | <rGaoI.510543$BpBb.277382@fx44.ams4> |
| In reply to | #33665 |
On Sun, 16 May 2021 09:22:47 -0500, olcott wrote:
> On 5/15/2021 6:28 PM, Mr Flibble wrote:
>> On Sat, 15 May 2021 18:23:21 -0500, olcott wrote:
>>
>>> On 5/15/2021 4:55 PM, Mr Flibble wrote:
>>>> On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
>>>>
>>>>> To overcome the pathological self-reference error of the
>>>>> conventional halting problem proofs we simply define halt decider H
>>>>> such that every input P to halt decider H that itself calls H has
>>>>> the same halting value as the halting value as input P2 adapted from
>>>>> input P where all calls to H have been replaced with calls to
>>>>> Simulate.
>>>>>
>>>>> We can see that on the basis of this corrected criteria the actual
>>>>> Linz H would correctly decide not halting on the actual Linz Ĥ shown
>>>>> on page 319.
>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>>>>
>>>>>
>>>>>
>>>>> Does the simulation of input P by simulating (at least partial) halt
>>>>> decider H have to be stopped to prevent the infinite execution of P?
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Halts = Halts(P, P);
>>>>> if (Input_Halts)
>>>>> HERE: goto HERE;
>>>>> }
>>>>>
>>>>> THIS IS A TRUISM:
>>>>> If the simulation never needs to be stopped then we can swap
>>>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that
>>>>> the simulation must have needed to have been stopped at some point.
>>>>>
>>>>> http://www.liarparadox.org/
>>>> Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
>>>>
>>>> You have not refuted Turing until your halt decider can cope with
>>>> branching logic predicated on program state predicated on arbitrary
>>>> program input.
>>>>
>>>> /Flibble
>>>>
>>>>
>>> Your error is the same as this:
>>> No one has cured any disease until they have cured every disease.
>>
>> Nope. I said the other month that I don't care about any schoolboy
>> proofs that might be wrong; as far as the Halting Problem is concerned
>> I only care about Turing's proof which you have failed to refute and
>> will continue to fail to refute until you address the issues I
>> describe. Your halting decider can only decide on a useless finite
>> subset of problems that nobody cares about.
>>
>> /Flibble
>>
>>
> With a complete set of non-halting behavior patterns this algorithm
> solves the halting problem:
>
> THIS IS A TRUISM:
> When the behavior of the input Ĥ to simulating halt decider H (a)
> correctly matches (b) a correct non-halting behavior pattern then H
> decides non-halting on Ĥ correctly.
>
> I only provide one [infinitely_nested_simulation] behavior pattern that
> correctly decides the simplest one of the conventional halting problem
> instances. When this pattern is elaborated it decides all of the
> conventional halting problem instances.
No, it doesn't, your extrapolation is false: but feel free to prove
otherwise without repeating the same old bullshit that doesn't address the
issues I describe. Until you refute Turing you haven't refuted anything
of substance.
/Flibble
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 10:19 -0500 |
| Subject | Re: Refuting the halting problem proofs (solving the halting problem) |
| Message-ID | <RtmdnfgmL8hTqjz9nZ2dnUU7-YudnZ2d@giganews.com> |
| In reply to | #33681 |
On 5/16/2021 10:15 AM, Mr Flibble wrote:
> On Sun, 16 May 2021 09:22:47 -0500, olcott wrote:
>
>> On 5/15/2021 6:28 PM, Mr Flibble wrote:
>>> On Sat, 15 May 2021 18:23:21 -0500, olcott wrote:
>>>
>>>> On 5/15/2021 4:55 PM, Mr Flibble wrote:
>>>>> On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
>>>>>
>>>>>> To overcome the pathological self-reference error of the
>>>>>> conventional halting problem proofs we simply define halt decider H
>>>>>> such that every input P to halt decider H that itself calls H has
>>>>>> the same halting value as the halting value as input P2 adapted from
>>>>>> input P where all calls to H have been replaced with calls to
>>>>>> Simulate.
>>>>>>
>>>>>> We can see that on the basis of this corrected criteria the actual
>>>>>> Linz H would correctly decide not halting on the actual Linz Ĥ shown
>>>>>> on page 319.
>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>>>>>
>>>>>>
>>>>>>
>>>>>> Does the simulation of input P by simulating (at least partial) halt
>>>>>> decider H have to be stopped to prevent the infinite execution of P?
>>>>>>
>>>>>> void H_Hat(u32 P)
>>>>>> {
>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>> if (Input_Halts)
>>>>>> HERE: goto HERE;
>>>>>> }
>>>>>>
>>>>>> THIS IS A TRUISM:
>>>>>> If the simulation never needs to be stopped then we can swap
>>>>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that
>>>>>> the simulation must have needed to have been stopped at some point.
>>>>>>
>>>>>> http://www.liarparadox.org/
>>>>> Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
>>>>>
>>>>> You have not refuted Turing until your halt decider can cope with
>>>>> branching logic predicated on program state predicated on arbitrary
>>>>> program input.
>>>>>
>>>>> /Flibble
>>>>>
>>>>>
>>>> Your error is the same as this:
>>>> No one has cured any disease until they have cured every disease.
>>>
>>> Nope. I said the other month that I don't care about any schoolboy
>>> proofs that might be wrong; as far as the Halting Problem is concerned
>>> I only care about Turing's proof which you have failed to refute and
>>> will continue to fail to refute until you address the issues I
>>> describe. Your halting decider can only decide on a useless finite
>>> subset of problems that nobody cares about.
>>>
>>> /Flibble
>>>
>>>
>> With a complete set of non-halting behavior patterns this algorithm
>> solves the halting problem:
>>
>> THIS IS A TRUISM:
>> When the behavior of the input Ĥ to simulating halt decider H (a)
>> correctly matches (b) a correct non-halting behavior pattern then H
>> decides non-halting on Ĥ correctly.
>>
>> I only provide one [infinitely_nested_simulation] behavior pattern that
>> correctly decides the simplest one of the conventional halting problem
>> instances. When this pattern is elaborated it decides all of the
>> conventional halting problem instances.
>
> No, it doesn't, your extrapolation is false: but feel free to prove
> otherwise without repeating the same old bullshit that doesn't address the
> issues I describe. Until you refute Turing you haven't refuted anything
> of substance.
>
> /Flibble
>
Truisms cannot be false.
>> THIS IS A TRUISM:
>> When the behavior of the input Ĥ to simulating halt decider H (a)
>> correctly matches (b) a correct non-halting behavior pattern then H
>> decides non-halting on Ĥ correctly.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-16 15:55 +0000 |
| Subject | Re: Refuting the halting problem proofs (solving the halting problem) |
| Message-ID | <20210516083841.659@kylheku.com> |
| In reply to | #33683 |
On 2021-05-16, olcott <NoOne@NoWhere.com> wrote:
> On 5/16/2021 10:15 AM, Mr Flibble wrote:
>> On Sun, 16 May 2021 09:22:47 -0500, olcott wrote:
>>
>>> On 5/15/2021 6:28 PM, Mr Flibble wrote:
>>>> On Sat, 15 May 2021 18:23:21 -0500, olcott wrote:
>>>>
>>>>> On 5/15/2021 4:55 PM, Mr Flibble wrote:
>>>>>> On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
>>>>>>
>>>>>>> To overcome the pathological self-reference error of the
>>>>>>> conventional halting problem proofs we simply define halt decider H
>>>>>>> such that every input P to halt decider H that itself calls H has
>>>>>>> the same halting value as the halting value as input P2 adapted from
>>>>>>> input P where all calls to H have been replaced with calls to
>>>>>>> Simulate.
>>>>>>>
>>>>>>> We can see that on the basis of this corrected criteria the actual
>>>>>>> Linz H would correctly decide not halting on the actual Linz Ĥ shown
>>>>>>> on page 319.
>>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>> Does the simulation of input P by simulating (at least partial) halt
>>>>>>> decider H have to be stopped to prevent the infinite execution of P?
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>>
>>>>>>> THIS IS A TRUISM:
>>>>>>> If the simulation never needs to be stopped then we can swap
>>>>>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that
>>>>>>> the simulation must have needed to have been stopped at some point.
>>>>>>>
>>>>>>> http://www.liarparadox.org/
>>>>>> Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
>>>>>>
>>>>>> You have not refuted Turing until your halt decider can cope with
>>>>>> branching logic predicated on program state predicated on arbitrary
>>>>>> program input.
>>>>>>
>>>>>> /Flibble
>>>>>>
>>>>>>
>>>>> Your error is the same as this:
>>>>> No one has cured any disease until they have cured every disease.
>>>>
>>>> Nope. I said the other month that I don't care about any schoolboy
>>>> proofs that might be wrong; as far as the Halting Problem is concerned
>>>> I only care about Turing's proof which you have failed to refute and
>>>> will continue to fail to refute until you address the issues I
>>>> describe. Your halting decider can only decide on a useless finite
>>>> subset of problems that nobody cares about.
>>>>
>>>> /Flibble
>>>>
>>>>
>>> With a complete set of non-halting behavior patterns this algorithm
>>> solves the halting problem:
>>>
>>> THIS IS A TRUISM:
>>> When the behavior of the input Ĥ to simulating halt decider H (a)
>>> correctly matches (b) a correct non-halting behavior pattern then H
>>> decides non-halting on Ĥ correctly.
>>>
>>> I only provide one [infinitely_nested_simulation] behavior pattern that
>>> correctly decides the simplest one of the conventional halting problem
>>> instances. When this pattern is elaborated it decides all of the
>>> conventional halting problem instances.
>>
>> No, it doesn't, your extrapolation is false: but feel free to prove
>> otherwise without repeating the same old bullshit that doesn't address the
>> issues I describe. Until you refute Turing you haven't refuted anything
>> of substance.
>>
>> /Flibble
>>
>
> Truisms cannot be false.
Truisms can be irrelevant.
A truism can be the premise in an invalid argument.
The argument "If P, then Q" is invalid whenever P is true and Q is
false.
If P is readily recognized as a truism, that only makes it easier
to recognize that the argument is invalid, since then only the
falsehood of Q needs to be considered.
> >> THIS IS A TRUISM:
> >> When the behavior of the input Ĥ to simulating halt decider H (a)
> >> correctly matches (b) a correct non-halting behavior pattern then H
> >> decides non-halting on Ĥ correctly.
Your truism is true regardless of how you define "correctly" mand
"correct non-halting pattern".
Your truism holds, for instance, if we define correctly as "the number
42 occurs the execution of the simulated function".
If Halts sees that the function has calculated 42, and aborts it, it has
correctly matched the non-halting behavior pattern. Because that is what
we have *defined* as correct, it has decided non-halting correctly, by
our definition.
The problem with your truism is that the real halting problem does not
have a correct, universal pattern for deciding actual halting.
There is no such thing, period.
Therefore, if your truism is supposed to be able the real halting
problem, it contains a vacuous truth, because it really says this:
When the behavior of the input Ĥ to simulating halt decider H (a)
correctly matches (b) a correct non-halting behavior pattern,
CHOSEN FROM AN EMPTY SET OF SUCH CORRECT PATTERNS SINCE THEY PROVABLY
DON'T EXIST, then H decides non-halting on Ĥ correctly.
We then observe that your truism has the pattern "When {condition}, then
{result}", but {condition} never arrives.
Here is a similar truism:
When Olcott publishes a solution to the halting problem, he will be a
famous name CS/math circles.
Irrefutably true, except for the tiny detail that it will never happen.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-16 13:11 -0400 |
| Subject | Re: Refuting the halting problem proofs (solving the halting problem) |
| Message-ID | <incoI.51064$mO3.7761@fx09.iad> |
| In reply to | #33683 |
On 5/16/21 11:19 AM, olcott wrote:
> On 5/16/2021 10:15 AM, Mr Flibble wrote:
>> On Sun, 16 May 2021 09:22:47 -0500, olcott wrote:
>>
>>> On 5/15/2021 6:28 PM, Mr Flibble wrote:
>>>> On Sat, 15 May 2021 18:23:21 -0500, olcott wrote:
>>>>
>>>>> On 5/15/2021 4:55 PM, Mr Flibble wrote:
>>>>>> On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
>>>>>>
>>>>>>> To overcome the pathological self-reference error of the
>>>>>>> conventional halting problem proofs we simply define halt decider H
>>>>>>> such that every input P to halt decider H that itself calls H has
>>>>>>> the same halting value as the halting value as input P2 adapted from
>>>>>>> input P where all calls to H have been replaced with calls to
>>>>>>> Simulate.
>>>>>>>
>>>>>>> We can see that on the basis of this corrected criteria the actual
>>>>>>> Linz H would correctly decide not halting on the actual Linz Ĥ shown
>>>>>>> on page 319.
>>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>> Does the simulation of input P by simulating (at least partial) halt
>>>>>>> decider H have to be stopped to prevent the infinite execution of P?
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>>
>>>>>>> THIS IS A TRUISM:
>>>>>>> If the simulation never needs to be stopped then we can swap
>>>>>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that
>>>>>>> the simulation must have needed to have been stopped at some point.
>>>>>>>
>>>>>>> http://www.liarparadox.org/
>>>>>> Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
>>>>>>
>>>>>> You have not refuted Turing until your halt decider can cope with
>>>>>> branching logic predicated on program state predicated on arbitrary
>>>>>> program input.
>>>>>>
>>>>>> /Flibble
>>>>>>
>>>>>>
>>>>> Your error is the same as this:
>>>>> No one has cured any disease until they have cured every disease.
>>>>
>>>> Nope. I said the other month that I don't care about any schoolboy
>>>> proofs that might be wrong; as far as the Halting Problem is concerned
>>>> I only care about Turing's proof which you have failed to refute and
>>>> will continue to fail to refute until you address the issues I
>>>> describe. Your halting decider can only decide on a useless finite
>>>> subset of problems that nobody cares about.
>>>>
>>>> /Flibble
>>>>
>>>>
>>> With a complete set of non-halting behavior patterns this algorithm
>>> solves the halting problem:
>>>
>>> THIS IS A TRUISM:
>>> When the behavior of the input Ĥ to simulating halt decider H (a)
>>> correctly matches (b) a correct non-halting behavior pattern then H
>>> decides non-halting on Ĥ correctly.
>>>
>>> I only provide one [infinitely_nested_simulation] behavior pattern that
>>> correctly decides the simplest one of the conventional halting problem
>>> instances. When this pattern is elaborated it decides all of the
>>> conventional halting problem instances.
>>
>> No, it doesn't, your extrapolation is false: but feel free to prove
>> otherwise without repeating the same old bullshit that doesn't address
>> the
>> issues I describe. Until you refute Turing you haven't refuted anything
>> of substance.
>>
>> /Flibble
>>
>
> Truisms cannot be false.
>>> THIS IS A TRUISM:
>>> When the behavior of the input Ĥ to simulating halt decider H (a)
>>> correctly matches (b) a correct non-halting behavior pattern then H
>>> decides non-halting on Ĥ correctly.
>
But you fail at CORRECTLY matching a CORRECT non-halting behavior.
By DEFINITIONS, one of these must be wrong for H_Hat(H_Hat) since
H_Hat(H_Hat) is shown to be Halting.
Yes, it IS a truism that a correct set of logic will get the correct
answer, but you don't get to define correct in a way that tries to makse
something that IS false, true.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-05-15 19:37 -0400 |
| Message-ID | <GWYnI.600803$%W6.135309@fx44.iad> |
| In reply to | #33648 |
On 5/15/21 7:23 PM, olcott wrote:
> On 5/15/2021 4:55 PM, Mr Flibble wrote:
>> On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
>>
>>> To overcome the pathological self-reference error of the conventional
>>> halting problem proofs we simply define halt decider H such that every
>>> input P to halt decider H that itself calls H has the same halting value
>>> as the halting value as input P2 adapted from input P where all calls to
>>> H have been replaced with calls to Simulate.
>>>
>>> We can see that on the basis of this corrected criteria the actual Linz
>>> H would correctly decide not halting on the actual Linz Ĥ shown on page
>>> 319. http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>>
>>>
>>>
>>> Does the simulation of input P by simulating (at least partial) halt
>>> decider H have to be stopped to prevent the infinite execution of P?
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Halts = Halts(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>>
>>> THIS IS A TRUISM:
>>> If the simulation never needs to be stopped then we can swap
>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that the
>>> simulation must have needed to have been stopped at some point.
>>>
>>> http://www.liarparadox.org/
>> Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
>>
>> You have not refuted Turing until your halt decider can cope with
>> branching logic predicated on program state predicated on arbitrary
>> program input.
>>
>> /Flibble
>>
>
> Your error is the same as this:
> No one has cured any disease until they have cured every disease.
>
Actually, in your case you haven't cured ANY disease, because you are
working on the wrong patient.
[toc] | [prev] | [next] | [standalone]
Page 1 of 3 [1] 2 3 Next page →
Back to top | Article view | comp.theory
csiph-web