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 7 of 9 — ← Prev page 1 2 3 4 5 6 [7] 8 9 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-07 21:42 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17) |
| Message-ID | <EL2dnY_xYeOTRCP9nZ2dnUU7-RHNnZ2d@giganews.com> |
| In reply to | #34558 |
On 6/7/2021 9:26 PM, Ben Bacarisse wrote: > 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. > 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. On the basis that I provided a deep learning algorithm might be able to derive a progressively more complete partial halt decider. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Andy Walker <anw@cuboid.co.uk> |
|---|---|
| Date | 2021-06-08 15:02 +0100 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17) |
| Message-ID | <s9nt94$110s$1@gioia.aioe.org> |
| In reply to | #34561 |
On 08/06/2021 03:42, 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.
Simulation is your red herring. There are other ways to determine
whether or not an instance halts. That apart, the "conventional proofs"
don't pretend to prove that, so what [you think] you have shown has been
known "forever". The HP is not about that; rather, it shows that no TM
[equivalently, no C program] can perform that division.
> On the basis that I provided a deep learning algorithm might be able
> to derive a progressively more complete partial halt decider.
That too has "always" been known. All you have to do for that is
to simulate for longer and longer periods. But what the HP shows is that
"progressively more complete" never reaches an end. You need more and more
complex algorithms to extend the instances your algorithm can decide. Not
/much/ more complex; we're back to Busy Beaver territory, and each extra
state for a BB hugely extends the time it can run and so the analysis it
can perform. That /could/ merely be more simulation; but it could also be
more detailed analysis of the instance. The problem for you is then that
BB-type functions, despite merely being large numbers, are not computable.
--
Andy Walker, Nottingham.
Andy's music pages: www.cuboid.me.uk/andy/Music
Composer of the day: www.cuboid.me.uk/andy/Music/Composers/Byrd
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-08 09:14 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17) |
| Message-ID | <qMydnWCFk4bE5iL9nZ2dnUU7-WnNnZ2d@giganews.com> |
| In reply to | #34574 |
On 6/8/2021 9:02 AM, Andy Walker wrote:
> On 08/06/2021 03:42, 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.
>
> Simulation is your red herring. There are other ways to determine
> whether or not an instance halts.
The other ways are dumbfounded by the conventional self-referential
halting problem proof counter-example.
> That apart, the "conventional proofs"
> don't pretend to prove that, so what [you think] you have shown has been
> known "forever". The HP is not about that; rather, it shows that no TM
> [equivalently, no C program] can perform that division.
>
Yes and when you make sure to not pay attention to what I am saying you
can retain that misconception.
void H_Hat(u32 P)
{
u32 Input_Halts = H(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
H_Hat((u32)H_Hat);
}
It is a very easily verifiable fact that unless the input to H has its
simulation terminated H_Hat would never halt.
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.
Therefore H correctly decides that its input does not represent a
halting computation.
Since this <is> a simplified version of the Linz template and the same
reasoning has been applied to the actual Linz Ĥ applied to its own
Turing machine description: ŵ, the Linz proof has been refuted.
>> On the basis that I provided a deep learning algorithm might be able
>> to derive a progressively more complete partial halt decider.
>
> That too has "always" been known. All you have to do for that is
> to simulate for longer and longer periods. But what the HP shows is that
> "progressively more complete" never reaches an end. You need more and more
> complex algorithms to extend the instances your algorithm can decide. Not
> /much/ more complex; we're back to Busy Beaver territory, and each extra
> state for a BB hugely extends the time it can run and so the analysis it
> can perform. That /could/ merely be more simulation; but it could also be
> more detailed analysis of the instance. The problem for you is then that
> BB-type functions, despite merely being large numbers, are not computable.
>
--
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-07 22:45 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17) |
| Message-ID | <QQAvI.94290$5%7.13832@fx13.iad> |
| In reply to | #34558 |
On 6/7/21 10:26 PM, Ben Bacarisse wrote: > 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. > Yes, he reaches his stated goal of making that class of proofs not work in his system, but halting is still not deciable, unless it is considered decidable because the system is inconsistent which mean ALL machines can be 'proven' to be Halting and Non-Halting at the same time (due to the principle of the propagation of inconsistency).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-07 21:56 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17) |
| Message-ID | <-4WdnR0yAt7dQSP9nZ2dnUU7-SXNnZ2d@giganews.com> |
| In reply to | #34562 |
On 6/7/2021 9:45 PM, Richard Damon wrote:
> On 6/7/21 10:26 PM, Ben Bacarisse wrote:
>> 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.
>>
>
> Yes, he reaches his stated goal of making that class of proofs not work
> in his system, but halting is still not deciable, unless it is
> considered decidable because the system is inconsistent which mean ALL
> machines can be 'proven' to be Halting and Non-Halting at the same time
> (due to the principle of the propagation of inconsistency).
>
Every computation that would never halt unless its simulation is aborted
is a computation that specifies infinite execution even after it has
been forced to halt.
void Infinite_Loop()
{
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt2 = H((u32)Infinite_Loop, (u32)Infinite_Loop);
Output("Input_Would_Halt2 = ", Input_Would_Halt2);
}
_Infinite_Loop()
[00000a90](01) 55 push ebp
[00000a91](02) 8bec mov ebp,esp
[00000a93](02) ebfe jmp 00000a93
[00000a95](01) 5d pop ebp
[00000a96](01) c3 ret
Size in bytes:(0007) [00000a96]
_main()
[00000b40](01) 55 push ebp
[00000b41](02) 8bec mov ebp,esp
[00000b43](01) 51 push ecx
[00000b44](05) 68900a0000 push 00000a90
[00000b49](05) 68900a0000 push 00000a90
[00000b4e](05) e8edfdffff call 00000940
[00000b53](03) 83c408 add esp,+08
[00000b56](03) 8945fc mov [ebp-04],eax
[00000b59](03) 8b45fc mov eax,[ebp-04]
[00000b5c](01) 50 push eax
[00000b5d](05) 682b030000 push 0000032b
[00000b62](05) e8f9f7ffff call 00000360
[00000b67](03) 83c408 add esp,+08
[00000b6a](02) 33c0 xor eax,eax
[00000b6c](02) 8be5 mov esp,ebp
[00000b6e](01) 5d pop ebp
[00000b6f](01) c3 ret
Size in bytes:(0048) [00000b6f]
===============================
...[00000b40][00101533][00000000](01) 55 push ebp
...[00000b41][00101533][00000000](02) 8bec mov ebp,esp
...[00000b43][0010152f][00000000](01) 51 push ecx
...[00000b44][0010152b][00000a90](05) 68900a0000 push 00000a90
...[00000b49][00101527][00000a90](05) 68900a0000 push 00000a90
...[00000b4e][00101523][00000b53](05) e8edfdffff call 00000940
Begin Local Halt Decider Simulation at Machine Address:a90
...[00000a90][002115d3][002115d7](01) 55 push ebp
...[00000a91][002115d3][002115d7](02) 8bec mov ebp,esp
...[00000a93][002115d3][002115d7](02) ebfe jmp 00000a93
...[00000a93][002115d3][002115d7](02) ebfe jmp 00000a93
Local Halt Decider: Infinite Loop Detected Simulation Stopped
...[00000b53][0010152f][00000000](03) 83c408 add esp,+08
...[00000b56][0010152f][00000000](03) 8945fc mov [ebp-04],eax
...[00000b59][0010152f][00000000](03) 8b45fc mov eax,[ebp-04]
...[00000b5c][0010152b][00000000](01) 50 push eax
...[00000b5d][00101527][0000032b](05) 682b030000 push 0000032b
---[00000b62][00101527][0000032b](05) e8f9f7ffff call 00000360
Input_Would_Halt2 = 0
...[00000b67][0010152f][00000000](03) 83c408 add esp,+08
...[00000b6a][0010152f][00000000](02) 33c0 xor eax,eax
...[00000b6c][00101533][00000000](02) 8be5 mov esp,ebp
...[00000b6e][00101537][00100000](01) 5d pop ebp
...[00000b6f][0010153b][00000050](01) c3 ret
Number_of_User_Instructions(21)
Number of Instructions Executed(640)
--
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-07 23:12 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V17) |
| Message-ID | <KeBvI.579335$ST2.71399@fx47.iad> |
| In reply to | #34564 |
On 6/7/21 10:56 PM, olcott wrote:
> On 6/7/2021 9:45 PM, Richard Damon wrote:
>> On 6/7/21 10:26 PM, Ben Bacarisse wrote:
>>> 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.
>>>
>>
>> Yes, he reaches his stated goal of making that class of proofs not work
>> in his system, but halting is still not deciable, unless it is
>> considered decidable because the system is inconsistent which mean ALL
>> machines can be 'proven' to be Halting and Non-Halting at the same time
>> (due to the principle of the propagation of inconsistency).
>>
>
> Every computation that would never halt unless its simulation is aborted
> is a computation that specifies infinite execution even after it has
> been forced to halt.
H_Hat is a Halting Comptation, as it DOES come to a Halt, even though
the decider within it aborted a computation that specified an APPARENTLY
infinite execution.
>
> void Infinite_Loop()
> {
> HERE: goto HERE;
> }
>
> int main()
> {
> u32 Input_Would_Halt2 = H((u32)Infinite_Loop, (u32)Infinite_Loop);
> Output("Input_Would_Halt2 = ", Input_Would_Halt2);
> }
>
> _Infinite_Loop()
> [00000a90](01) 55 push ebp
> [00000a91](02) 8bec mov ebp,esp
> [00000a93](02) ebfe jmp 00000a93
> [00000a95](01) 5d pop ebp
> [00000a96](01) c3 ret
> Size in bytes:(0007) [00000a96]
>
> _main()
> [00000b40](01) 55 push ebp
> [00000b41](02) 8bec mov ebp,esp
> [00000b43](01) 51 push ecx
> [00000b44](05) 68900a0000 push 00000a90
> [00000b49](05) 68900a0000 push 00000a90
> [00000b4e](05) e8edfdffff call 00000940
> [00000b53](03) 83c408 add esp,+08
> [00000b56](03) 8945fc mov [ebp-04],eax
> [00000b59](03) 8b45fc mov eax,[ebp-04]
> [00000b5c](01) 50 push eax
> [00000b5d](05) 682b030000 push 0000032b
> [00000b62](05) e8f9f7ffff call 00000360
> [00000b67](03) 83c408 add esp,+08
> [00000b6a](02) 33c0 xor eax,eax
> [00000b6c](02) 8be5 mov esp,ebp
> [00000b6e](01) 5d pop ebp
> [00000b6f](01) c3 ret
> Size in bytes:(0048) [00000b6f]
>
> ===============================
> ...[00000b40][00101533][00000000](01) 55 push ebp
> ...[00000b41][00101533][00000000](02) 8bec mov ebp,esp
> ...[00000b43][0010152f][00000000](01) 51 push ecx
> ...[00000b44][0010152b][00000a90](05) 68900a0000 push 00000a90
> ...[00000b49][00101527][00000a90](05) 68900a0000 push 00000a90
> ...[00000b4e][00101523][00000b53](05) e8edfdffff call 00000940
> Begin Local Halt Decider Simulation at Machine Address:a90
> ...[00000a90][002115d3][002115d7](01) 55 push ebp
> ...[00000a91][002115d3][002115d7](02) 8bec mov ebp,esp
> ...[00000a93][002115d3][002115d7](02) ebfe jmp 00000a93
> ...[00000a93][002115d3][002115d7](02) ebfe jmp 00000a93
> Local Halt Decider: Infinite Loop Detected Simulation Stopped
> ...[00000b53][0010152f][00000000](03) 83c408 add esp,+08
> ...[00000b56][0010152f][00000000](03) 8945fc mov [ebp-04],eax
> ...[00000b59][0010152f][00000000](03) 8b45fc mov eax,[ebp-04]
> ...[00000b5c][0010152b][00000000](01) 50 push eax
> ...[00000b5d][00101527][0000032b](05) 682b030000 push 0000032b
> ---[00000b62][00101527][0000032b](05) e8f9f7ffff call 00000360
> Input_Would_Halt2 = 0
> ...[00000b67][0010152f][00000000](03) 83c408 add esp,+08
> ...[00000b6a][0010152f][00000000](02) 33c0 xor eax,eax
> ...[00000b6c][00101533][00000000](02) 8be5 mov esp,ebp
> ...[00000b6e][00101537][00100000](01) 5d pop ebp
> ...[00000b6f][0010153b][00000050](01) c3 ret
> Number_of_User_Instructions(21)
> Number of Instructions Executed(640)
>
I think time to bring back this PROOF the YOU provided that H_Hat(H_Hat)
is Halting:
On 4/27/21 12:55 AM, olcott wrote:
Message-ID: <Teudndbu59GVBBr9nZ2dnUU7-V2dnZ2d@giganews.com>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
>
> int main()
> {
> H_Hat((u32)H_Hat);
> }
>
>
> _H_Hat()
> [00000b98](01) 55 push ebp
> [00000b99](02) 8bec mov ebp,esp
>
[00000b9b](01) 51 push ecx
> [00000b9c](03) 8b4508 mov eax,[ebp+08]
> [00000b9f](01) 50 push eax
> [00000ba0](03) 8b4d08 mov ecx,[ebp+08]
> [00000ba3](01) 51 push ecx
> [00000ba4](05) e88ffdffff call 00000938
> [00000ba9](03) 83c408 add esp,+08
> [00000bac](03) 8945fc mov [ebp-04],eax
> [00000baf](04) 837dfc00 cmp dword [ebp-04],+00
> [00000bb3](02) 7402 jz 00000bb7
> [00000bb5](02) ebfe jmp 00000bb5
> [00000bb7](02) 8be5 mov esp,ebp
> [00000bb9](01) 5d pop ebp
> [00000bba](01) c3 ret
> Size in bytes:(0035) [00000bba]
>
> _main()
> [00000bc8](01) 55 push ebp
> [00000bc9](02) 8bec mov ebp,esp
> [00000bcb](05) 68980b0000 push 00000b98
> [00000bd0](05) e8c3ffffff call 00000b98
> [00000bd5](03) 83c404 add esp,+04
> [00000bd8](02) 33c0 xor eax,eax
> [00000bda](01) 5d pop ebp
> [00000bdb](01) c3 ret
> Size in bytes:(0020) [00000bdb]
>
> ===============================
> ...[00000bc8][001015d4][00000000](01) 55 push ebp
> ...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
> ...[00000bcb][001015d0][00000b98](05) 68980b0000 push 00000b98
> ...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call 00000b98
> ...[00000b98][001015c8][001015d4](01) 55 push ebp
> ...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
> ...[00000b9b][001015c4][00000000](01) 51 push ecx
> ...[00000b9c][001015c4][00000000](03) 8b4508 mov eax,[ebp+08]
> ...[00000b9f][001015c0][00000b98](01) 50 push eax
> ...[00000ba0][001015c0][00000b98](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000ba3][001015bc][00000b98](01) 51 push ecx
> ...[00000ba4][001015b8][00000ba9](05) e88ffdffff call 00000938
> Begin Local Halt Decider Simulation at Machine Address:b98
> ...[00000b98][00211674][00211678](01) 55 push ebp
> ...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
> ...[00000b9b][00211670][00201644](01) 51 push ecx
> ...[00000b9c][00211670][00201644](03) 8b4508 mov eax,[ebp+08]
> ...[00000b9f][0021166c][00000b98](01) 50 push eax
> ...[00000ba0][0021166c][00000b98](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000ba3][00211668][00000b98](01) 51 push ecx
> ...[00000ba4][00211664][00000ba9](05) e88ffdffff call 00000938
> ...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
> ...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
> ...[00000b9b][0025c098][0024c06c](01) 51 push ecx
> ...[00000b9c][0025c098][0024c06c](03) 8b4508 mov eax,[ebp+08]
> ...[00000b9f][0025c094][00000b98](01) 50 push eax
> ...[00000ba0][0025c094][00000b98](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000ba3][0025c090][00000b98](01) 51 push ecx
> ...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call 00000938
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
Above decision was from the call the Halts inside H_Hat, deciding that
H_Hat(H_Hat) seems to be non-halting, it then returns that answer and is
processed below:
> ...[00000ba9][001015c4][00000000](03) 83c408 add esp,+08
> ...[00000bac][001015c4][00000000](03) 8945fc mov [ebp-04],eax
> ...[00000baf][001015c4][00000000](04) 837dfc00 cmp dword [ebp-04],+00
> ...[00000bb3][001015c4][00000000](02) 7402 jz 00000bb7
> ...[00000bb7][001015c8][001015d4](02) 8be5 mov esp,ebp
> ...[00000bb9][001015cc][00000bd5](01) 5d pop ebp
> ...[00000bba][001015d0][00000b98](01) c3 ret
> ...[00000bd5][001015d4][00000000](03) 83c404 add esp,+04
> ...[00000bd8][001015d4][00000000](02) 33c0 xor eax,eax
> ...[00000bda][001015d8][00100000](01) 5d pop ebp
> ...[00000bdb][001015dc][00000098](01) c3 ret
SEE IT HALTED!
> Number_of_User_Instructions(39)
> Number of Instructions Executed(26567)
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-05 08:00 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V13) - |
| Message-ID | <1_-dncavjaP06Cb9nZ2dnUU7-LHNnZ2d@giganews.com> |
| In reply to | #34470 |
On 6/5/2021 5:36 AM, Malcolm McLean wrote: > On Friday, 4 June 2021 at 17:38:18 UTC+1, olcott wrote: >> On 6/4/2021 10:59 AM, Malcolm McLean wrote: >>> On Friday, 4 June 2021 at 15:40:08 UTC+1, olcott wrote: >>>> On 6/4/2021 9:16 AM, Andy Walker wrote: >>>>> On 03/06/2021 14:22, olcott wrote: >>>>>>>> The maximum scope of my investigation since 2004 is to show that the >>>>>>>> standard template of the halting problem proofs <is> decidable >>>>>>> That much has never been in doubt; you don't need to expend >>>>>>> energy and thousands of articles showing what we already know. >>>>>>>> thus refuting these proofs. >>>>>>> But that doesn't follow. >>>>>> The you could do more to point out a mistake than simply say that you >>>>>> don't believe what I am saying. >>>>> I could, but you're paying neither me nor much attention to >>>>> what I've commented on in previous articles, so there's little point. >>>> No one has actually pointed out any mistake. They pointed out what they >>>> misunderstood to be a mistake and then refused to pay attention to my >>>> correction of their error. >>>> >>> There's a poor use of terminology. >> Yes I will agree with that, none-the-less issues such as this have no >> bearing on the correctness of the essence of my refutation of the >> proofs. This is at most a credibility issue and not a validity issue in >> the slightest sense. >> > You say "The maximum scope of my investigation since 2004 is to show > that the standard template of the halting problem proofs <is> decideable" > Andy Walker's response was "That much has never been in doubt ...." > > Now I know what you mean. What you mean is that you believe you can show > that the cases presented by the halting proofs don't in fact present insurmountable > problems for a decider. > > If you are making an uncontroversial point, people might forgive you for lax > use of terminology. If you are claiming to revolutionise the field, and it becomes > clear that you don't know the accepted terminology, people are much more likely > to simply dismiss what you are saying. Especially if it looks like the non-conventional > use of terminology is leading to an assumption which is in error - in this case, > that if we can build a decider which correctly classifies H_Hat(H_Hat) then > we've refuted Linz's proof. > Since I have chosen alternate terminology that does accurately say what I mean and anchored this in fully operational C this should not be much of a problem for people that honestly want to accurately critique my work. So far I have found no ideal sources for improving my use of terminology. I am simply asking whether or not anyone can find any mistake in how I shown that H correctly decides Ĥ on the first page of this paper: https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation The only thing that I have every gotten back in a reply to this question is one false assumption or another based on almost no review at all. -- 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-05 12:19 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V13) - |
| Message-ID | <GuNuI.11825$J21.2069@fx40.iad> |
| In reply to | #34472 |
On 6/5/21 9:00 AM, olcott wrote: > Since I have chosen alternate terminology that does accurately say what > I mean and anchored this in fully operational C this should not be much > of a problem for people that honestly want to accurately critique my work. > > So far I have found no ideal sources for improving my use of > terminology. I am simply asking whether or not anyone can find any > mistake in how I shown that H correctly decides Ĥ on the first page of > this paper: > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > > The only thing that I have every gotten back in a reply to this question > is one false assumption or another based on almost no review at all. > The fundamental error in this paper is that it claims to apply to proofs like Linz, but uses fundamentally different definitions. This is a violation of the basic tenets of logic. YOU CAN'T CHANGE THE DEFINITIONS OF A SYSTEM AND HAVE IT STILL HOLD. If your definition of 'Halting' Doesn't match the terminology of Computation Theory, then your logic doesn't apply to it. Basically, you are playing the Humpty-Dumpty game, and are being called out on it. You are perfectly free to create your own logic system with your alternate definitions, it just then gets put on you to show what use it has and if it actually means anything. The one thing you can't do is just translate you results to the standard theory. That is like working in proof using the axioms of Spherical Geometry, and then trying to apply them to the problem of Plane Geometry.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-05 21:42 +0100 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V13) - |
| Message-ID | <8735twxcuo.fsf@bsb.me.uk> |
| In reply to | #34470 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > If you are making an uncontroversial point, people might forgive you > for lax use of terminology. If you are claiming to revolutionise the > field, and it becomes clear that you don't know the accepted > terminology, people are much more likely to simply dismiss what you > are saying. You are being studiously kind, which is commendable, but this is not an accurate characterisation of PO's use of terminology. He is deliberately blasé about terms because he has no qualms about deceiving his readers. When, in the midst of what I think was a delusional episode, he claimed to have two actual Turing machines that do the impossible, he really did mean it. Other posts at the time make it quite clear that he meant what Linz means by a Turing machine. It was only when he had to retreat from that position that he pretended he had always meant "a fragment of C-like code". That's not a "lax use of terminology". Then last year, he made the mistake of being crystal clear that the halting of one computation should be used as the status of another. It's not "lax use of terminology" to keep calling it "non-halting" when halting computations are included. It's not a "lax use of terminology" to keep talking about "the halting problem" when he rejects the basic definition: that "yes" is the correct answer (from a decider) for all inputs representing finite computations and "no" otherwise. And you can't have missed the fact that he routinely lies about what other people have said or believe. Now some of this can be explained as the result of ignorance combined with arrogance, but all of it? Surely no one can be as confused about their own position as this would suggest? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-05 15:55 -0500 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V16) |
| Message-ID | <k-qdnZIim-4reSb9nZ2dnUU7-XHNnZ2d@giganews.com> |
| In reply to | #34485 |
On 6/5/2021 3:42 PM, Ben Bacarisse wrote:
> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>
>> If you are making an uncontroversial point, people might forgive you
>> for lax use of terminology. If you are claiming to revolutionise the
>> field, and it becomes clear that you don't know the accepted
>> terminology, people are much more likely to simply dismiss what you
>> are saying.
>
> You are being studiously kind, which is commendable, but this is not an
> accurate characterisation of PO's use of terminology. He is
> deliberately blasé about terms because he has no qualms about deceiving
> his readers.
If this was actually true then you could point to some mistake
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
> When, in the midst of what I think was a delusional
> episode, he claimed to have two actual Turing machines that do the
> impossible, he really did mean it. Other posts at the time make it
> quite clear that he meant what Linz means by a Turing machine. It was
> only when he had to retreat from that position that he pretended he had
> always meant "a fragment of C-like code". That's not a "lax use of
> terminology".
>
> Then last year, he made the mistake of being crystal clear that the
> halting of one computation should be used as the status of another.
I have changed the wording of this completely. I found an enormously
simpler way of conveying the underlying idea so that the whole proxy
inputs idea has been superseded:
A simulating halt decider that never stops simulating
its input is simply a simulator on this input.
> It's not "lax use of terminology" to keep calling it "non-halting" when
> halting computations are included. It's not a "lax use of terminology"
> to keep talking about "the halting problem" when he rejects the basic
> definition: that "yes" is the correct answer (from a decider) for all
> inputs representing finite computations and "no" otherwise.
>
You expressly agreed to the key basis of my proof:
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.
> And you can't have missed the fact that he routinely lies about what
> other people have said or believe.
>
> Now some of this can be explained as the result of ignorance combined
> with arrogance, but all of it? Surely no one can be as confused about
> their own position as this would suggest?
>
You have always been quite an asshole, none-the-less you have agreed
with the key basis of my proof.
int Simulate(u32 P, u32 I) {
((void(*)(u32))P)(I);
return 1;
}
// Simplified Linz Ĥ (Linz:1990:319)
void H_Hat(u32 P) {
// Linz H as a simulating partial halt decider
u32 Input_Halts = H(P, P);
if (Input_Halts)
HERE: goto HERE;
}
void H_Hat2(u32 P) {
u32 Input_Halts = Simulate(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main() {
H_Hat2((u32)H_Hat2);
H_Hat((u32)H_Hat);
}
Anyone that knows C programming very well will know that line 1 of
main() won't halt and line 2 of main() will only halt if simulating
partial halt decider H() stops simulating H_Hat(). A simulating halt
decider that never stops simulating its input is simply a simulator on
this input.
When we know that the UTM simulation of TM Description P on input I
would never halt we know that the execution of TM P(I) would never halt.
On this basis we know that any computation that must have its simulation
aborted to prevent its otherwise infinite execution is correctly
rejected as non-halting.
Linz, Peter 1990. An Introduction to Formal Languages and Automata.
Lexington/Toronto: D. C. Heath and Company.
--
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-05 18:57 -0400 |
| Subject | Re: Halting problem undecidability and infinitely nested simulation(V16) |
| Message-ID | <QjTuI.32112$9a1.28081@fx38.iad> |
| In reply to | #34486 |
On 6/5/21 4:55 PM, olcott wrote: > On 6/5/2021 3:42 PM, Ben Bacarisse wrote: ] >> It's not "lax use of terminology" to keep calling it "non-halting" when >> halting computations are included. It's not a "lax use of terminology" >> to keep talking about "the halting problem" when he rejects the basic >> definition: that "yes" is the correct answer (from a decider) for all >> inputs representing finite computations and "no" otherwise. >> > > You expressly agreed to the key basis of my proof: > I would say that every 'quote' you make from people needs to be carefully examined to make sure that it isn't a case of you changing the meaning of key words or moving things out of context. I will point out that you also have been guilt of apparently DELIBERATELY misquoting people making their words mean just to opposite of what they said, by trimming out the conditions they included. I will also point out that just because you confused someone enough for them to make a misstatement doesn't make what they said as true. Ultimately, you are going to need to figure out how to actually PROVE your assertions, rather than just challenge people to find the flaws.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-02 20:15 -0500 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <h6qdnWjWbL_PsCX9nZ2dnUU7-X_NnZ2d@giganews.com> |
| In reply to | #34408 |
On 6/2/2021 7:20 PM, Richard Damon wrote: > On 6/2/21 10:40 AM, olcott wrote: >> On 6/2/2021 7:32 AM, Ben Bacarisse wrote: >>> Richard Damon <Richard@Damon-Family.org> writes: >>> >>>> You need to learn that there ARE things that are impossible. >>> >>> This raises an interesting question. If PO were a confused student, >>> I'd want to find out how deep the confusion goes but asking if he >>> believes that there are any well-defined sets of strings that are not >>> decidable. PO, however, never enters into such exchanges, preferring as >>> he does to keep his "lazer-like focus" on being wrong about halting. >>> >> >> As I have already said many times all of the paradoxes and their math >> equivalent of undecidability are the incorrect application of semantics. >> >> Note that D computes the opposite of the diagonal entries. >> The contradiction occurs at the point of the question mark >> where the entry must be the opposite of itself... (Sipser:1997:167). > > Right, and that is the proof the D can't exist, and thus that H can't exist. > > >> >> It looks like the diagonalization proof boils down to the impossible >> requirement that H(D, ⟨D⟩) == H(⟨D⟩) && H(D, ⟨D⟩) != H(⟨D⟩) > > Right, which proves that H can't exist. > >> >> In the case where H must return the value that D returns, D has no >> value because it must be aborted before each obtaining any value: >> H(D, ⟨D⟩). >> >> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston: >> PWS Publishing Company (165-167) >> > > As I said, it just proves that H can't exist, not that the problem is > somehow 'wrong' > > Impossible problems occur all the time. > > Maybe a good example is how to explain to an Olcott what Truth actually is. > Richard Damon has an IQ == Infinity && Richard Damon has an IQ != Infinity ∴ Richard Damon does not exist. -- 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-02 21:45 -0400 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <SuWtI.351980$Skn4.299068@fx17.iad> |
| In reply to | #34413 |
On 6/2/21 9:15 PM, olcott wrote: > On 6/2/2021 7:20 PM, Richard Damon wrote: >> As I said, it just proves that H can't exist, not that the problem is >> somehow 'wrong' >> >> Impossible problems occur all the time. >> >> Maybe a good example is how to explain to an Olcott what Truth >> actually is. >> > > Richard Damon has an IQ == Infinity > && Richard Damon has an IQ != Infinity > ∴ Richard Damon does not exist. > But René Descartes would disagree, as I think, therefore I am. Note, I NEVER have claimed an IQ of infinity, and that by itself would be an impossibility by the definition of IQ. (or, are YOU asserting that claim?) Since IQ is based on the normal curve, you can compute what is the highest possible measurable score based on the sample population size. An infinite IQ, would require an infinite population, which is impossible in a finite universe.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-02 20:48 -0500 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <eqadnbvBJ_OYqCX9nZ2dnUU7-V-dnZ2d@giganews.com> |
| In reply to | #34414 |
On 6/2/2021 8:45 PM, Richard Damon wrote: > On 6/2/21 9:15 PM, olcott wrote: >> On 6/2/2021 7:20 PM, Richard Damon wrote: > >>> As I said, it just proves that H can't exist, not that the problem is >>> somehow 'wrong' >>> >>> Impossible problems occur all the time. >>> >>> Maybe a good example is how to explain to an Olcott what Truth >>> actually is. >>> >> >> Richard Damon has an IQ == Infinity >> && Richard Damon has an IQ != Infinity >> ∴ Richard Damon does not exist. >> > > But René Descartes would disagree, as I think, therefore I am. > > Note, I NEVER have claimed an IQ of infinity, and that by itself would > be an impossibility by the definition of IQ. (or, are YOU asserting that > claim?) > > Since IQ is based on the normal curve, you can compute what is the > highest possible measurable score based on the sample population size. > An infinite IQ, would require an infinite population, which is > impossible in a finite universe. > Richard Damon likes cats && Richard Damon does not like cats ∴ Richard Damon does not exist. This is the same reasoning as the diagonal proof so I gave it up and went back to Linz. -- 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-02 22:50 -0400 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <PrXtI.202103$lyv9.44984@fx35.iad> |
| In reply to | #34416 |
On 6/2/21 9:48 PM, olcott wrote: > On 6/2/2021 8:45 PM, Richard Damon wrote: >> On 6/2/21 9:15 PM, olcott wrote: >>> On 6/2/2021 7:20 PM, Richard Damon wrote: >> >>>> As I said, it just proves that H can't exist, not that the problem is >>>> somehow 'wrong' >>>> >>>> Impossible problems occur all the time. >>>> >>>> Maybe a good example is how to explain to an Olcott what Truth >>>> actually is. >>>> >>> >>> Richard Damon has an IQ == Infinity >>> && Richard Damon has an IQ != Infinity >>> ∴ Richard Damon does not exist. >>> >> >> But René Descartes would disagree, as I think, therefore I am. >> >> Note, I NEVER have claimed an IQ of infinity, and that by itself would >> be an impossibility by the definition of IQ. (or, are YOU asserting that >> claim?) >> >> Since IQ is based on the normal curve, you can compute what is the >> highest possible measurable score based on the sample population size. >> An infinite IQ, would require an infinite population, which is >> impossible in a finite universe. >> > > Richard Damon likes cats > && Richard Damon does not like cats > ∴ Richard Damon does not exist. > > This is the same reasoning as the diagonal proof so > I gave it up and went back to Linz. > Nope, your don't understand the problem, so it is good that you gave up on it. Your problem is that you don't seem to be able to understand the properties of the infinite. A common problem when you try to work with the limitation of all Truth is Provable, but you don't even really work under it, because you don't actually try to prove anything, just make rhetorcial arguemnts based on sloppy use of language.
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-06-02 21:11 -0600 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <s99h8j$h4a$1@dont-email.me> |
| In reply to | #34416 |
On 2021-06-02 19:48, olcott wrote: > On 6/2/2021 8:45 PM, Richard Damon wrote: >> On 6/2/21 9:15 PM, olcott wrote: >>> On 6/2/2021 7:20 PM, Richard Damon wrote: >> >>>> As I said, it just proves that H can't exist, not that the problem is >>>> somehow 'wrong' >>>> >>>> Impossible problems occur all the time. >>>> >>>> Maybe a good example is how to explain to an Olcott what Truth >>>> actually is. >>>> >>> >>> Richard Damon has an IQ == Infinity >>> && Richard Damon has an IQ != Infinity >>> ∴ Richard Damon does not exist. >>> >> >> But René Descartes would disagree, as I think, therefore I am. >> >> Note, I NEVER have claimed an IQ of infinity, and that by itself would >> be an impossibility by the definition of IQ. (or, are YOU asserting that >> claim?) >> >> Since IQ is based on the normal curve, you can compute what is the >> highest possible measurable score based on the sample population size. >> An infinite IQ, would require an infinite population, which is >> impossible in a finite universe. >> > > Richard Damon likes cats > && Richard Damon does not like cats > ∴ Richard Damon does not exist. > > This is the same reasoning as the diagonal proof so > I gave it up and went back to Linz. All you've demonstrated here is that you are entirely clueless about how proofs by contradiction work. In a proof by contradiction one starts with an assumption (in the case of the diagonalization argument, the assumption that a universal halt decider exists) and then show that one can logically derive two contradictory statements *from that assumption*. Based on that one concludes that the initial assumption is false. All you've done is pulled two contradictory statements out of thin air. You haven't show that either are logically derivable from the assumption that Richard Damon exists. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-02 22:16 -0500 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <UdudnQ6CvOo51CX9nZ2dnUU7-efNnZ2d@giganews.com> |
| In reply to | #34420 |
On 6/2/2021 10:11 PM, André G. Isaak wrote: > On 2021-06-02 19:48, olcott wrote: >> On 6/2/2021 8:45 PM, Richard Damon wrote: >>> On 6/2/21 9:15 PM, olcott wrote: >>>> On 6/2/2021 7:20 PM, Richard Damon wrote: >>> >>>>> As I said, it just proves that H can't exist, not that the problem is >>>>> somehow 'wrong' >>>>> >>>>> Impossible problems occur all the time. >>>>> >>>>> Maybe a good example is how to explain to an Olcott what Truth >>>>> actually is. >>>>> >>>> >>>> Richard Damon has an IQ == Infinity >>>> && Richard Damon has an IQ != Infinity >>>> ∴ Richard Damon does not exist. >>>> >>> >>> But René Descartes would disagree, as I think, therefore I am. >>> >>> Note, I NEVER have claimed an IQ of infinity, and that by itself would >>> be an impossibility by the definition of IQ. (or, are YOU asserting that >>> claim?) >>> >>> Since IQ is based on the normal curve, you can compute what is the >>> highest possible measurable score based on the sample population size. >>> An infinite IQ, would require an infinite population, which is >>> impossible in a finite universe. >>> >> >> Richard Damon likes cats >> && Richard Damon does not like cats >> ∴ Richard Damon does not exist. >> >> This is the same reasoning as the diagonal proof so >> I gave it up and went back to Linz. > > All you've demonstrated here is that you are entirely clueless about how > proofs by contradiction work. > > In a proof by contradiction one starts with an assumption (in the case > of the diagonalization argument, the assumption that a universal halt > decider exists) and then show that one can logically derive two > contradictory statements *from that assumption*. Based on that one > concludes that the initial assumption is false. > > All you've done is pulled two contradictory statements out of thin air. > You haven't show that either are logically derivable from the assumption > that Richard Damon exists. > > André > I have given up on the Sipser proof and am back to the Linz proof because it is an enormously more effective basis for my refutation. The Sipser proof adds the extraneous complexity of an extra layer of indirection. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-02 22:51 -0500 |
| Subject | Re: Refuting the Linz Halting Problem Proof (V?) |
| Message-ID | <m92dneVQ5PZ9zCX9nZ2dnUU7-cHNnZ2d@giganews.com> |
| In reply to | #34420 |
On 6/2/2021 10:11 PM, André G. Isaak wrote: > On 2021-06-02 19:48, olcott wrote: >> On 6/2/2021 8:45 PM, Richard Damon wrote: >>> On 6/2/21 9:15 PM, olcott wrote: >>>> On 6/2/2021 7:20 PM, Richard Damon wrote: >>> >>>>> As I said, it just proves that H can't exist, not that the problem is >>>>> somehow 'wrong' >>>>> >>>>> Impossible problems occur all the time. >>>>> >>>>> Maybe a good example is how to explain to an Olcott what Truth >>>>> actually is. >>>>> >>>> >>>> Richard Damon has an IQ == Infinity >>>> && Richard Damon has an IQ != Infinity >>>> ∴ Richard Damon does not exist. >>>> >>> >>> But René Descartes would disagree, as I think, therefore I am. >>> >>> Note, I NEVER have claimed an IQ of infinity, and that by itself would >>> be an impossibility by the definition of IQ. (or, are YOU asserting that >>> claim?) >>> >>> Since IQ is based on the normal curve, you can compute what is the >>> highest possible measurable score based on the sample population size. >>> An infinite IQ, would require an infinite population, which is >>> impossible in a finite universe. >>> >> >> Richard Damon likes cats >> && Richard Damon does not like cats >> ∴ Richard Damon does not exist. >> >> This is the same reasoning as the diagonal proof so >> I gave it up and went back to Linz. > > All you've demonstrated here is that you are entirely clueless about how > proofs by contradiction work. > I know how proofs by contradiction work. I have studied the Linz proof since 2004. To refute the Linz proof only requires showing exactly why an Ĥ(⟨Ĥ⟩) transition to its final state of Ĥ.qn is correct. When halting is defined as any computation that halts without ever having its simulation aborted then the fact that Ĥ(⟨Ĥ⟩) stops running does not indicate that it is a halting computation. The simulating halt decider would also force an infinite loop to stop running. https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-03 07:19 -0400 |
| Subject | Re: Refuting the Linz Halting Problem Proof (V?) |
| Message-ID | <lV2uI.67100$Mz2.6603@fx14.iad> |
| In reply to | #34423 |
On 6/2/21 11:51 PM, olcott wrote: > On 6/2/2021 10:11 PM, André G. Isaak wrote: >> On 2021-06-02 19:48, olcott wrote: >>> On 6/2/2021 8:45 PM, Richard Damon wrote: >>>> On 6/2/21 9:15 PM, olcott wrote: >>>>> On 6/2/2021 7:20 PM, Richard Damon wrote: >>>> >>>>>> As I said, it just proves that H can't exist, not that the problem is >>>>>> somehow 'wrong' >>>>>> >>>>>> Impossible problems occur all the time. >>>>>> >>>>>> Maybe a good example is how to explain to an Olcott what Truth >>>>>> actually is. >>>>>> >>>>> >>>>> Richard Damon has an IQ == Infinity >>>>> && Richard Damon has an IQ != Infinity >>>>> ∴ Richard Damon does not exist. >>>>> >>>> >>>> But René Descartes would disagree, as I think, therefore I am. >>>> >>>> Note, I NEVER have claimed an IQ of infinity, and that by itself would >>>> be an impossibility by the definition of IQ. (or, are YOU asserting >>>> that >>>> claim?) >>>> >>>> Since IQ is based on the normal curve, you can compute what is the >>>> highest possible measurable score based on the sample population size. >>>> An infinite IQ, would require an infinite population, which is >>>> impossible in a finite universe. >>>> >>> >>> Richard Damon likes cats >>> && Richard Damon does not like cats >>> ∴ Richard Damon does not exist. >>> >>> This is the same reasoning as the diagonal proof so >>> I gave it up and went back to Linz. >> >> All you've demonstrated here is that you are entirely clueless about >> how proofs by contradiction work. >> > > I know how proofs by contradiction work. I have studied the Linz proof > since 2004. To refute the Linz proof only requires showing exactly why > an Ĥ(⟨Ĥ⟩) transition to its final state of Ĥ.qn is correct. WHich is exactly saying that you need to prove that a wrong answer is right. > > When halting is defined as any computation that halts without ever > having its simulation aborted then the fact that Ĥ(⟨Ĥ⟩) stops running > does not indicate that it is a halting computation. The simulating halt > decider would also force an infinite loop to stop running. > But it isn't defined that way, or at least not the way YOU interpret that. Your problem is you are SO stuck on simulations that you refuese to see the fact that the actual running of the machine is what matters. You refuse to see that once you have created your H, and built H^ on it, that copy of H has been fixed. By breaking the Turing Model of Computation and working where H^ calls that exact same copy as being used to decide, you have created a machine that no longer maps to the machines in the proof, so you get wrong conclusions. > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-03 08:46 -0500 |
| Subject | Re: Refuting the Linz Halting Problem Proof (V?) |
| Message-ID | <EcOdnar-j4DFQCX9nZ2dnUU7-L3NnZ2d@giganews.com> |
| In reply to | #34426 |
On 6/3/2021 6:19 AM, Richard Damon wrote: > On 6/2/21 11:51 PM, olcott wrote: >> On 6/2/2021 10:11 PM, André G. Isaak wrote: >>> On 2021-06-02 19:48, olcott wrote: >>>> On 6/2/2021 8:45 PM, Richard Damon wrote: >>>>> On 6/2/21 9:15 PM, olcott wrote: >>>>>> On 6/2/2021 7:20 PM, Richard Damon wrote: >>>>> >>>>>>> As I said, it just proves that H can't exist, not that the problem is >>>>>>> somehow 'wrong' >>>>>>> >>>>>>> Impossible problems occur all the time. >>>>>>> >>>>>>> Maybe a good example is how to explain to an Olcott what Truth >>>>>>> actually is. >>>>>>> >>>>>> >>>>>> Richard Damon has an IQ == Infinity >>>>>> && Richard Damon has an IQ != Infinity >>>>>> ∴ Richard Damon does not exist. >>>>>> >>>>> >>>>> But René Descartes would disagree, as I think, therefore I am. >>>>> >>>>> Note, I NEVER have claimed an IQ of infinity, and that by itself would >>>>> be an impossibility by the definition of IQ. (or, are YOU asserting >>>>> that >>>>> claim?) >>>>> >>>>> Since IQ is based on the normal curve, you can compute what is the >>>>> highest possible measurable score based on the sample population size. >>>>> An infinite IQ, would require an infinite population, which is >>>>> impossible in a finite universe. >>>>> >>>> >>>> Richard Damon likes cats >>>> && Richard Damon does not like cats >>>> ∴ Richard Damon does not exist. >>>> >>>> This is the same reasoning as the diagonal proof so >>>> I gave it up and went back to Linz. >>> >>> All you've demonstrated here is that you are entirely clueless about >>> how proofs by contradiction work. >>> >> >> I know how proofs by contradiction work. I have studied the Linz proof >> since 2004. To refute the Linz proof only requires showing exactly why >> an Ĥ(⟨Ĥ⟩) transition to its final state of Ĥ.qn is correct. > > WHich is exactly saying that you need to prove that a wrong answer is right. > >> >> When halting is defined as any computation that halts without ever >> having its simulation aborted then the fact that Ĥ(⟨Ĥ⟩) stops running >> does not indicate that it is a halting computation. The simulating halt >> decider would also force an infinite loop to stop running. >> > > But it isn't defined that way, or at least not the way YOU interpret > that. Your problem is you are SO stuck on simulations that you refuese > to see the fact that the actual running of the machine is what matters. > When the actual running of an infinite loop in debug step mode is aborted it is still an infinite loop and it still stops running. > You refuse to see that once you have created your H, and built H^ on it, > that copy of H has been fixed. By breaking the Turing Model of > Computation and working where H^ calls that exact same copy as being > used to decide, you have created a machine that no longer maps to the > machines in the proof, so you get wrong conclusions. > You can only say this if you form your rebuttal on the basis of making sure that you did not read page 2. If you read page 2 you will see that your rebuttal is flat out wrong. >> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >> >> >> > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 7 of 9 — ← Prev page 1 2 3 4 5 6 [7] 8 9 Next page →
Back to top | Article view | comp.theory
csiph-web