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 2 of 3 — ← Prev page 1 [2] 3 Next page →
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2021-05-16 05:57 +0200 |
| Message-ID | <s7q57n$16l$1@dont-email.me> |
| In reply to | #33635 |
STOP POSTING in comp.lang.c/c++ !!!
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-15 23:29 -0500 |
| Message-ID | <Q4ydnXY_iMvlAj39nZ2dnUU7-SHNnZ2d@giganews.com> |
| In reply to | #33660 |
On 5/15/2021 10:57 PM, Bonita Montero wrote: > STOP POSTING in comp.lang.c/c++ !!! No -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2021-05-16 10:11 +0200 |
| Message-ID | <s7qk4b$geg$1@dont-email.me> |
| In reply to | #33661 |
>> STOP POSTING in comp.lang.c/c++ !!! > No You don't post anything related specifically to C or C++, so stop postingg here.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 08:43 -0500 |
| Subject | Re: Refuting the halting problem proofs (in C) |
| Message-ID | <yrmdnRVJvq2jvDz9nZ2dnUU7-d3NnZ2d@giganews.com> |
| In reply to | #33664 |
On 5/16/2021 3:11 AM, Bonita Montero wrote:
>
>>> STOP POSTING in comp.lang.c/c++ !!!
>
>> No
>
> You don't post anything related specifically to C or C++,
> so stop postingg here.
>
Everything that I post to is directly related to the correctness of
the following C code: (executed in the x86utm OS written in C and C++)
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
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.
Halts returns 0 on the basis that the behavior of H_Hat matches
the [infinitely_nested_simulation] not halting behavior pattern.
If the above C code is correct then this proves that all
the conventional halting problem instances can be decided
as not halting. The following is from Peter Linz:
Ĥ.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
--
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:16 +0000 |
| Subject | Re: Refuting the halting problem proofs (in C) |
| Message-ID | <20210516080846.323@kylheku.com> |
| In reply to | #33669 |
On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: > On 5/16/2021 3:11 AM, Bonita Montero wrote: >> >>>> STOP POSTING in comp.lang.c/c++ !!! >> >>> No >> >> You don't post anything related specifically to C or C++, >> so stop postingg here. >> > > Everything that I post to is directly related to the correctness of > the following C code It's not related to its correctness in terms of language use. comp.lang.c is intended for C language usage discussions. It is very oriented toward standard, ISO-C-conforming language usage. You do not have questions about the C language. Your program isn't portable, standard C, and you don't even care about that aspect, which is the only aspect comp.lang.c cares about. You're simply abusing that newsgroup. Your goal seems to be to get as many people to despise you as possible. Some people refuse to despise others merely because of stupidity, so you're working for it by adding rudeness to you arsenal.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 10:25 -0500 |
| Subject | Re: Refuting the halting problem proofs (in C) |
| Message-ID | <2N2dncgpnKumpDz9nZ2dnUU7-SHNnZ2d@giganews.com> |
| In reply to | #33682 |
On 5/16/2021 10:16 AM, Kaz Kylheku wrote: > On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >> On 5/16/2021 3:11 AM, Bonita Montero wrote: >>> >>>>> STOP POSTING in comp.lang.c/c++ !!! >>> >>>> No >>> >>> You don't post anything related specifically to C or C++, >>> so stop postingg here. >>> >> >> Everything that I post to is directly related to the correctness of >> the following C code > > It's not related to its correctness in terms of language use. > > comp.lang.c is intended for C language usage discussions. It is very > oriented toward standard, ISO-C-conforming language usage. > > You do not have questions about the C language. Your program isn't > portable, standard C, and you don't even care about that aspect, > which is the only aspect comp.lang.c cares about. > > You're simply abusing that newsgroup. > I must have an archival backup of my key posts in an active group of the next most related group to the subject matter being discussed. I make these cross-posts very infrequently and I always have followup to comp.theory. > Your goal seems to be to get as many people to despise you as possible. > > Some people refuse to despise others merely because of stupidity, so > you're working for it by adding rudeness to you arsenal. > -- 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:57 +0000 |
| Subject | Re: Refuting the halting problem proofs (in C) |
| Message-ID | <20210516085511.754@kylheku.com> |
| In reply to | #33684 |
On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: > On 5/16/2021 10:16 AM, Kaz Kylheku wrote: >> On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >> You're simply abusing that newsgroup. >> > > I must have an archival backup of my key posts in an active group of the > next most related group to the subject matter being discussed. You don't seem to understand that Usenet articlews are objects that are just tagged with newsgroups via the Newsgroups: property that is permitted to contain multiple entries. An article with five such entries is no more "backed up" than one with one entry. It's still just one object. In any case, using a discussion newsgroup for data backup of any kind is flagrant abuse. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2021-05-16 18:28 +0200 |
| Subject | Re: Refuting the halting problem proofs (in C) |
| Message-ID | <s7rh6n$77n$1@dont-email.me> |
| In reply to | #33684 |
> I make these cross-posts very infrequently and I always have followup to > comp.theory. You make them day by day and your issues are not related specifically to C or C++ but apply to most programming languages. So stop posting in comp.lang.c/c++.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 10:53 -0500 |
| Subject | Re: Refuting the halting problem proofs (in C) |
| Message-ID | <uYWdnXUpXYVLojz9nZ2dnUU7-dfNnZ2d@giganews.com> |
| In reply to | #33682 |
On 5/16/2021 10:16 AM, Kaz Kylheku wrote: > On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >> On 5/16/2021 3:11 AM, Bonita Montero wrote: >>> >>>>> STOP POSTING in comp.lang.c/c++ !!! >>> >>>> No >>> >>> You don't post anything related specifically to C or C++, >>> so stop postingg here. >>> >> >> Everything that I post to is directly related to the correctness of >> the following C code > > It's not related to its correctness in terms of language use. > > comp.lang.c is intended for C language usage discussions. It is very > oriented toward standard, ISO-C-conforming language usage. > > You do not have questions about the C language. Your program isn't > portable, standard C, and you don't even care about that aspect, > which is the only aspect comp.lang.c cares about. > > You're simply abusing that newsgroup. It is getting to the point where all rebuttals are becoming decreasingly less plausible. We are almost at the point where all rebuttals are insufficiently plausible. Some time shortly after this point I will probably not need to post to USENET at all. -- 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:58 +0000 |
| Subject | Re: Refuting the halting problem proofs (in C) |
| Message-ID | <20210516085804.695@kylheku.com> |
| In reply to | #33685 |
On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: > It is getting to the point where all rebuttals are becoming decreasingly > less plausible. How so, when your arguments are exactly the same as years ago, and so are the rebuttals? -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 11:23 -0500 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <_6KdnYZyYsZ82zz9nZ2dnUU7-QHNnZ2d@giganews.com> |
| In reply to | #33688 |
On 5/16/2021 10:58 AM, Kaz Kylheku wrote: > On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >> It is getting to the point where all rebuttals are becoming decreasingly >> less plausible. > > How so, when your arguments are exactly the same as years ago, > and so are the rebuttals? > 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. All of the halting problem instances match the [infinitely_nested_simulation] non-halting behavior pattern. 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] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-05-16 17:26 +0000 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <20210516102405.586@kylheku.com> |
| In reply to | #33690 |
On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: > On 5/16/2021 10:58 AM, Kaz Kylheku wrote: >> On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >>> It is getting to the point where all rebuttals are becoming decreasingly >>> less plausible. >> >> How so, when your arguments are exactly the same as years ago, >> and so are the rebuttals? >> > > 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. 1. It's a truism for arbitrary definitions of "correct" which have nothing to do with halting. 2. It's a truism for impossible definitions of "correct", related to the real halting problem. There do not *exist* universal non-halting behavior patterns which decide halting, yet if that is the definition of "correct", we still have a truism. A truism whose "When" will never come. This is a truism also: "When Olcott solves the halting probelm he will be famous in CS/Math circles." Yet that will happen happen, truism be damned.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 13:33 -0500 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <CrWdnTxrFr2p-Dz9nZ2dnUU7-bfNnZ2d@giganews.com> |
| In reply to | #33698 |
On 5/16/2021 12:26 PM, Kaz Kylheku wrote: > On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >> On 5/16/2021 10:58 AM, Kaz Kylheku wrote: >>> On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >>>> It is getting to the point where all rebuttals are becoming decreasingly >>>> less plausible. >>> >>> How so, when your arguments are exactly the same as years ago, >>> and so are the rebuttals? >>> >> >> 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. > > 1. It's a truism for arbitrary definitions of "correct" which have > nothing to do with halting. > > 2. It's a truism for impossible definitions of "correct", related to the > real halting problem. There do not *exist* universal non-halting > behavior patterns which decide halting, yet if that is the definition > of "correct", we still have a truism. A truism whose "When" will > never come. > > This is a truism also: > > "When Olcott solves the halting probelm he will be famous in CS/Math > circles." > > Yet that will happen happen, truism be damned. > You are certainly smart enough to know that the exact Peter Linz Ĥ does correctly match an [infinitely_nested_simulation] non-halting behavior pattern on itself as input for every simulating halt decider. I knew this over four years ago yet no one wanted to listen: Infinitely Recursive input on HP Proofs peteolcott comp.theory Mar 11, 2017, 3:13:03 PM https://groups.google.com/g/comp.theory/c/NcFS02hKs1U/m/PlBF-1LRBAAJ http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf (see page 5 for a refresher if needed) http://www.liarparadox.org/Halting_problem_undecidability_and_infinitely_nested_simulation.pdf Are you claiming that you do not understand that the original Peter Linz Ĥ(Ĥ) specifies a [infinitely_nested_simulation] non-halting behavior pattern on to every simulating halt decider. -- 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 18:54 +0000 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <20210516115335.730@kylheku.com> |
| In reply to | #33703 |
On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: > Are you claiming that you do not understand that the original Peter Linz > Ĥ(Ĥ) specifies a [infinitely_nested_simulation] non-halting behavior > pattern on to every simulating halt decider. An infinitely nested simulation is something that does not terminate, and therefore does not decide.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 14:19 -0500 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <6_udnXE6a_pl8jz9nZ2dnUU7-R3NnZ2d@giganews.com> |
| In reply to | #33707 |
On 5/16/2021 1:54 PM, Kaz Kylheku wrote: > On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >> Are you claiming that you do not understand that the original Peter Linz >> Ĥ(Ĥ) specifies a [infinitely_nested_simulation] non-halting behavior >> pattern on to every simulating halt decider. > > An infinitely nested simulation is something that does not terminate, > and therefore does not decide. > We need to following definition of non-halting behavior to unravel the pathological self-reference error of the halting problem instances. On 5/11/2021 11:10 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> Truism: >> Every simulation that would never stop unless Halts() stops >> it at some point specifies infinite execution. > > Any algorithm that implements this truism is, of course, a halting > decider. 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. As long as a computation must have any part of its simulation terminated at any point in this simulation then the entire computation specifies non-halting behavior. -- 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 16:09 -0400 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <KZeoI.117061$9F5.96845@fx43.iad> |
| In reply to | #33712 |
On 5/16/21 3:19 PM, olcott wrote: > On 5/16/2021 1:54 PM, Kaz Kylheku wrote: >> On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >>> Are you claiming that you do not understand that the original Peter Linz >>> Ĥ(Ĥ) specifies a [infinitely_nested_simulation] non-halting behavior >>> pattern on to every simulating halt decider. >> >> An infinitely nested simulation is something that does not terminate, >> and therefore does not decide. >> > > We need to following definition of non-halting behavior to unravel the > pathological self-reference error of the halting problem instances. > > On 5/11/2021 11:10 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> Truism: >>> Every simulation that would never stop unless Halts() stops >>> it at some point specifies infinite execution. >> >> Any algorithm that implements this truism is, of course, a halting >> decider. > > 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. > > As long as a computation must have any part of its simulation terminated > at any point in this simulation then the entire computation specifies > non-halting behavior. > > i.e. you need an incorrect definition of non-halting to do your deed. You need to some how lie and call some halting computations as non-halting. As I pointed out elsewhere, this also makes the definition of the non-halting of a computation dependent on the decider being used to decide it, which is illogical.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 15:17 -0500 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <HcKdnZouhfAO4Dz9nZ2dnUU7-InNnZ2d@giganews.com> |
| In reply to | #33719 |
On 5/16/2021 3:09 PM, Richard Damon wrote: > On 5/16/21 3:19 PM, olcott wrote: >> On 5/16/2021 1:54 PM, Kaz Kylheku wrote: >>> On 2021-05-16, olcott <NoOne@NoWhere.com> wrote: >>>> Are you claiming that you do not understand that the original Peter Linz >>>> Ĥ(Ĥ) specifies a [infinitely_nested_simulation] non-halting behavior >>>> pattern on to every simulating halt decider. >>> >>> An infinitely nested simulation is something that does not terminate, >>> and therefore does not decide. >>> >> >> We need to following definition of non-halting behavior to unravel the >> pathological self-reference error of the halting problem instances. >> >> On 5/11/2021 11:10 AM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> Truism: >>>> Every simulation that would never stop unless Halts() stops >>>> it at some point specifies infinite execution. >>> >>> Any algorithm that implements this truism is, of course, a halting >>> decider. >> >> 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. >> >> As long as a computation must have any part of its simulation terminated >> at any point in this simulation then the entire computation specifies >> non-halting behavior. >> >> > i.e. you need an incorrect definition of non-halting to do your deed. > You need to some how lie and call some halting computations as non-halting. > > As I pointed out elsewhere, this also makes the definition of the > non-halting of a computation dependent on the decider being used to > decide it, which is illogical. > The halt decider is able to decide the halting problem instances as non-halting because the [infinitely_nested_simulation] non-halting behavior pattern is matched. It doesn't matter how or why this pattern is matched. -- 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 16:42 -0400 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <atfoI.368575$2A5.78195@fx45.iad> |
| In reply to | #33720 |
On 5/16/21 4:17 PM, olcott wrote: > On 5/16/2021 3:09 PM, Richard Damon wrote: > i.e. you need an incorrect definition of non-halting to do your deed. >> You need to some how lie and call some halting computations as >> non-halting. >> >> As I pointed out elsewhere, this also makes the definition of the >> non-halting of a computation dependent on the decider being used to >> decide it, which is illogical. >> > > The halt decider is able to decide the halting problem instances as > non-halting because the [infinitely_nested_simulation] non-halting > behavior pattern is matched. It doesn't matter how or why this pattern > is matched. > > And that pattern is proved incorrect or incorrectly matched as H_Hat(H_Hat) is shown to be Halting. You CAN'T prove a falsehood by just claiming it is true. The Halt Decider is thus also proved wrong as its answer doesn't match the one right answer for the machine, Halting. Your WHOLE argument is GIGO. (look it up, it is a standard Software Engineering principle).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-05-16 16:20 -0500 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <eZWdnQIIS8TBETz9nZ2dnUU7-eudnZ2d@giganews.com> |
| In reply to | #33724 |
On 5/16/2021 3:42 PM, Richard Damon wrote: > On 5/16/21 4:17 PM, olcott wrote: >> On 5/16/2021 3:09 PM, Richard Damon wrote: >> i.e. you need an incorrect definition of non-halting to do your deed. >>> You need to some how lie and call some halting computations as >>> non-halting. >>> >>> As I pointed out elsewhere, this also makes the definition of the >>> non-halting of a computation dependent on the decider being used to >>> decide it, which is illogical. >>> >> >> The halt decider is able to decide the halting problem instances as >> non-halting because the [infinitely_nested_simulation] non-halting >> behavior pattern is matched. It doesn't matter how or why this pattern >> is matched. >> >> > > And that pattern is proved incorrect or incorrectly matched as > H_Hat(H_Hat) is shown to be Halting. > > You CAN'T prove a falsehood by just claiming it is true. > > The Halt Decider is thus also proved wrong as its answer doesn't match > the one right answer for the machine, Halting. > > Your WHOLE argument is GIGO. (look it up, it is a standard Software > Engineering principle). > On 5/11/2021 11:10 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> Truism: >> Every simulation that would never stop unless Halts() stops >> it at some point specifies infinite execution. > > Any algorithm that implements this truism is, of course, a halting > decider. When the above is understood to be a truism then and only then does one have sufficient technical knowledge to evaluate my proof. -- 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 17:30 -0400 |
| Subject | Re: Refuting the halting problem proofs [ succinct refutation ] |
| Message-ID | <2agoI.368579$2A5.5936@fx45.iad> |
| In reply to | #33726 |
On 5/16/21 5:20 PM, olcott wrote: > On 5/16/2021 3:42 PM, Richard Damon wrote: >> On 5/16/21 4:17 PM, olcott wrote: >>> On 5/16/2021 3:09 PM, Richard Damon wrote: >>> i.e. you need an incorrect definition of non-halting to do your deed. >>>> You need to some how lie and call some halting computations as >>>> non-halting. >>>> >>>> As I pointed out elsewhere, this also makes the definition of the >>>> non-halting of a computation dependent on the decider being used to >>>> decide it, which is illogical. >>>> >>> >>> The halt decider is able to decide the halting problem instances as >>> non-halting because the [infinitely_nested_simulation] non-halting >>> behavior pattern is matched. It doesn't matter how or why this pattern >>> is matched. >>> >>> >> >> And that pattern is proved incorrect or incorrectly matched as >> H_Hat(H_Hat) is shown to be Halting. >> >> You CAN'T prove a falsehood by just claiming it is true. >> >> The Halt Decider is thus also proved wrong as its answer doesn't match >> the one right answer for the machine, Halting. >> >> Your WHOLE argument is GIGO. (look it up, it is a standard Software >> Engineering principle). >> > > On 5/11/2021 11:10 AM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> Truism: >>> Every simulation that would never stop unless Halts() stops >>> it at some point specifies infinite execution. >> >> Any algorithm that implements this truism is, of course, a halting >> decider. > > When the above is understood to be a truism then and only then does one > have sufficient technical knowledge to evaluate my proof. > Any when you understand the falsehood in your 'truism' you might understand where you logic fails. Since H_Hat(H_Hat) is PROVED to be a Halting Computation (when the Halt Decider it is built on returns non-halting for H_Hat,H_Hat), the answer from ANY Halting Decider must be Halting or it is wrong. THIS is a real Truism: The right answer from a Halting Decider for a Computation that Halts is Halting.
[toc] | [prev] | [next] | [standalone]
Page 2 of 3 — ← Prev page 1 [2] 3 Next page →
Back to top | Article view | comp.theory
csiph-web