Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #34384 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-06-01 10:25 -0500 |
| Last post | 2021-06-02 20:26 -0400 |
| Articles | 20 on this page of 162 — 8 participants |
Back to article view | Back to comp.theory
Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-01 10:25 -0500
Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-01 19:07 -0400
Re: Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-01 18:16 -0500
Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-01 21:24 -0400
Re: Refuting the Sipser Halting Problem Proof (V1) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-01 18:30 -0700
Re: Refuting the Sipser Halting Problem Proof (V1) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-01 18:31 -0700
Re: Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-01 21:41 -0500
Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-01 23:24 -0400
Re: Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-01 23:03 -0500
Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 06:52 -0400
Re: Refuting the Sipser Halting Problem Proof (V1) olcott <NoOne@NoWhere.com> - 2021-06-02 11:08 -0500
Re: Refuting the Sipser Halting Problem Proof (V1) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 20:18 -0400
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-01 21:27 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-01 22:55 -0400
Refuting the Linz Halting Problem Proof(not bright enough) olcott <NoOne@NoWhere.com> - 2021-06-01 22:20 -0500
Re: Refuting the Linz Halting Problem Proof(not bright enough)(typo) olcott <NoOne@NoWhere.com> - 2021-06-01 22:31 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-01 22:25 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 06:59 -0400
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-02 13:32 +0100
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 09:40 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 20:20 -0400
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 19:52 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 21:14 -0400
Re: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?) olcott <NoOne@NoWhere.com> - 2021-06-02 20:46 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 22:47 -0400
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: Would H_Hat ever stop if simulating halt decider H never stopped simulating it? Richard Damon <Richard@Damon-Family.org> - 2021-06-03 07:14 -0400
Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it? olcott <NoOne@NoWhere.com> - 2021-06-03 08:31 -0500
Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it? Richard Damon <Richard@Damon-Family.org> - 2021-06-03 21:27 -0400
Re: Would H_Hat ever stop if simulating halt decider H never stopped simulating it? olcott <NoOne@NoWhere.com> - 2021-06-03 20:35 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(Is Ben smart?) Andy Walker <anw@cuboid.co.uk> - 2021-06-03 11:49 +0100
Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-03 08:22 -0500
Re: Halting problem undecidability and infinitely nested simulation(V13) - Andy Walker <anw@cuboid.co.uk> - 2021-06-04 15:16 +0100
Re: Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-04 09:39 -0500
Re: Halting problem undecidability and infinitely nested simulation(V13) - Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-04 08:59 -0700
Re: Halting problem undecidability and infinitely nested simulation(V13) - Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-04 17:35 +0100
Re: Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-04 11:38 -0500
Re: Halting problem undecidability and infinitely nested simulation(V13) - Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-05 03:36 -0700
Re: Halting problem undecidability and infinitely nested simulation(V13) - Andy Walker <anw@cuboid.co.uk> - 2021-06-05 12:53 +0100
Re: Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-05 08:13 -0500
Re: Halting problem undecidability and infinitely nested simulation(V13) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 11:14 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 10:34 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 12:13 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 11:20 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 15:17 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 14:36 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 18:32 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 18:57 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 20:26 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 19:42 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 21:45 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-05 20:53 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-06 15:34 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-06 14:39 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-06 15:59 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) - olcott <NoOne@NoWhere.com> - 2021-06-06 17:40 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) - Richard Damon <Richard@Damon-Family.org> - 2021-06-06 19:05 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 18:17 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 19:52 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 19:05 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 20:40 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 20:24 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 21:51 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 21:03 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 22:32 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 21:45 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-06 23:15 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-06 22:23 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 07:58 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-07 14:28 +0100
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 09:01 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 09:07 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 20:56 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 20:44 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 21:56 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 21:18 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 22:42 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 21:48 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 23:08 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-07 22:27 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 23:36 -0400
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) Richard Damon <Richard@Damon-Family.org> - 2021-06-08 07:25 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-08 08:25 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-08 21:17 -0400
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)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-08 22:36 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-08 21:49 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-08 23:06 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-08 22:24 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-09 07:05 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-09 09:31 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-09 21:13 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-09 22:27 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-09 21:31 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 06:24 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 06:42 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-06-10 12:10 -0700
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
Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-06-10 20:39 -0700
Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) olcott <NoOne@NoWhere.com> - 2021-06-10 23:40 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-06-11 10:36 -0700
Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) olcott <NoOne@NoWhere.com> - 2021-06-11 12:47 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 18:44 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 17:54 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 19:07 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 19:21 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 20:58 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 20:40 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 21:59 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 21:24 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 22:44 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 20:57 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-10 22:30 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-10 21:45 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Richard Damon <Richard@Damon-Family.org> - 2021-06-09 22:01 -0400
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-09 14:34 +0100
Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) olcott <NoOne@NoWhere.com> - 2021-06-09 09:36 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-08 03:26 +0100
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-07 21:42 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Andy Walker <anw@cuboid.co.uk> - 2021-06-08 15:02 +0100
Re: Halting problem undecidability and infinitely nested simulation(V17) olcott <NoOne@NoWhere.com> - 2021-06-08 09:14 -0500
Re: Halting problem undecidability and infinitely nested simulation(V17) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 22:45 -0400
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) Richard Damon <Richard@Damon-Family.org> - 2021-06-07 23:12 -0400
Re: Halting problem undecidability and infinitely nested simulation(V13) - olcott <NoOne@NoWhere.com> - 2021-06-05 08:00 -0500
Re: Halting problem undecidability and infinitely nested simulation(V13) - Richard Damon <Richard@Damon-Family.org> - 2021-06-05 12:19 -0400
Re: Halting problem undecidability and infinitely nested simulation(V13) - Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-05 21:42 +0100
Re: Halting problem undecidability and infinitely nested simulation(V16) olcott <NoOne@NoWhere.com> - 2021-06-05 15:55 -0500
Re: Halting problem undecidability and infinitely nested simulation(V16) Richard Damon <Richard@Damon-Family.org> - 2021-06-05 18:57 -0400
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 20:15 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 21:45 -0400
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 20:48 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 22:50 -0400
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) André G. Isaak <agisaak@gm.invalid> - 2021-06-02 21:11 -0600
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 22:16 -0500
Re: Refuting the Linz Halting Problem Proof (V?) olcott <NoOne@NoWhere.com> - 2021-06-02 22:51 -0500
Re: Refuting the Linz Halting Problem Proof (V?) Richard Damon <Richard@Damon-Family.org> - 2021-06-03 07:19 -0400
Re: Refuting the Linz Halting Problem Proof (V?) olcott <NoOne@NoWhere.com> - 2021-06-03 08:46 -0500
Re: Refuting the Linz Halting Problem Proof (V?) Richard Damon <Richard@Damon-Family.org> - 2021-06-03 21:39 -0400
Re: Refuting the Linz Halting Problem Proof (V?) olcott <NoOne@NoWhere.com> - 2021-06-03 20:51 -0500
Re: Refuting the Linz Halting Problem Proof (V?) Richard Damon <Richard@Damon-Family.org> - 2021-06-03 22:09 -0400
Re: Refuting the Linz Halting Problem Proof (V15) olcott <NoOne@NoWhere.com> - 2021-06-03 21:29 -0500
Re: Refuting the Linz Halting Problem Proof (V15) Richard Damon <Richard@Damon-Family.org> - 2021-06-03 22:59 -0400
Re: Refuting the Linz Halting Problem Proof (V15) olcott <NoOne@NoWhere.com> - 2021-06-03 22:37 -0500
Re: Refuting the Linz Halting Problem Proof (V15) Richard Damon <Richard@Damon-Family.org> - 2021-06-04 07:44 -0400
Re: Refuting the Linz Halting Problem Proof (V15)(not very bright?) olcott <NoOne@NoWhere.com> - 2021-06-04 09:24 -0500
Re: Refuting the Linz Halting Problem Proof (V15)(not very bright?)(typo) olcott <NoOne@NoWhere.com> - 2021-06-04 09:47 -0500
Re: Refuting the Linz Halting Problem Proof (V15)(top reviewer list) olcott <NoOne@NoWhere.com> - 2021-06-04 11:14 -0500
Re: Refuting the Linz Halting Problem Proof (V15)(not very bright?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-04 14:31 -0700
Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) olcott <NoOne@NoWhere.com> - 2021-06-04 20:39 -0500
Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-04 22:22 -0700
Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) olcott <NoOne@NoWhere.com> - 2021-06-05 00:30 -0500
Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-04 22:33 -0700
Re: Refuting the Linz Halting Problem Proof (V15)(no one can refute this reasoning) olcott <NoOne@NoWhere.com> - 2021-06-05 08:17 -0500
Re: Refuting the Linz Halting Problem Proof (V?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-03 22:15 -0700
Re: Refuting the Linz Halting Problem Proof (V?) olcott <NoOne@NoWhere.com> - 2021-06-04 00:28 -0500
Re: Refuting the Linz Halting Problem Proof (V?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-03 22:29 -0700
Re: Refuting the Linz Halting Problem Proof (V?) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-03 22:30 -0700
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) olcott <NoOne@NoWhere.com> - 2021-06-02 10:57 -0500
Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) Richard Damon <Richard@Damon-Family.org> - 2021-06-02 20:26 -0400
Page 6 of 9 — ← Prev page 1 2 3 4 5 [6] 7 8 9 Next page →
| From | "dklei...@gmail.com" <dkleinecke@gmail.com> |
|---|---|
| Date | 2021-06-10 20:39 -0700 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) |
| Message-ID | <ed23a893-5a07-41ba-8c38-7a3129ef3f3dn@googlegroups.com> |
| In reply to | #34682 |
On Thursday, June 10, 2021 at 1:49:47 PM UTC-7, olcott wrote:
> On 6/10/2021 2:58 PM, olcott wrote:
> > On 6/10/2021 2:10 PM, dklei...@gmail.com wrote:
> >> On Thursday, June 10, 2021 at 4:42:31 AM UTC-7, olcott wrote:
> >>
> >>> I guess that we are done here.
> >>
> >> That was a mighty mess. I am delighted it is finally done.
> >>
> >> Would you please tell us just what you proved?
> >>
> >
> > The standard pseudo-code halting problem template "proved" that the
> > halting problem could never be solved on the basis that neither value of
> > true (halting) nor false (not halting) could be correctly returned to
> > the confounding input.
> >
> > Halting Problem -- Simple Proof
> > https://www.comp.nus.edu.sg/~cs5234/FAQ/halt.html
> >
> > The problem is overcome on the basis that the halt decider aborts its
> > simulation of this input before ever returning any value to this input.
No simulation is required to be in Halt. Halt, being itself a halting
program must halt before returning any value. So the proposed cure
seems to change nothing and cannot be a cure.
In what follows it seems that, since your H_Hat corresponds to the
Z of the simple proof, that
u32 Input_Would_Halt6 = H((u32)H_Hat, (u32)H_Hat);
should be
u32 Input_Would_Halt6 = H_Hat((u32)H_Hat, (u32)H_Hat);
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-10 23:40 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) |
| Message-ID | <9JCdncQ9p8-4dF_9nZ2dnUU7-LXNnZ2d@giganews.com> |
| In reply to | #34697 |
On 6/10/2021 10:39 PM, dklei...@gmail.com wrote: > On Thursday, June 10, 2021 at 1:49:47 PM UTC-7, olcott wrote: >> On 6/10/2021 2:58 PM, olcott wrote: >>> On 6/10/2021 2:10 PM, dklei...@gmail.com wrote: >>>> On Thursday, June 10, 2021 at 4:42:31 AM UTC-7, olcott wrote: >>>> >>>>> I guess that we are done here. >>>> >>>> That was a mighty mess. I am delighted it is finally done. >>>> >>>> Would you please tell us just what you proved? >>>> >>> >>> The standard pseudo-code halting problem template "proved" that the >>> halting problem could never be solved on the basis that neither value of >>> true (halting) nor false (not halting) could be correctly returned to >>> the confounding input. >>> >>> Halting Problem -- Simple Proof >>> https://www.comp.nus.edu.sg/~cs5234/FAQ/halt.html >>> >>> The problem is overcome on the basis that the halt decider aborts its >>> simulation of this input before ever returning any value to this input. > > No simulation is required to be in Halt. Only a simulating halt decider can correctly decide self-referential inputs. > Halt, being itself a halting > program must halt before returning any value. So the proposed cure > seems to change nothing and cannot be a cure. > That is not the way that it works. It stores a value in the EAX register and then executes a return statement. By making sure to hardly pay attention people can maintain their misconception that I am incorrect. > In what follows it seems that, since your H_Hat corresponds to the > Z of the simple proof, that > u32 Input_Would_Halt6 = H((u32)H_Hat, (u32)H_Hat); > should be > u32 Input_Would_Halt6 = H_Hat((u32)H_Hat, (u32)H_Hat); > No that is incorrect. If you didn't erase the context would be able to see that you have the wrong number of arguments. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "dklei...@gmail.com" <dkleinecke@gmail.com> |
|---|---|
| Date | 2021-06-11 10:36 -0700 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) |
| Message-ID | <fbfdc33e-dd10-45db-a005-d5f01084eb76n@googlegroups.com> |
| In reply to | #34698 |
On Thursday, June 10, 2021 at 9:40:12 PM UTC-7, olcott wrote: > On 6/10/2021 10:39 PM, dklei...@gmail.com wrote: > > On Thursday, June 10, 2021 at 1:49:47 PM UTC-7, olcott wrote: > >> On 6/10/2021 2:58 PM, olcott wrote: > >>> On 6/10/2021 2:10 PM, dklei...@gmail.com wrote: > >>>> On Thursday, June 10, 2021 at 4:42:31 AM UTC-7, olcott wrote: > >>>> > >>>>> I guess that we are done here. > >>>> > >>>> That was a mighty mess. I am delighted it is finally done. > >>>> > >>>> Would you please tell us just what you proved? > >>>> > >>> > >>> The standard pseudo-code halting problem template "proved" that the > >>> halting problem could never be solved on the basis that neither value of > >>> true (halting) nor false (not halting) could be correctly returned to > >>> the confounding input. > >>> > >>> Halting Problem -- Simple Proof > >>> https://www.comp.nus.edu.sg/~cs5234/FAQ/halt.html > >>> > >>> The problem is overcome on the basis that the halt decider aborts its > >>> simulation of this input before ever returning any value to this input. > > > > No simulation is required to be in Halt. > Only a simulating halt decider can correctly decide self-referential > inputs. I doubt this proposition. A proof needs to be given. > > Halt, being itself a halting > > program must halt before returning any value. So the proposed cure > > seems to change nothing and cannot be a cure. > > > That is not the way that it works. It stores a value in the EAX register > and then executes a return statement. An implementation detail. No particular computer can be assumed. > > By making sure to hardly pay attention people can maintain their > misconception that I am incorrect. > > In what follows it seems that, since your H_Hat corresponds to the > > Z of the simple proof, that > > u32 Input_Would_Halt6 = H((u32)H_Hat, (u32)H_Hat); > > should be > > u32 Input_Would_Halt6 = H_Hat((u32)H_Hat, (u32)H_Hat); > > > No that is incorrect. If you didn't erase the context would be able to > see that you have the wrong number of arguments. I just copy and pasted what you wrote.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-11 12:47 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(proof complete) |
| Message-ID | <6OmdnTu8O_sgPF79nZ2dnUU7-T_NnZ2d@giganews.com> |
| In reply to | #34711 |
On 6/11/2021 12:36 PM, dklei...@gmail.com wrote:
> On Thursday, June 10, 2021 at 9:40:12 PM UTC-7, olcott wrote:
>> On 6/10/2021 10:39 PM, dklei...@gmail.com wrote:
>>> On Thursday, June 10, 2021 at 1:49:47 PM UTC-7, olcott wrote:
>>>> On 6/10/2021 2:58 PM, olcott wrote:
>>>>> On 6/10/2021 2:10 PM, dklei...@gmail.com wrote:
>>>>>> On Thursday, June 10, 2021 at 4:42:31 AM UTC-7, olcott wrote:
>>>>>>
>>>>>>> I guess that we are done here.
>>>>>>
>>>>>> That was a mighty mess. I am delighted it is finally done.
>>>>>>
>>>>>> Would you please tell us just what you proved?
>>>>>>
>>>>>
>>>>> The standard pseudo-code halting problem template "proved" that the
>>>>> halting problem could never be solved on the basis that neither value of
>>>>> true (halting) nor false (not halting) could be correctly returned to
>>>>> the confounding input.
>>>>>
>>>>> Halting Problem -- Simple Proof
>>>>> https://www.comp.nus.edu.sg/~cs5234/FAQ/halt.html
>>>>>
>>>>> The problem is overcome on the basis that the halt decider aborts its
>>>>> simulation of this input before ever returning any value to this input.
>>>
>
>>> No simulation is required to be in Halt.
>> Only a simulating halt decider can correctly decide self-referential
>> inputs.
>
> I doubt this proposition. A proof needs to be given.
>
This is only a teeny tiny side-issue. The key fact is that a simulating
halt decider does correctly decide self-referential inputs.
I have proved this many times in many different ways. This current proof
is simple enough that any computer science graduate can confirm that it
is correct.
People that want me to be wrong are not honest enough to acknowledge
that my proof is correct. The fact that the only basis of refutation is
misquoting my words and then rebutting these misquoted words proves that
some rebuttals are simply dishonest.
>>> Halt, being itself a halting
>>> program must halt before returning any value. So the proposed cure
>>> seems to change nothing and cannot be a cure.
>>>
>> That is not the way that it works. It stores a value in the EAX register
>> and then executes a return statement.
>
> An implementation detail. No particular computer can be assumed.
>>
>> By making sure to hardly pay attention people can maintain their
>> misconception that I am incorrect.
>
>>> In what follows it seems that, since your H_Hat corresponds to the
>>> Z of the simple proof, that
>>> u32 Input_Would_Halt6 = H((u32)H_Hat, (u32)H_Hat);
>>> should be
>>> u32 Input_Would_Halt6 = H_Hat((u32)H_Hat, (u32)H_Hat);
>>>
>> No that is incorrect. If you didn't erase the context would be able to
>> see that you have the wrong number of arguments.
>
> I just copy and pasted what you wrote.
>
You skipped the most important part.
On 6/10/2021 2:58 PM, olcott wrote:
> void H_Hat(u32 P)
> {
> u32 Input_Halts = H(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> int main()
> {
> u32 Input_Would_Halt6 = H((u32)H_Hat, (u32)H_Hat);
> Output("Input_Would_Halt6 = ", Input_Would_Halt6);
> }
If you simply hit the reply button on your USENET interface that would
not have happened.
--
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-06-10 18:44 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <6BwwI.14289$e21.11797@fx02.iad> |
| In reply to | #34674 |
On 6/10/21 7:42 AM, olcott wrote:
> On 6/10/2021 5:24 AM, Richard Damon wrote:
>> On 6/9/21 10:31 PM, olcott wrote:
>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>
>>>>> Do you understand that this input to H <is> infinitely recursive:
>>>>>
>>>>> int Infinite_Recursion(u32 N)
>>>>> {
>>>>> u32 M = Infinite_Recursion(N);
>>>>> return M;
>>>>> }
>>>>>
>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>
>>>>>
>>>>
>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>> terminate
>>>> the loop as part of the logic of H_Hat.
>>>>
>>>
>>> No freaking yes but. Do you understand that H must abort the simulation
>>> of its input or its input would never halt?
>>>
>>
>> Do you realize how DUMB your statement is, it fails freshman logic 101.
>>
>
> So you don't agree than infinite recursion <is> infinite recursion.
> I guess that we are done here.
>
TRUE infinite recursion is infinite recursion.
Potential infinite recursion that doesn't actually happen is not.
Since the H in question DOES stop its simulation, the recursion is NOT
infinite.
You can't have H not stop the simulation and also be stopping it at the
same time, that is calling your black cat white.
H's flaw is that it ignores that H has a conditional in it.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-10 17:54 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <W-CdnbaYRNShBV_9nZ2dnUU7-QPNnZ2d@giganews.com> |
| In reply to | #34684 |
On 6/10/2021 5:44 PM, Richard Damon wrote:
> On 6/10/21 7:42 AM, olcott wrote:
>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>> On 6/9/21 10:31 PM, olcott wrote:
>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>
>>>>>> Do you understand that this input to H <is> infinitely recursive:
>>>>>>
>>>>>> int Infinite_Recursion(u32 N)
>>>>>> {
>>>>>> u32 M = Infinite_Recursion(N);
>>>>>> return M;
>>>>>> }
>>>>>>
>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>
>>>>>>
>>>>>
>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>> terminate
>>>>> the loop as part of the logic of H_Hat.
>>>>>
>>>>
>>>> No freaking yes but. Do you understand that H must abort the simulation
>>>> of its input or its input would never halt?
>>>>
>>>
>>> Do you realize how DUMB your statement is, it fails freshman logic 101.
>>>
>>
>> So you don't agree than infinite recursion <is> infinite recursion.
>> I guess that we are done here.
>>
>
>
> TRUE infinite recursion is infinite recursion.
>
int Infinite_Recursion(u32 N)
{
u32 M = Infinite_Recursion(N);
return M;
}
It is a simulating halt decider that always terminates the simulation of
inputs that would never otherwise terminate.
If you believe that the above function does not specify infinite
recursion you are out-of-touch with reality, thus no longer any use as a
reviewer.
--
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-06-10 19:07 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <AWwwI.15839$341.9155@fx42.iad> |
| In reply to | #34685 |
On 6/10/21 6:54 PM, olcott wrote:
> On 6/10/2021 5:44 PM, Richard Damon wrote:
>> On 6/10/21 7:42 AM, olcott wrote:
>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>
>>>>>>> Do you understand that this input to H <is> infinitely recursive:
>>>>>>>
>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>> {
>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>> return M;
>>>>>>> }
>>>>>>>
>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>> terminate
>>>>>> the loop as part of the logic of H_Hat.
>>>>>>
>>>>>
>>>>> No freaking yes but. Do you understand that H must abort the
>>>>> simulation
>>>>> of its input or its input would never halt?
>>>>>
>>>>
>>>> Do you realize how DUMB your statement is, it fails freshman logic 101.
>>>>
>>>
>>> So you don't agree than infinite recursion <is> infinite recursion.
>>> I guess that we are done here.
>>>
>>
>>
>> TRUE infinite recursion is infinite recursion.
>>
>
> int Infinite_Recursion(u32 N)
> {
> u32 M = Infinite_Recursion(N);
> return M;
> }
>
> It is a simulating halt decider that always terminates the simulation of
> inputs that would never otherwise terminate.
>
> If you believe that the above function does not specify infinite
> recursion you are out-of-touch with reality, thus no longer any use as a
> reviewer.
>
I NEVETR said that the above was not infinite recursion, so you bringing
it up now just shows how desperate you are to bring up strawmen.
The difference is that H_Hat which calls H which starts to simulate a
copy of H_Hat and then abort it because it mistakenly thinks it detects
infinite recursion and then returns to H_Hat which Halt.
THere was NEVER an actual infinite recursion, because in this case the H
provided was always going to abort the simulation of this case because
it erroneously thinks the recursion is infinite.
Maybe that is your problem, and why you keep asking people to agree to
things, you think that just because someone thinks it is true will make
it true, it doesn't Truth is what actually is true, not what people
think is true.
H is WRONG about H_Hat, and in part that is what makes H_Hat actually
halt. The key point is that H can NEVER be right about H_Hat due to the
way H_Hat is written, and that is ok, it is done by the rules, which is
why there can not be a universally correct halt decider.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-10 19:21 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <COWdncEcSPkAMV_9nZ2dnUU7-VXNnZ2d@giganews.com> |
| In reply to | #34686 |
On 6/10/2021 6:07 PM, Richard Damon wrote:
> On 6/10/21 6:54 PM, olcott wrote:
>> On 6/10/2021 5:44 PM, Richard Damon wrote:
>>> On 6/10/21 7:42 AM, olcott wrote:
>>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>>
>>>>>>>> Do you understand that this input to H <is> infinitely recursive:
>>>>>>>>
>>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>>> {
>>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>>> return M;
>>>>>>>> }
>>>>>>>>
>>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>>> terminate
>>>>>>> the loop as part of the logic of H_Hat.
>>>>>>>
>>>>>>
>>>>>> No freaking yes but. Do you understand that H must abort the
>>>>>> simulation
>>>>>> of its input or its input would never halt?
>>>>>>
>>>>>
>>>>> Do you realize how DUMB your statement is, it fails freshman logic 101.
>>>>>
>>>>
>>>> So you don't agree than infinite recursion <is> infinite recursion.
>>>> I guess that we are done here.
>>>>
>>>
>>>
>>> TRUE infinite recursion is infinite recursion.
>>>
>>
>> int Infinite_Recursion(u32 N)
>> {
>> u32 M = Infinite_Recursion(N);
>> return M;
>> }
>>
>> It is a simulating halt decider that always terminates the simulation of
>> inputs that would never otherwise terminate.
>>
>> If you believe that the above function does not specify infinite
>> recursion you are out-of-touch with reality, thus no longer any use as a
>> reviewer.
>>
>
> I NEVETR said that the above was not infinite recursion, so you bringing
> it up now just shows how desperate you are to bring up strawmen.
>
I have only been talking about how the halt decider correctly decides
that the above infinite recursion never halts for my last six messages.
Where the Hell have you been?
Where the Hell have you been?
Where the Hell have you been?
I told you I will utterly not tolerate dishonest dodges.
--
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-06-10 20:58 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <RyywI.225841$Ms7.200255@fx34.iad> |
| In reply to | #34687 |
On 6/10/21 8:21 PM, olcott wrote:
> On 6/10/2021 6:07 PM, Richard Damon wrote:
>> On 6/10/21 6:54 PM, olcott wrote:
>>> On 6/10/2021 5:44 PM, Richard Damon wrote:
>>>> On 6/10/21 7:42 AM, olcott wrote:
>>>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>>>
>>>>>>>>> Do you understand that this input to H <is> infinitely recursive:
>>>>>>>>>
>>>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>>>> {
>>>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>>>> return M;
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>>>> terminate
>>>>>>>> the loop as part of the logic of H_Hat.
>>>>>>>>
>>>>>>>
>>>>>>> No freaking yes but. Do you understand that H must abort the
>>>>>>> simulation
>>>>>>> of its input or its input would never halt?
>>>>>>>
>>>>>>
>>>>>> Do you realize how DUMB your statement is, it fails freshman logic
>>>>>> 101.
>>>>>>
>>>>>
>>>>> So you don't agree than infinite recursion <is> infinite recursion.
>>>>> I guess that we are done here.
>>>>>
>>>>
>>>>
>>>> TRUE infinite recursion is infinite recursion.
>>>>
>>>
>>> int Infinite_Recursion(u32 N)
>>> {
>>> u32 M = Infinite_Recursion(N);
>>> return M;
>>> }
>>>
>>> It is a simulating halt decider that always terminates the simulation of
>>> inputs that would never otherwise terminate.
>>>
>>> If you believe that the above function does not specify infinite
>>> recursion you are out-of-touch with reality, thus no longer any use as a
>>> reviewer.
>>>
>>
>> I NEVETR said that the above was not infinite recursion, so you bringing
>> it up now just shows how desperate you are to bring up strawmen.
>>
>
> I have only been talking about how the halt decider correctly decides
> that the above infinite recursion never halts for my last six messages.
Except that it gets H_Hat wromg, so why do you keep bringing up YOUR
dishonest dodge of the Infinite_Recursion function?
>
> Where the Hell have you been?
> Where the Hell have you been?
> Where the Hell have you been?
Telling you how you are wrong.
>
> I told you I will utterly not tolerate dishonest dodges.
>
No, you don't tolerate people correcting your mistake.
H_Hat is Halting.
It is Halting because it Halts.
It halts because when in uses a copy of H to decide on a description of
H_Hat(H_Hat). That H will incorrectly decide that this description of
H_Hat(H_Hat) is non-Halting because it is too stupid to see that H might
know enough to stop the potentially infinite recursion so mistakenly
assumes that H_Hat will be infinitely recursive and thus incorrectly
calls in non-halting, and returns that answer to the rest of H_Hat which
then stops and shows that it was wrong.
H seems to be smart enough to recognize itself in the simulatin, but not
smart enough to understand that because it can stop the recursion, so
can the copy of itself. I guess this is just proof that it is hard to
program something to be smarter than yourself.
H makes a wrong decision, and while this mistake allows it to make a
decision, it make a wrong decision (because it CAN'T make the right one,
because there isn't one it can give).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-10 20:40 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <uKKdnWq8xo2DIl_9nZ2dnUU7-QXNnZ2d@giganews.com> |
| In reply to | #34688 |
On 6/10/2021 7:58 PM, Richard Damon wrote:
> On 6/10/21 8:21 PM, olcott wrote:
>> On 6/10/2021 6:07 PM, Richard Damon wrote:
>>> On 6/10/21 6:54 PM, olcott wrote:
>>>> On 6/10/2021 5:44 PM, Richard Damon wrote:
>>>>> On 6/10/21 7:42 AM, olcott wrote:
>>>>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>>>>
>>>>>>>>>> Do you understand that this input to H <is> infinitely recursive:
>>>>>>>>>>
>>>>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>>>>> {
>>>>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>>>>> return M;
>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>>>>> terminate
>>>>>>>>> the loop as part of the logic of H_Hat.
>>>>>>>>>
>>>>>>>>
>>>>>>>> No freaking yes but. Do you understand that H must abort the
>>>>>>>> simulation
>>>>>>>> of its input or its input would never halt?
>>>>>>>>
>>>>>>>
>>>>>>> Do you realize how DUMB your statement is, it fails freshman logic
>>>>>>> 101.
>>>>>>>
>>>>>>
>>>>>> So you don't agree than infinite recursion <is> infinite recursion.
>>>>>> I guess that we are done here.
>>>>>>
>>>>>
>>>>>
>>>>> TRUE infinite recursion is infinite recursion.
>>>>>
>>>>
>>>> int Infinite_Recursion(u32 N)
>>>> {
>>>> u32 M = Infinite_Recursion(N);
>>>> return M;
>>>> }
>>>>
>>>> It is a simulating halt decider that always terminates the simulation of
>>>> inputs that would never otherwise terminate.
>>>>
>>>> If you believe that the above function does not specify infinite
>>>> recursion you are out-of-touch with reality, thus no longer any use as a
>>>> reviewer.
>>>>
>>>
>>> I NEVETR said that the above was not infinite recursion, so you bringing
>>> it up now just shows how desperate you are to bring up strawmen.
>>>
>>
>> I have only been talking about how the halt decider correctly decides
>> that the above infinite recursion never halts for my last six messages.
>
> Except that it gets H_Hat wromg, so why do you keep bringing up YOUR
> dishonest dodge of the Infinite_Recursion function?
>
>>
>> Where the Hell have you been?
>> Where the Hell have you been?
>> Where the Hell have you been?
>
>
> Telling you how you are wrong.
>>
>> I told you I will utterly not tolerate dishonest dodges.
>>
>
> No, you don't tolerate people correcting your mistake.
>
> H_Hat is Halting.
Are you mentally defective?
I am not talking about H_Hat now.
I haven't been talking about H_Hat for seven messages now.
Because of your attention deficit disorder We cannot possibly have any
progress at all unless we stick with one point at a time.
I might as well give up with you. I already know the correct analysis I
need to escalate this to computer scientists.
--
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-06-10 21:59 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <HrzwI.592937$ST2.403902@fx47.iad> |
| In reply to | #34689 |
On 6/10/21 9:40 PM, olcott wrote:
> On 6/10/2021 7:58 PM, Richard Damon wrote:
>> On 6/10/21 8:21 PM, olcott wrote:
>>> On 6/10/2021 6:07 PM, Richard Damon wrote:
>>>> On 6/10/21 6:54 PM, olcott wrote:
>>>>> On 6/10/2021 5:44 PM, Richard Damon wrote:
>>>>>> On 6/10/21 7:42 AM, olcott wrote:
>>>>>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>>>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>>>>>
>>>>>>>>>>> Do you understand that this input to H <is> infinitely
>>>>>>>>>>> recursive:
>>>>>>>>>>>
>>>>>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>>>>>> {
>>>>>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>>>>>> return M;
>>>>>>>>>>> }
>>>>>>>>>>>
>>>>>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>>>>>> terminate
>>>>>>>>>> the loop as part of the logic of H_Hat.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> No freaking yes but. Do you understand that H must abort the
>>>>>>>>> simulation
>>>>>>>>> of its input or its input would never halt?
>>>>>>>>>
>>>>>>>>
>>>>>>>> Do you realize how DUMB your statement is, it fails freshman logic
>>>>>>>> 101.
>>>>>>>>
>>>>>>>
>>>>>>> So you don't agree than infinite recursion <is> infinite recursion.
>>>>>>> I guess that we are done here.
>>>>>>>
>>>>>>
>>>>>>
>>>>>> TRUE infinite recursion is infinite recursion.
>>>>>>
>>>>>
>>>>> int Infinite_Recursion(u32 N)
>>>>> {
>>>>> u32 M = Infinite_Recursion(N);
>>>>> return M;
>>>>> }
>>>>>
>>>>> It is a simulating halt decider that always terminates the
>>>>> simulation of
>>>>> inputs that would never otherwise terminate.
>>>>>
>>>>> If you believe that the above function does not specify infinite
>>>>> recursion you are out-of-touch with reality, thus no longer any use
>>>>> as a
>>>>> reviewer.
>>>>>
>>>>
>>>> I NEVETR said that the above was not infinite recursion, so you
>>>> bringing
>>>> it up now just shows how desperate you are to bring up strawmen.
>>>>
>>>
>>> I have only been talking about how the halt decider correctly decides
>>> that the above infinite recursion never halts for my last six messages.
>>
>> Except that it gets H_Hat wromg, so why do you keep bringing up YOUR
>> dishonest dodge of the Infinite_Recursion function?
>>
>>>
>>> Where the Hell have you been?
>>> Where the Hell have you been?
>>> Where the Hell have you been?
>>
>>
>> Telling you how you are wrong.
>>>
>>> I told you I will utterly not tolerate dishonest dodges.
>>>
>>
>> No, you don't tolerate people correcting your mistake.
>>
>> H_Hat is Halting.
> Are you mentally defective?
> I am not talking about H_Hat now.
> I haven't been talking about H_Hat for seven messages now.
>
> Because of your attention deficit disorder We cannot possibly have any
> progress at all unless we stick with one point at a time.
>
> I might as well give up with you. I already know the correct analysis I
> need to escalate this to computer scientists.
>
IF you aren't talking about H_Hat, then why do you keep trying to
correct me when I point out that this argument won't apply to H_Hat.
If you promise that this line of reasoning isn't going to be applied to
H_Hat, then we can drop it, but if you do get to H_Hat, you can be
called a liar.
Your problem is that you don't have a real proof, but need to lay out a
slow rhetorical argument that you want to try to 'trap' people into
accepting wrong assumptions.
Since I agree that Infinite_Recursion will be non-halting and if H does
decide that, it is right, why are you arguing about side points I bring up?
I will point out that wrong reasoning can come up with right answers, so
the fact that H answers right on this case says nothing about the method
that it used being valid.
Just like the fact that log(1+2+3) = log(1*2*3) doesn't mean that in
general log(a+b+c) = log(a*b*c).
While the argument isn't valid, I suspect you ARE going to try to use
that line of reasoning, why else bring up this worthless fact?
A -> B, B, does NOT imply A.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-10 21:24 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <8MudnR55CaD-VF_9nZ2dnUU7-U_NnZ2d@giganews.com> |
| In reply to | #34691 |
On 6/10/2021 8:59 PM, Richard Damon wrote:
> On 6/10/21 9:40 PM, olcott wrote:
>> On 6/10/2021 7:58 PM, Richard Damon wrote:
>>> On 6/10/21 8:21 PM, olcott wrote:
>>>> On 6/10/2021 6:07 PM, Richard Damon wrote:
>>>>> On 6/10/21 6:54 PM, olcott wrote:
>>>>>> On 6/10/2021 5:44 PM, Richard Damon wrote:
>>>>>>> On 6/10/21 7:42 AM, olcott wrote:
>>>>>>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>>>>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>>>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>>>>>>
>>>>>>>>>>>> Do you understand that this input to H <is> infinitely
>>>>>>>>>>>> recursive:
>>>>>>>>>>>>
>>>>>>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>>>>>>> {
>>>>>>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>>>>>>> return M;
>>>>>>>>>>>> }
>>>>>>>>>>>>
>>>>>>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>>>>>>> terminate
>>>>>>>>>>> the loop as part of the logic of H_Hat.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> No freaking yes but. Do you understand that H must abort the
>>>>>>>>>> simulation
>>>>>>>>>> of its input or its input would never halt?
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Do you realize how DUMB your statement is, it fails freshman logic
>>>>>>>>> 101.
>>>>>>>>>
>>>>>>>>
>>>>>>>> So you don't agree than infinite recursion <is> infinite recursion.
>>>>>>>> I guess that we are done here.
>>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>> TRUE infinite recursion is infinite recursion.
>>>>>>>
>>>>>>
>>>>>> int Infinite_Recursion(u32 N)
>>>>>> {
>>>>>> u32 M = Infinite_Recursion(N);
>>>>>> return M;
>>>>>> }
>>>>>>
>>>>>> It is a simulating halt decider that always terminates the
>>>>>> simulation of
>>>>>> inputs that would never otherwise terminate.
>>>>>>
>>>>>> If you believe that the above function does not specify infinite
>>>>>> recursion you are out-of-touch with reality, thus no longer any use
>>>>>> as a
>>>>>> reviewer.
>>>>>>
>>>>>
>>>>> I NEVETR said that the above was not infinite recursion, so you
>>>>> bringing
>>>>> it up now just shows how desperate you are to bring up strawmen.
>>>>>
>>>>
>>>> I have only been talking about how the halt decider correctly decides
>>>> that the above infinite recursion never halts for my last six messages.
>>>
>>> Except that it gets H_Hat wromg, so why do you keep bringing up YOUR
>>> dishonest dodge of the Infinite_Recursion function?
>>>
>>>>
>>>> Where the Hell have you been?
>>>> Where the Hell have you been?
>>>> Where the Hell have you been?
>>>
>>>
>>> Telling you how you are wrong.
>>>>
>>>> I told you I will utterly not tolerate dishonest dodges.
>>>>
>>>
>>> No, you don't tolerate people correcting your mistake.
>>>
>>> H_Hat is Halting.
>> Are you mentally defective?
>> I am not talking about H_Hat now.
>> I haven't been talking about H_Hat for seven messages now.
>>
>> Because of your attention deficit disorder We cannot possibly have any
>> progress at all unless we stick with one point at a time.
>>
>> I might as well give up with you. I already know the correct analysis I
>> need to escalate this to computer scientists.
>>
>
> IF you aren't talking about H_Hat, then why do you keep trying to
> correct me when I point out that this argument won't apply to H_Hat.
We have to get to that point through other simpler points. one point at
a time. If your only purpose is to deceitfully dodge the mandatory
prerequisites to keep up the ruse that anyone ever provided any rebuttal
I am through talking to you.
--
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-06-10 22:44 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <l6AwI.130833$qy1.110935@fx26.iad> |
| In reply to | #34692 |
On 6/10/21 10:24 PM, olcott wrote:
> On 6/10/2021 8:59 PM, Richard Damon wrote:
>> On 6/10/21 9:40 PM, olcott wrote:
>>> On 6/10/2021 7:58 PM, Richard Damon wrote:
>>>> On 6/10/21 8:21 PM, olcott wrote:
>>>>> On 6/10/2021 6:07 PM, Richard Damon wrote:
>>>>>> On 6/10/21 6:54 PM, olcott wrote:
>>>>>>> On 6/10/2021 5:44 PM, Richard Damon wrote:
>>>>>>>> On 6/10/21 7:42 AM, olcott wrote:
>>>>>>>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>>>>>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>>>>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>>>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>>>>>>>
>>>>>>>>>>>>> Do you understand that this input to H <is> infinitely
>>>>>>>>>>>>> recursive:
>>>>>>>>>>>>>
>>>>>>>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>>>>>>>> {
>>>>>>>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>>>>>>>> return M;
>>>>>>>>>>>>> }
>>>>>>>>>>>>>
>>>>>>>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>>>>>>>> terminate
>>>>>>>>>>>> the loop as part of the logic of H_Hat.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> No freaking yes but. Do you understand that H must abort the
>>>>>>>>>>> simulation
>>>>>>>>>>> of its input or its input would never halt?
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Do you realize how DUMB your statement is, it fails freshman
>>>>>>>>>> logic
>>>>>>>>>> 101.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> So you don't agree than infinite recursion <is> infinite
>>>>>>>>> recursion.
>>>>>>>>> I guess that we are done here.
>>>>>>>>>
>>>>>>>>
>>>>>>>>
>>>>>>>> TRUE infinite recursion is infinite recursion.
>>>>>>>>
>>>>>>>
>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>> {
>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>> return M;
>>>>>>> }
>>>>>>>
>>>>>>> It is a simulating halt decider that always terminates the
>>>>>>> simulation of
>>>>>>> inputs that would never otherwise terminate.
>>>>>>>
>>>>>>> If you believe that the above function does not specify infinite
>>>>>>> recursion you are out-of-touch with reality, thus no longer any use
>>>>>>> as a
>>>>>>> reviewer.
>>>>>>>
>>>>>>
>>>>>> I NEVETR said that the above was not infinite recursion, so you
>>>>>> bringing
>>>>>> it up now just shows how desperate you are to bring up strawmen.
>>>>>>
>>>>>
>>>>> I have only been talking about how the halt decider correctly decides
>>>>> that the above infinite recursion never halts for my last six
>>>>> messages.
>>>>
>>>> Except that it gets H_Hat wromg, so why do you keep bringing up YOUR
>>>> dishonest dodge of the Infinite_Recursion function?
>>>>
>>>>>
>>>>> Where the Hell have you been?
>>>>> Where the Hell have you been?
>>>>> Where the Hell have you been?
>>>>
>>>>
>>>> Telling you how you are wrong.
>>>>>
>>>>> I told you I will utterly not tolerate dishonest dodges.
>>>>>
>>>>
>>>> No, you don't tolerate people correcting your mistake.
>>>>
>>>> H_Hat is Halting.
>>> Are you mentally defective?
>>> I am not talking about H_Hat now.
>>> I haven't been talking about H_Hat for seven messages now.
>>>
>>> Because of your attention deficit disorder We cannot possibly have any
>>> progress at all unless we stick with one point at a time.
>>>
>>> I might as well give up with you. I already know the correct analysis I
>>> need to escalate this to computer scientists.
>>>
>>
>> IF you aren't talking about H_Hat, then why do you keep trying to
>> correct me when I point out that this argument won't apply to H_Hat.
>
> We have to get to that point through other simpler points. one point at
> a time. If your only purpose is to deceitfully dodge the mandatory
> prerequisites to keep up the ruse that anyone ever provided any rebuttal
> I am through talking to you.
>
If my statement is wrong, you can point out the error. If you need a
long argument to point out a simple error, YOUR logic is most likely wrong.
I quote simple principles, if you want to disagree with something I say,
point out the error.
Halting is Halting. THAT is the definition. I can predict that your
argument is going to get to a statement that will go something like:
A Correct Decision to xxxx shows Non-Halting Behavior.
(Do you deny this?)
The key point is that since HALTING is well defined, this statement
actually defines what a Correct Decision will be, but you are going to
try to argue that you have made a convincing argument that something
must be correct behavior, so that over rides the definition fo Halting.
The problem is that convincing arguments are not proofs, and that is the
flaw in your argument.
You yourself have said that we must go by real evidence, not intuition.
And we need to do that, look at the REAL evidence of what the machines
do and the actual definitions, not what some flower oratory might seem
convincing. The problem with what you said was that you were doing the
Orwellian double speak of trying to define 'intuition' as applying the
fundamental rules of Compuation and looking at what the machine did, and
the real evidence was you long winded rhetorical argument that just
appealed to your own twisted definitions of word.
Please, GIVE A PROOF, not an Argument. That means you need to start with
REAL facts, not 'examples'. No proof works by just example.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-10 20:57 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <v8-dnQZkCLaYXl_9nZ2dnUU7-cvNnZ2d@giganews.com> |
| In reply to | #34688 |
On 6/10/2021 7:58 PM, Richard Damon wrote:
> On 6/10/21 8:21 PM, olcott wrote:
>> On 6/10/2021 6:07 PM, Richard Damon wrote:
>>> On 6/10/21 6:54 PM, olcott wrote:
>>>> On 6/10/2021 5:44 PM, Richard Damon wrote:
>>>>> On 6/10/21 7:42 AM, olcott wrote:
>>>>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>>>>
>>>>>>>>>> Do you understand that this input to H <is> infinitely recursive:
>>>>>>>>>>
>>>>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>>>>> {
>>>>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>>>>> return M;
>>>>>>>>>> }
>>>>>>>>>>
>>>>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>>>>> terminate
>>>>>>>>> the loop as part of the logic of H_Hat.
>>>>>>>>>
>>>>>>>>
>>>>>>>> No freaking yes but. Do you understand that H must abort the
>>>>>>>> simulation
>>>>>>>> of its input or its input would never halt?
>>>>>>>>
>>>>>>>
>>>>>>> Do you realize how DUMB your statement is, it fails freshman logic
>>>>>>> 101.
>>>>>>>
>>>>>>
>>>>>> So you don't agree than infinite recursion <is> infinite recursion.
>>>>>> I guess that we are done here.
>>>>>>
>>>>>
>>>>>
>>>>> TRUE infinite recursion is infinite recursion.
>>>>>
>>>>
>>>> int Infinite_Recursion(u32 N)
>>>> {
>>>> u32 M = Infinite_Recursion(N);
>>>> return M;
>>>> }
>>>>
>>>> It is a simulating halt decider that always terminates the simulation of
>>>> inputs that would never otherwise terminate.
>>>>
>>>> If you believe that the above function does not specify infinite
>>>> recursion you are out-of-touch with reality, thus no longer any use as a
>>>> reviewer.
>>>>
>>>
>>> I NEVETR said that the above was not infinite recursion, so you bringing
>>> it up now just shows how desperate you are to bring up strawmen.
>>>
>>
>> I have only been talking about how the halt decider correctly decides
>> that the above infinite recursion never halts for my last six messages.
>
> Except that it gets H_Hat wromg, so why do you keep bringing up YOUR
> dishonest dodge of the Infinite_Recursion function?
>
>>
>> Where the Hell have you been?
>> Where the Hell have you been?
>> Where the Hell have you been?
>
>
> Telling you how you are wrong.
>>
>> I told you I will utterly not tolerate dishonest dodges.
>>
>
> No, you don't tolerate people correcting your mistake.
>
> H_Hat is Halting.
No one can understand what I am saying unless we go through it one point
at a time.
If you want to continue to cheat to try to fool some people into
believing the anyone provided any correct rebuttal you can go to Hell.
If you want to get to the actual truth then we have to go exactly one
point at a time. The point that we are on now is this:
int Infinite_Recursion(u32 N)
{
u32 M = Infinite_Recursion(N);
return M;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
Output("Input_Would_Halt = ", Input_Would_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-06-10 22:30 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <OUzwI.107991$N%1.101455@fx28.iad> |
| In reply to | #34690 |
On 6/10/21 9:57 PM, olcott wrote:
> On 6/10/2021 7:58 PM, Richard Damon wrote:
>> On 6/10/21 8:21 PM, olcott wrote:
>>> On 6/10/2021 6:07 PM, Richard Damon wrote:
>>>> On 6/10/21 6:54 PM, olcott wrote:
>>>>> On 6/10/2021 5:44 PM, Richard Damon wrote:
>>>>>> On 6/10/21 7:42 AM, olcott wrote:
>>>>>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>>>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>>>>>
>>>>>>>>>>> Do you understand that this input to H <is> infinitely
>>>>>>>>>>> recursive:
>>>>>>>>>>>
>>>>>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>>>>>> {
>>>>>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>>>>>> return M;
>>>>>>>>>>> }
>>>>>>>>>>>
>>>>>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>>>>>> terminate
>>>>>>>>>> the loop as part of the logic of H_Hat.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> No freaking yes but. Do you understand that H must abort the
>>>>>>>>> simulation
>>>>>>>>> of its input or its input would never halt?
>>>>>>>>>
>>>>>>>>
>>>>>>>> Do you realize how DUMB your statement is, it fails freshman logic
>>>>>>>> 101.
>>>>>>>>
>>>>>>>
>>>>>>> So you don't agree than infinite recursion <is> infinite recursion.
>>>>>>> I guess that we are done here.
>>>>>>>
>>>>>>
>>>>>>
>>>>>> TRUE infinite recursion is infinite recursion.
>>>>>>
>>>>>
>>>>> int Infinite_Recursion(u32 N)
>>>>> {
>>>>> u32 M = Infinite_Recursion(N);
>>>>> return M;
>>>>> }
>>>>>
>>>>> It is a simulating halt decider that always terminates the
>>>>> simulation of
>>>>> inputs that would never otherwise terminate.
>>>>>
>>>>> If you believe that the above function does not specify infinite
>>>>> recursion you are out-of-touch with reality, thus no longer any use
>>>>> as a
>>>>> reviewer.
>>>>>
>>>>
>>>> I NEVETR said that the above was not infinite recursion, so you
>>>> bringing
>>>> it up now just shows how desperate you are to bring up strawmen.
>>>>
>>>
>>> I have only been talking about how the halt decider correctly decides
>>> that the above infinite recursion never halts for my last six messages.
>>
>> Except that it gets H_Hat wromg, so why do you keep bringing up YOUR
>> dishonest dodge of the Infinite_Recursion function?
>>
>>>
>>> Where the Hell have you been?
>>> Where the Hell have you been?
>>> Where the Hell have you been?
>>
>>
>> Telling you how you are wrong.
>>>
>>> I told you I will utterly not tolerate dishonest dodges.
>>>
>>
>> No, you don't tolerate people correcting your mistake.
>>
>> H_Hat is Halting.
>
> No one can understand what I am saying unless we go through it one point
> at a time.
>
No, you can't create a false argument without a lot of smoke to distract
people.
A good proof can be laid out all at once.
If a step can't stand the light of a later step being known, it wasn't
right to begin with. If you insist that you HAVE to do each step without
comments about the future, that itself is very strong proof that you are
pulling shenanigans.
The defense against this will be explicitly pointing out limitations to
answers that might not seem necesary, and any objections to those
limitations is a sign that you are not being honest.
> If you want to continue to cheat to try to fool some people into
> believing the anyone provided any correct rebuttal you can go to Hell.
YOU are the one cheating. The Rebuttals are correct. Maybe YOU are the
one already there.
>
> If you want to get to the actual truth then we have to go exactly one
> point at a time. The point that we are on now is this:
>
> int Infinite_Recursion(u32 N)
> {
> u32 M = Infinite_Recursion(N);
> return M;
> }
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)Infinite_Recursion, 1);
> Output("Input_Would_Halt = ", Input_Would_Halt);
> }
>
Fine, Halt can get the answer right, possibly by the wrong logic.
PROVE ME WRONG.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-10 21:45 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <-qidnaW-T6zAU1_9nZ2dnUU7-bHNnZ2d@giganews.com> |
| In reply to | #34693 |
On 6/10/2021 9:30 PM, Richard Damon wrote:
> On 6/10/21 9:57 PM, olcott wrote:
>> On 6/10/2021 7:58 PM, Richard Damon wrote:
>>> On 6/10/21 8:21 PM, olcott wrote:
>>>> On 6/10/2021 6:07 PM, Richard Damon wrote:
>>>>> On 6/10/21 6:54 PM, olcott wrote:
>>>>>> On 6/10/2021 5:44 PM, Richard Damon wrote:
>>>>>>> On 6/10/21 7:42 AM, olcott wrote:
>>>>>>>> On 6/10/2021 5:24 AM, Richard Damon wrote:
>>>>>>>>> On 6/9/21 10:31 PM, olcott wrote:
>>>>>>>>>> On 6/9/2021 9:27 PM, Richard Damon wrote:
>>>>>>>>>>> On 6/9/21 10:13 PM, olcott wrote:
>>>>>>>>>>>>
>>>>>>>>>>>> Do you understand that this input to H <is> infinitely
>>>>>>>>>>>> recursive:
>>>>>>>>>>>>
>>>>>>>>>>>> int Infinite_Recursion(u32 N)
>>>>>>>>>>>> {
>>>>>>>>>>>> u32 M = Infinite_Recursion(N);
>>>>>>>>>>>> return M;
>>>>>>>>>>>> }
>>>>>>>>>>>>
>>>>>>>>>>>> u32 Input_Would_Halt3 = H((u32)Infinite_Recursion, 3);
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Yes, but H_Hat isn't, because it has H in the loop, and H will
>>>>>>>>>>> terminate
>>>>>>>>>>> the loop as part of the logic of H_Hat.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> No freaking yes but. Do you understand that H must abort the
>>>>>>>>>> simulation
>>>>>>>>>> of its input or its input would never halt?
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Do you realize how DUMB your statement is, it fails freshman logic
>>>>>>>>> 101.
>>>>>>>>>
>>>>>>>>
>>>>>>>> So you don't agree than infinite recursion <is> infinite recursion.
>>>>>>>> I guess that we are done here.
>>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>> TRUE infinite recursion is infinite recursion.
>>>>>>>
>>>>>>
>>>>>> int Infinite_Recursion(u32 N)
>>>>>> {
>>>>>> u32 M = Infinite_Recursion(N);
>>>>>> return M;
>>>>>> }
>>>>>>
>>>>>> It is a simulating halt decider that always terminates the
>>>>>> simulation of
>>>>>> inputs that would never otherwise terminate.
>>>>>>
>>>>>> If you believe that the above function does not specify infinite
>>>>>> recursion you are out-of-touch with reality, thus no longer any use
>>>>>> as a
>>>>>> reviewer.
>>>>>>
>>>>>
>>>>> I NEVETR said that the above was not infinite recursion, so you
>>>>> bringing
>>>>> it up now just shows how desperate you are to bring up strawmen.
>>>>>
>>>>
>>>> I have only been talking about how the halt decider correctly decides
>>>> that the above infinite recursion never halts for my last six messages.
>>>
>>> Except that it gets H_Hat wromg, so why do you keep bringing up YOUR
>>> dishonest dodge of the Infinite_Recursion function?
>>>
>>>>
>>>> Where the Hell have you been?
>>>> Where the Hell have you been?
>>>> Where the Hell have you been?
>>>
>>>
>>> Telling you how you are wrong.
>>>>
>>>> I told you I will utterly not tolerate dishonest dodges.
>>>>
>>>
>>> No, you don't tolerate people correcting your mistake.
>>>
>>> H_Hat is Halting.
>>
>> No one can understand what I am saying unless we go through it one point
>> at a time.
>>
>
> No, you can't create a false argument without a lot of smoke to distract
> people.
>
> A good proof can be laid out all at once.
No it cannot. People always jump to the conclusion that I must be wrong.
I have to build incremental steps of mutual agreement or I cannot be
understood.
--
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-06-09 22:01 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <aoewI.627617$2N3.282544@fx33.iad> |
| In reply to | #34648 |
On 6/9/21 10:31 AM, olcott wrote: > Like I said any sequence that specifies infinite recursion or infinitely > nested simulation still specifies these two behavior patterns even when > the behavior pattern is recognized and aborted at any point in the > sequence. If it DID specifiy infinite recursion of infinitely nested simulation, then it would be non-Halting. The issue is that H_Hat includes a H that is smart enough to terminate its simulation, the the simulation isn't infinitely nested. The problem is that it then makes the incorrect decision that the routine it simulated must be infinitely nested simulation because it doesn't properly handle the decision of simulationg a copy of itself. > > Infinite recursion that is allowed to continue for 17 recursive calls is > still an infinitely recursive sequence beginning at the first recursive > call. The same thing applies to infinitely nested simulation. Yes, because if the version of H it is simulating allows 17 recursive calls, then that copy of the simulator needs to allow 18 to see what it will do. > > When the above code is simulated in a global simulating halt decider No > H_Hat ever completes its first line of code. Because a world with a global halt decider is NOT Turing Complete, especially if it has a broken rule like this. The fact that when we run H_Hat(H_Hat) outside of any halt decider come to a halt in finite time says that ANY Halt decider that decides it is non-Halting must be WRONG, as Halting is not Non-Halting.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-09 14:34 +0100 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <877dj3w49a.fsf@bsb.me.uk> |
| In reply to | #34634 |
Richard Damon <Richard@Damon-Family.org> writes:
> On 6/8/21 10:03 PM, olcott wrote:
>> On 6/8/2021 8:17 PM, Richard Damon wrote:
...
>>> Halting means it does come to a stop, Non-Halting means it never comes
>>> to a stop.
>>
>> This is self-evident (true on the basis of the meaning of its words).
>> Every computation that only stops because its simulation was aborted is
>> not a halting computation even when its simulating halt decider forces
>> it to stop.
>
> It is more self evident that a computation that Halts is a Halting
> Computation.
He know this very well. I asked him address a number of point one of
which was:
(B) Every computation that halts, for whatever reason, is a halting
computation.
His reply was "OK".
I asked (B) because he admitted that the key computation halts but was
for ever adding "only because...". He know the reason does not matter,
but he's ignoring that now.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-09 09:36 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17)(infinite recursion) |
| Message-ID | <ZPOdnY9lQrZXTF39nZ2dnUU7-LfNnZ2d@giganews.com> |
| In reply to | #34643 |
On 6/9/2021 8:34 AM, Ben Bacarisse wrote:
> Richard Damon <Richard@Damon-Family.org> writes:
>
>> On 6/8/21 10:03 PM, olcott wrote:
>>> On 6/8/2021 8:17 PM, Richard Damon wrote:
> ...
>>>> Halting means it does come to a stop, Non-Halting means it never comes
>>>> to a stop.
>>>
>>> This is self-evident (true on the basis of the meaning of its words).
>>> Every computation that only stops because its simulation was aborted is
>>> not a halting computation even when its simulating halt decider forces
>>> it to stop.
>>
>> It is more self evident that a computation that Halts is a Halting
>> Computation.
>
> He know this very well. I asked him address a number of point one of
> which was:
>
> (B) Every computation that halts, for whatever reason, is a halting
> computation.
>
> His reply was "OK".
>
> I asked (B) because he admitted that the key computation halts but was
> for ever adding "only because...". He know the reason does not matter,
> but he's ignoring that now.
>
And you agreed that an infinite loop that had its simulation aborted is
still an infinite loop even when it has been forced to stop.
Then it is likewise for infinite recursion and infinitely nested
simulation.
int main()
{
H_Hat((u32)H_Hat);
}
specifies an an infinite sequence of nested simulations that is aborted
on its third call to H.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-08 03:26 +0100 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17) |
| Message-ID | <87im2pw0qo.fsf@bsb.me.uk> |
| In reply to | #34555 |
Richard Damon <Richard@Damon-Family.org> writes: > You are free to create a DIFFERENT system, and in that define your > Olcott-Halting however you want, but it is a DIFFERENT system and does > not apply to the original or any of that original's uses. And it too is undecidable in the general case! Whilst this silly notation was concocted as an excuse for returning the wrong result for the one instance PO obsesses about, he's claimed to have a design that detects those, and only those, computations that have to be stopped. But that's impossible. An infinity to halting computations have to be stopped early or he'd have a conventional halting decider. -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 6 of 9 — ← Prev page 1 2 3 4 5 [6] 7 8 9 Next page →
Back to top | Article view | comp.theory
csiph-web