Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.software-eng > #2795
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
|---|---|
| Newsgroups | comp.theory, comp.ai.philosophy, comp.software-eng, sci.math |
| References | (19 earlier) <3OAvI.5775$9q1.1461@fx09.iad> <lu-dnV-sVaz1RyP9nZ2dnUU7-N3NnZ2d@giganews.com> <6bBvI.11156$e21.9770@fx02.iad> <xvGdnS_luLwdfiP9nZ2dnUU7-SnNnZ2d@giganews.com> <NABvI.15536$341.10132@fx42.iad> |
| From | olcott <NoOne@NoWhere.com> |
| Date | 2021-06-07 22:41 -0500 |
| Message-ID | <GdednRmMDph2eyP9nZ2dnUU7-RfNnZ2d@giganews.com> (permalink) |
Cross-posted to 4 groups.
On 6/7/2021 10:36 PM, Richard Damon wrote: > On 6/7/21 11:27 PM, olcott wrote: >> On 6/7/2021 10:08 PM, Richard Damon wrote: >>> On 6/7/21 10:48 PM, olcott wrote: >>>> All that I have shown is that the conventional halting problem proofs do >>>> not prove that all inputs cannot be divided into those that halt and >>>> those that would not halt unless their simulation was aborted. >>> >>> Except that H_Hat belongs to Both, as it DOES Halt, and if you use a >>> different halt decider than this H, but some alternate version, THAT one >>> will correctly decide it to be Halting. >>> >>> Thus you division is inconsistent. >> >> No invocation of H_Hat() ever halts unless some H_Hat() has had its >> simulation aborted. >> >> Here is the appropriate analogy: >> Infinite recursion that is cut off because one of its otherwise >> infinitely recursive calls was stopped must still be construed as >> infinite recursion for the entire chain of calls. >> >> > > BUT, SINCE H Does abort its simulation, H_Hat does Halt, so H was wrong. When H aborts the simulation of an infinite loop H is correct. When H aborts the simulation of infinite recursion no matter which recursive call it aborts it correctly decides that the whole call chain was infinitely recursive. It is the same thing with H_Hat(H_Hat). -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
Back to comp.software-eng | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-01 10:25 -0500
Would H_Hat ever stop if simulating halt decider H never stopped simulating it? olcott <NoOne@NoWhere.com> - 2021-06-02 22:08 -0500
Re: Refuting the Linz Halting Problem Proof (V15)(top reviewer list) olcott <NoOne@NoWhere.com> - 2021-06-04 11:14 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 21:56 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-07 22:41 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-08 21:03 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) olcott <NoOne@NoWhere.com> - 2021-06-10 14:58 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) olcott <NoOne@NoWhere.com> - 2021-06-10 15:49 -0500
csiph-web