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 1 of 9 [1] 2 3 4 5 6 7 8 9 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-01 10:25 -0500 |
| Subject | Refuting the Sipser Halting Problem Proof (V1) |
| Message-ID | <eqSdnT7MdazmzCv9nZ2dnUU7-KPNnZ2d@giganews.com> |
The Sipser proof is refuted on the basis of showing how Turing machine H
correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input
specifies infinitely nested simulation. Turing machine D correctly
decides accept on ⟨D⟩ input.
The x86utm operating system was created so that the halting problem
could be examined concretely in the high level abstraction of the C
programming language. A simulating partial halt decider written in C
examines the execution trace of its x86 machine language input.
#define u32 uint32_t
int Simulate(u32 P, u32 I)
{
((void(*)(u32))P)(I);
return 1;
}
int D(u32 P) // P is a machine address
{
if ( H(P, P) )
return 0 // reject when H accepts
return 1; // accept when H rejects
}
int main()
{
u32 HDD_Acceptance = H((u32)D, (u32)D);
u32 DD_Acceptance = D((u32)D);
Output("H(D,D) Would_Halt = ", HDD_Acceptance);
Output("D(D) Would_Halt = ", DD_Acceptance);
}
When we understand that any computation that must have its simulation
aborted to prevent its otherwise infinite execution is correctly
rejected as non-halting then we know that the first line of main() does
correctly reject its input as halting.
A simulating halt decider that never stops simulating its input is
simply a simulator on this input. If H() never stopped simulating D()
then it can be seen that the halting behavior of D() would be the same
as if D() invoked Simulate() instead of H(), thus D() would never
terminate. The above analysis is confirmed by actual execution of the
above function in the x86utm operating system:
(1) The first line of main() detects an infinitely repeating non-halting
pattern on the first line of D. This line must be aborted before ever
returning any value to D. The first line of main() returns 0 for reject.
(2) The second line of main() returns 1 accept on the basis that H
detects an infinitely repeating non-halting pattern and returns 0 for
reject.
Refuting the Sipser Halting Problem Proof
May 2021 PL Olcott
https://www.researchgate.net/publication/351947980_Refuting_the_Sipser_Halting_Problem_Proof
Sipser Section 4.2 The Halting Problem
http://web.cecs.pdx.edu/~black/CS311/Lecture%20Notes/Sipser%20Sect%204.2.pdf
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-01 19:07 -0400 |
| Message-ID | <L4ztI.194615$lyv9.176457@fx35.iad> |
| In reply to | #34384 |
On 6/1/21 11:25 AM, olcott wrote: > The Sipser proof is refuted on the basis of showing how Turing machine H > correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input > specifies infinitely nested simulation. Turing machine D correctly > decides accept on ⟨D⟩ input. Except the problem is that Sipser isn't about deciding Halting, it is about deciding acceptance. D will NEVER have infinite behavior as long as H is a proper decider. H is required to give the same answer as D does, or reject if D REALLY doesn't halt, but since D is just the opposite of H, D will always halt as long as H does.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-01 18:16 -0500 |
| Message-ID | <25udnS5EJK9GIiv9nZ2dnUU7-TmdnZ2d@giganews.com> |
| In reply to | #34385 |
On 6/1/2021 6:07 PM, Richard Damon wrote: > On 6/1/21 11:25 AM, olcott wrote: >> The Sipser proof is refuted on the basis of showing how Turing machine H >> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input >> specifies infinitely nested simulation. Turing machine D correctly >> decides accept on ⟨D⟩ input. > > Except the problem is that Sipser isn't about deciding Halting, it is > about deciding acceptance. D will NEVER have infinite behavior as long > as H is a proper decider. > > H is required to give the same answer as D does, or reject if D REALLY > doesn't halt, but since D is just the opposite of H, D will always halt > as long as H does. > Have you ever written any computer programs? If yes let me know the computer language. If no then you will never understand what I am saying. -- 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-01 21:24 -0400 |
| Message-ID | <a5BtI.7911$341.6579@fx42.iad> |
| In reply to | #34386 |
On 6/1/21 7:16 PM, olcott wrote: > On 6/1/2021 6:07 PM, Richard Damon wrote: >> On 6/1/21 11:25 AM, olcott wrote: >>> The Sipser proof is refuted on the basis of showing how Turing machine H >>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input >>> specifies infinitely nested simulation. Turing machine D correctly >>> decides accept on ⟨D⟩ input. >> >> Except the problem is that Sipser isn't about deciding Halting, it is >> about deciding acceptance. D will NEVER have infinite behavior as long >> as H is a proper decider. >> >> H is required to give the same answer as D does, or reject if D REALLY >> doesn't halt, but since D is just the opposite of H, D will always halt >> as long as H does. >> > > Have you ever written any computer programs? If yes let me know the > computer language. If no then you will never understand what I am saying. > Yes, I have been programming for over 50 years. I started with FORTRAN, but have also done numerous Assembly languges, Basic, C, C++, APL, RPG, COBAL, Pascal, PHP, Java, Javascript, Python, Lisp, and probably a number more that aren't coming to the top of my head, and that isn't counting the languages that are really just dialectal variations of the above. I am WELL familiar with the Software Engineering process, which seems to be more that you do, since you think that a function that stopped a potentially infinite loop can't return to its caller, the fact that it DID stop the potentially infinite loop says it can. If it can't then it didn't stop the loop and fails to meet its specifications.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-06-01 18:30 -0700 |
| Message-ID | <s96mv9$r9a$2@gioia.aioe.org> |
| In reply to | #34388 |
On 6/1/2021 6:24 PM, Richard Damon wrote: > On 6/1/21 7:16 PM, olcott wrote: >> On 6/1/2021 6:07 PM, Richard Damon wrote: >>> On 6/1/21 11:25 AM, olcott wrote: >>>> The Sipser proof is refuted on the basis of showing how Turing machine H >>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input >>>> specifies infinitely nested simulation. Turing machine D correctly >>>> decides accept on ⟨D⟩ input. >>> >>> Except the problem is that Sipser isn't about deciding Halting, it is >>> about deciding acceptance. D will NEVER have infinite behavior as long >>> as H is a proper decider. >>> >>> H is required to give the same answer as D does, or reject if D REALLY >>> doesn't halt, but since D is just the opposite of H, D will always halt >>> as long as H does. >>> >> >> Have you ever written any computer programs? If yes let me know the >> computer language. If no then you will never understand what I am saying. >> > > Yes, I have been programming for over 50 years. I started with FORTRAN, > but have also done numerous Assembly languges, Basic, C, C++, APL, RPG, > COBAL, Pascal, PHP, Java, Javascript, Python, Lisp, and probably a > number more that aren't coming to the top of my head, and that isn't > counting the languages that are really just dialectal variations of the > above. > > I am WELL familiar with the Software Engineering process, which seems to > be more that you do, since you think that a function that stopped a > potentially infinite loop can't return to its caller, the fact that it > DID stop the potentially infinite loop says it can. If it can't then it > didn't stop the loop and fails to meet its specifications. > > Nice! Fwiw, I started with BASIC.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-06-01 18:31 -0700 |
| Message-ID | <s96n18$r9a$3@gioia.aioe.org> |
| In reply to | #34390 |
On 6/1/2021 6:30 PM, Chris M. Thomasson wrote: > On 6/1/2021 6:24 PM, Richard Damon wrote: >> On 6/1/21 7:16 PM, olcott wrote: >>> On 6/1/2021 6:07 PM, Richard Damon wrote: >>>> On 6/1/21 11:25 AM, olcott wrote: >>>>> The Sipser proof is refuted on the basis of showing how Turing >>>>> machine H >>>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input >>>>> specifies infinitely nested simulation. Turing machine D correctly >>>>> decides accept on ⟨D⟩ input. >>>> >>>> Except the problem is that Sipser isn't about deciding Halting, it is >>>> about deciding acceptance. D will NEVER have infinite behavior as long >>>> as H is a proper decider. >>>> >>>> H is required to give the same answer as D does, or reject if D REALLY >>>> doesn't halt, but since D is just the opposite of H, D will always halt >>>> as long as H does. >>>> >>> >>> Have you ever written any computer programs? If yes let me know the >>> computer language. If no then you will never understand what I am >>> saying. >>> >> >> Yes, I have been programming for over 50 years. I started with FORTRAN, >> but have also done numerous Assembly languges, Basic, C, C++, APL, RPG, >> COBAL, Pascal, PHP, Java, Javascript, Python, Lisp, and probably a >> number more that aren't coming to the top of my head, and that isn't >> counting the languages that are really just dialectal variations of the >> above. >> >> I am WELL familiar with the Software Engineering process, which seems to >> be more that you do, since you think that a function that stopped a >> potentially infinite loop can't return to its caller, the fact that it >> DID stop the potentially infinite loop says it can. If it can't then it >> didn't stop the loop and fails to meet its specifications. >> >> > > Nice! Fwiw, I started with BASIC. Check this out! https://www.calormen.com/jsbasic/ 0 REM Mandelbrot Set - in color 1 REM This picks random points to draw, so it will run forever 2 REM and may never fill in the full plane, but it is fast! 10 HGR : POKE 49234,0 20 DIM co(10) : FOR c = 0 TO 10 : READ d : co(c) = d : NEXT 30 DATA 1, 2, 3, 5, 6, 1, 2, 3, 5, 6, 0 100 x = INT(RND(1) * 280) : y = INT(RND(1) * 96) 110 x1 = x / 280 * 3 - 2 : y1 = y / 191 * 2 - 1 120 i = 0:s = x1:t = y1 130 s1 = s * s - t * t + x1 140 t = 2 * s * t + y1:s = s1: i = i + 1 150 IF s * s + t * t < 4 AND i < 20 THEN GOTO 130 160 c = co(i/2) : IF c THEN HCOLOR= c : HPLOT x,y : HPLOT x,191 - y 170 GOTO 100
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-01 21:41 -0500 |
| Message-ID | <4cSdnY168f9Zciv9nZ2dnUU7-VPNnZ2d@giganews.com> |
| In reply to | #34388 |
On 6/1/2021 8:24 PM, Richard Damon wrote: > On 6/1/21 7:16 PM, olcott wrote: >> On 6/1/2021 6:07 PM, Richard Damon wrote: >>> On 6/1/21 11:25 AM, olcott wrote: >>>> The Sipser proof is refuted on the basis of showing how Turing machine H >>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input >>>> specifies infinitely nested simulation. Turing machine D correctly >>>> decides accept on ⟨D⟩ input. >>> >>> Except the problem is that Sipser isn't about deciding Halting, it is >>> about deciding acceptance. D will NEVER have infinite behavior as long >>> as H is a proper decider. >>> >>> H is required to give the same answer as D does, or reject if D REALLY >>> doesn't halt, but since D is just the opposite of H, D will always halt >>> as long as H does. >>> >> >> Have you ever written any computer programs? If yes let me know the >> computer language. If no then you will never understand what I am saying. >> > > Yes, I have been programming for over 50 years. I started with FORTRAN, > but have also done numerous Assembly languges, Basic, C, C++, APL, RPG, > COBAL, Pascal, PHP, Java, Javascript, Python, Lisp, and probably a > number more that aren't coming to the top of my head, and that isn't > counting the languages that are really just dialectal variations of the > above. > > I am WELL familiar with the Software Engineering process, which seems to > be more that you do, since you think that a function that stopped a > potentially infinite loop can't return to its caller, the fact that it See there is your huge mistake, not even getting my words correctly, not any infinite loop. I have been a professional software developer since 1984. I started with C back when K & R was the standard. > DID stop the potentially infinite loop says it can. If it can't then it > didn't stop the loop and fails to meet its specifications. > > -- 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-01 23:24 -0400 |
| Message-ID | <CRCtI.666385$nn2.212455@fx48.iad> |
| In reply to | #34393 |
On 6/1/21 10:41 PM, olcott wrote: > On 6/1/2021 8:24 PM, Richard Damon wrote: >> On 6/1/21 7:16 PM, olcott wrote: >>> On 6/1/2021 6:07 PM, Richard Damon wrote: >>>> On 6/1/21 11:25 AM, olcott wrote: >>>>> The Sipser proof is refuted on the basis of showing how Turing >>>>> machine H >>>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input >>>>> specifies infinitely nested simulation. Turing machine D correctly >>>>> decides accept on ⟨D⟩ input. >>>> >>>> Except the problem is that Sipser isn't about deciding Halting, it is >>>> about deciding acceptance. D will NEVER have infinite behavior as long >>>> as H is a proper decider. >>>> >>>> H is required to give the same answer as D does, or reject if D REALLY >>>> doesn't halt, but since D is just the opposite of H, D will always halt >>>> as long as H does. >>>> >>> >>> Have you ever written any computer programs? If yes let me know the >>> computer language. If no then you will never understand what I am >>> saying. >>> >> >> Yes, I have been programming for over 50 years. I started with FORTRAN, >> but have also done numerous Assembly languges, Basic, C, C++, APL, RPG, >> COBAL, Pascal, PHP, Java, Javascript, Python, Lisp, and probably a >> number more that aren't coming to the top of my head, and that isn't >> counting the languages that are really just dialectal variations of the >> above. >> >> I am WELL familiar with the Software Engineering process, which seems to >> be more that you do, since you think that a function that stopped a >> potentially infinite loop can't return to its caller, the fact that it > > See there is your huge mistake, not even getting my words correctly, not > any infinite loop. Yes, you want to make the recursion special, but it really isn't. If you HAVE the infinite recursion, you will NEVER return, so you NEVER gave teh answer. If you CAN break the loop and do to give the answer, then you don't have the infinite loop and can answer ANYBODY. The claim you are trying to make is FALSE. If H can give the answer when directly asked, it can give that answer to ANYONE who calls it, because it has broken the infinite recursion. REMEMBER, I am talking about H^ or D as the TOP level machine calling on their respective H algorithm. If H meets the requirements of being a decider, it MUST give them to everyone that calls it, including the machine that it is given the replication of. Yes, the simulated version of H won't answer the simulated version of D/H^ because your rules call for the simulation to be stopped before you get there, but the simulating H WILL give its answer to the calling D/H^. You seem to have a blind spot for that version of the program. > > I have been a professional software developer since 1984. I started with > C back when K & R was the standard. NEWBIE. Ten years before that I was performing the programming to perform the data analysis for a number of published papers. I used K&R C in the late 70's. Don't think you can brow beat me with qualifications. From what I have seen, maybe you know somethings about coding, but you don't seem to be a 'great' programmer, you don't seem to really know the major principles of Software Engineering, and you definitely are NOT versed in the principles of Computer Science. Given the time you have claimed to have spent on your 'simulator' and using an open source program as a basis, you must not be that great. I would say the task to do that from scratch should be much less than that. I HAVE done things similar to that, admittedly for simple processors, in much less time than that. > >> DID stop the potentially infinite loop says it can. If it can't then it >> didn't stop the loop and fails to meet its specifications. >> >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-01 23:03 -0500 |
| Message-ID | <2YCdnYPYA8KHnir9nZ2dnUU7-e3NnZ2d@giganews.com> |
| In reply to | #34396 |
On 6/1/2021 10:24 PM, Richard Damon wrote:
> On 6/1/21 10:41 PM, olcott wrote:
>> On 6/1/2021 8:24 PM, Richard Damon wrote:
>>> On 6/1/21 7:16 PM, olcott wrote:
>>>> On 6/1/2021 6:07 PM, Richard Damon wrote:
>>>>> On 6/1/21 11:25 AM, olcott wrote:
>>>>>> The Sipser proof is refuted on the basis of showing how Turing
>>>>>> machine H
>>>>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input
>>>>>> specifies infinitely nested simulation. Turing machine D correctly
>>>>>> decides accept on ⟨D⟩ input.
>>>>>
>>>>> Except the problem is that Sipser isn't about deciding Halting, it is
>>>>> about deciding acceptance. D will NEVER have infinite behavior as long
>>>>> as H is a proper decider.
>>>>>
>>>>> H is required to give the same answer as D does, or reject if D REALLY
>>>>> doesn't halt, but since D is just the opposite of H, D will always halt
>>>>> as long as H does.
>>>>>
>>>>
>>>> Have you ever written any computer programs? If yes let me know the
>>>> computer language. If no then you will never understand what I am
>>>> saying.
>>>>
>>>
>>> Yes, I have been programming for over 50 years. I started with FORTRAN,
>>> but have also done numerous Assembly languges, Basic, C, C++, APL, RPG,
>>> COBAL, Pascal, PHP, Java, Javascript, Python, Lisp, and probably a
>>> number more that aren't coming to the top of my head, and that isn't
>>> counting the languages that are really just dialectal variations of the
>>> above.
>>>
>>> I am WELL familiar with the Software Engineering process, which seems to
>>> be more that you do, since you think that a function that stopped a
>>> potentially infinite loop can't return to its caller, the fact that it
>>
>> See there is your huge mistake, not even getting my words correctly, not
>> any infinite loop.
>
> Yes, you want to make the recursion special, but it really isn't. If you
> HAVE the infinite recursion, you will NEVER return, so you NEVER gave
> teh answer.
>
> If you CAN break the loop and do to give the answer, then you don't have
> the infinite loop and can answer ANYBODY. The claim you are trying to
> make is FALSE. If H can give the answer when directly asked, it can give
> that answer to ANYONE who calls it, because it has broken the infinite
> recursion.
>
> REMEMBER, I am talking about H^ or D as the TOP level machine calling on
> their respective H algorithm. If H meets the requirements of being a
> decider, it MUST give them to everyone that calls it, including the
> machine that it is given the replication of.
>
Yes in this case you are correct.
> Yes, the simulated version of H won't answer the simulated version of
> D/H^ because your rules call for the simulation to be stopped before you
> get there, but the simulating H WILL give its answer to the calling
> D/H^. You seem to have a blind spot for that version of the program.
>
void Ĥ(u32 P)
{
u32 Input_Halts = H(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = H(Ĥ, Ĥ);
}
When we understand that any computation that must have its simulation
aborted to prevent its otherwise infinite execution is correctly
rejected as non-halting then we know that the first line of main() does
correctly reject its input as halting.
You are just not bright enough to get this.
--
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 06:52 -0400 |
| Message-ID | <eqJtI.9511$hm1.4260@fx11.iad> |
| In reply to | #34399 |
On 6/2/21 12:03 AM, olcott wrote:
> On 6/1/2021 10:24 PM, Richard Damon wrote:
>> On 6/1/21 10:41 PM, olcott wrote:
>>> On 6/1/2021 8:24 PM, Richard Damon wrote:
>>>> On 6/1/21 7:16 PM, olcott wrote:
>>>>> On 6/1/2021 6:07 PM, Richard Damon wrote:
>>>>>> On 6/1/21 11:25 AM, olcott wrote:
>>>>>>> The Sipser proof is refuted on the basis of showing how Turing
>>>>>>> machine H
>>>>>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this
>>>>>>> input
>>>>>>> specifies infinitely nested simulation. Turing machine D correctly
>>>>>>> decides accept on ⟨D⟩ input.
>>>>>>
>>>>>> Except the problem is that Sipser isn't about deciding Halting, it is
>>>>>> about deciding acceptance. D will NEVER have infinite behavior as
>>>>>> long
>>>>>> as H is a proper decider.
>>>>>>
>>>>>> H is required to give the same answer as D does, or reject if D
>>>>>> REALLY
>>>>>> doesn't halt, but since D is just the opposite of H, D will always
>>>>>> halt
>>>>>> as long as H does.
>>>>>>
>>>>>
>>>>> Have you ever written any computer programs? If yes let me know the
>>>>> computer language. If no then you will never understand what I am
>>>>> saying.
>>>>>
>>>>
>>>> Yes, I have been programming for over 50 years. I started with FORTRAN,
>>>> but have also done numerous Assembly languges, Basic, C, C++, APL, RPG,
>>>> COBAL, Pascal, PHP, Java, Javascript, Python, Lisp, and probably a
>>>> number more that aren't coming to the top of my head, and that isn't
>>>> counting the languages that are really just dialectal variations of the
>>>> above.
>>>>
>>>> I am WELL familiar with the Software Engineering process, which
>>>> seems to
>>>> be more that you do, since you think that a function that stopped a
>>>> potentially infinite loop can't return to its caller, the fact that it
>>>
>>> See there is your huge mistake, not even getting my words correctly, not
>>> any infinite loop.
>>
>> Yes, you want to make the recursion special, but it really isn't. If you
>> HAVE the infinite recursion, you will NEVER return, so you NEVER gave
>> teh answer.
>>
>> If you CAN break the loop and do to give the answer, then you don't have
>> the infinite loop and can answer ANYBODY. The claim you are trying to
>> make is FALSE. If H can give the answer when directly asked, it can give
>> that answer to ANYONE who calls it, because it has broken the infinite
>> recursion.
>>
>> REMEMBER, I am talking about H^ or D as the TOP level machine calling on
>> their respective H algorithm. If H meets the requirements of being a
>> decider, it MUST give them to everyone that calls it, including the
>> machine that it is given the replication of.
>>
>
> Yes in this case you are correct.
>
>> Yes, the simulated version of H won't answer the simulated version of
>> D/H^ because your rules call for the simulation to be stopped before you
>> get there, but the simulating H WILL give its answer to the calling
>> D/H^. You seem to have a blind spot for that version of the program.
>>
>
> void Ĥ(u32 P)
> {
> u32 Input_Halts = H(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> int main()
> {
> u32 Input_Would_Halt = H(Ĥ, Ĥ);
> }
>
> When we understand that any computation that must have its simulation
> aborted to prevent its otherwise infinite execution is correctly
> rejected as non-halting then we know that the first line of main() does
> correctly reject its input as halting.
>
> You are just not bright enough to get this.
>
>
And you don't seem to be bright enough to understand that the REAL
definition of Halting is does the machine, when run as the actual
machine, come to its Halt infinite time.
Your definition works, but only with the right value of 'correctly', and
it is NOT correctly determined that the decision to abort simulation was
done correctly.
If you take a contract to write a program to ALWAYS win at Tic-Tac-Toe,
and then deliver a program that just never loses, you haven't met the
contract. It may be as good as you an do, but it hasn't meet the contract.
Your Halt Decider has the same problem, it doesn't meet the requirements
of the Halting Problem, and you can't make it meet those requirements by
trying to re-define what Halting is, because the definitions are what
the defintions are for that problem. You can perhaps claim that this is
as good as you can get, and request a performance wavier, but you need
to admit that you didn't meet the original requirements.
Yes, you can define a new Olcott-Halting Problem with a different
definition and show that this category of proof doesn't work in your
problem, but you still would need to show that this problem has a
meaningful use, and it doesn't gt around the fact that the real halting
problem still shows that not all Truth is provable in complicated enough
systems of logic.
I will note that you still haven't 'solved' the Olcott-Halting Problem,
because you have only dealt with one class of the proofs, there are
still other proofs based on other issues, like uncomputable numbers,
that still won't be able to be decided, but you don't have the brains to
even understand those problems.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-02 11:08 -0500 |
| Message-ID | <6fSdna8bjaCLMCr9nZ2dnUU7-VPNnZ2d@giganews.com> |
| In reply to | #34400 |
On 6/2/2021 5:52 AM, Richard Damon wrote:
> On 6/2/21 12:03 AM, olcott wrote:
>> On 6/1/2021 10:24 PM, Richard Damon wrote:
>>> On 6/1/21 10:41 PM, olcott wrote:
>>>> On 6/1/2021 8:24 PM, Richard Damon wrote:
>>>>> On 6/1/21 7:16 PM, olcott wrote:
>>>>>> On 6/1/2021 6:07 PM, Richard Damon wrote:
>>>>>>> On 6/1/21 11:25 AM, olcott wrote:
>>>>>>>> The Sipser proof is refuted on the basis of showing how Turing
>>>>>>>> machine H
>>>>>>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this
>>>>>>>> input
>>>>>>>> specifies infinitely nested simulation. Turing machine D correctly
>>>>>>>> decides accept on ⟨D⟩ input.
>>>>>>>
>>>>>>> Except the problem is that Sipser isn't about deciding Halting, it is
>>>>>>> about deciding acceptance. D will NEVER have infinite behavior as
>>>>>>> long
>>>>>>> as H is a proper decider.
>>>>>>>
>>>>>>> H is required to give the same answer as D does, or reject if D
>>>>>>> REALLY
>>>>>>> doesn't halt, but since D is just the opposite of H, D will always
>>>>>>> halt
>>>>>>> as long as H does.
>>>>>>>
>>>>>>
>>>>>> Have you ever written any computer programs? If yes let me know the
>>>>>> computer language. If no then you will never understand what I am
>>>>>> saying.
>>>>>>
>>>>>
>>>>> Yes, I have been programming for over 50 years. I started with FORTRAN,
>>>>> but have also done numerous Assembly languges, Basic, C, C++, APL, RPG,
>>>>> COBAL, Pascal, PHP, Java, Javascript, Python, Lisp, and probably a
>>>>> number more that aren't coming to the top of my head, and that isn't
>>>>> counting the languages that are really just dialectal variations of the
>>>>> above.
>>>>>
>>>>> I am WELL familiar with the Software Engineering process, which
>>>>> seems to
>>>>> be more that you do, since you think that a function that stopped a
>>>>> potentially infinite loop can't return to its caller, the fact that it
>>>>
>>>> See there is your huge mistake, not even getting my words correctly, not
>>>> any infinite loop.
>>>
>>> Yes, you want to make the recursion special, but it really isn't. If you
>>> HAVE the infinite recursion, you will NEVER return, so you NEVER gave
>>> teh answer.
>>>
>>> If you CAN break the loop and do to give the answer, then you don't have
>>> the infinite loop and can answer ANYBODY. The claim you are trying to
>>> make is FALSE. If H can give the answer when directly asked, it can give
>>> that answer to ANYONE who calls it, because it has broken the infinite
>>> recursion.
>>>
>>> REMEMBER, I am talking about H^ or D as the TOP level machine calling on
>>> their respective H algorithm. If H meets the requirements of being a
>>> decider, it MUST give them to everyone that calls it, including the
>>> machine that it is given the replication of.
>>>
>>
>> Yes in this case you are correct.
>>
>>> Yes, the simulated version of H won't answer the simulated version of
>>> D/H^ because your rules call for the simulation to be stopped before you
>>> get there, but the simulating H WILL give its answer to the calling
>>> D/H^. You seem to have a blind spot for that version of the program.
>>>
>>
>> void Ĥ(u32 P)
>> {
>> u32 Input_Halts = H(P, P);
>> if (Input_Halts)
>> HERE: goto HERE;
>> }
>>
>> int main()
>> {
>> u32 Input_Would_Halt = H(Ĥ, Ĥ);
>> }
>>
>> When we understand that any computation that must have its simulation
>> aborted to prevent its otherwise infinite execution is correctly
>> rejected as non-halting then we know that the first line of main() does
>> correctly reject its input as halting.
>>
>> You are just not bright enough to get this.
>>
>>
>
> And you don't seem to be bright enough to understand that the REAL
> definition of Halting is does the machine, when run as the actual
> machine, come to its Halt infinite time.
>
If there is semantic incoherence inherent in the original definition of
halting then changing this definition to remove this semantic
incoherence is perfectly justified.
> Your definition works, but only with the right value of 'correctly', and
> it is NOT correctly determined that the decision to abort simulation was
> done correctly.
>
void Ĥ(u32 P)
{
u32 Input_Halts = H(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = H(Ĥ, Ĥ);
}
When we define halting as any computation that halts without its
simulation ever being aborted:
>> 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.
The quote above from Ben agrees with this.
Kaz also seems to agree with the above definition of non-halting.
To the best of my understanding Ben does not even think that the above
definition is a change to the original definition. It is merely another
way to look at the exact same halting problem.
When we accept the above definitions of Halting/non-halting
Then we can know with complete certainty the input to H(Ĥ, Ĥ) is
correctly decided as non-halting.
> If you take a contract to write a program to ALWAYS win at Tic-Tac-Toe,
> and then deliver a program that just never loses, you haven't met the
> contract. It may be as good as you an do, but it hasn't meet the contract.
>
> Your Halt Decider has the same problem, it doesn't meet the requirements
> of the Halting Problem, and you can't make it meet those requirements by
> trying to re-define what Halting is, because the definitions are what
> the defintions are for that problem. You can perhaps claim that this is
> as good as you can get, and request a performance wavier, but you need
> to admit that you didn't meet the original requirements.
>
> Yes, you can define a new Olcott-Halting Problem with a different
> definition and show that this category of proof doesn't work in your
> problem, but you still would need to show that this problem has a
> meaningful use, and it doesn't gt around the fact that the real halting
> problem still shows that not all Truth is provable in complicated enough
> systems of logic.
>
> I will note that you still haven't 'solved' the Olcott-Halting Problem,
> because you have only dealt with one class of the proofs, there are
> still other proofs based on other issues, like uncomputable numbers,
> that still won't be able to be decided, but you don't have the brains to
> even understand those problems.
>
--
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 20:18 -0400 |
| Message-ID | <kdVtI.9838$EW.8153@fx04.iad> |
| In reply to | #34405 |
On 6/2/21 12:08 PM, olcott wrote:
> On 6/2/2021 5:52 AM, Richard Damon wrote:
>> On 6/2/21 12:03 AM, olcott wrote:
>>> On 6/1/2021 10:24 PM, Richard Damon wrote:
>>>> On 6/1/21 10:41 PM, olcott wrote:
>>>>> On 6/1/2021 8:24 PM, Richard Damon wrote:
>>>>>> On 6/1/21 7:16 PM, olcott wrote:
>>>>>>> On 6/1/2021 6:07 PM, Richard Damon wrote:
>>>>>>>> On 6/1/21 11:25 AM, olcott wrote:
>>>>>>>>> The Sipser proof is refuted on the basis of showing how Turing
>>>>>>>>> machine H
>>>>>>>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this
>>>>>>>>> input
>>>>>>>>> specifies infinitely nested simulation. Turing machine D correctly
>>>>>>>>> decides accept on ⟨D⟩ input.
>>>>>>>>
>>>>>>>> Except the problem is that Sipser isn't about deciding Halting,
>>>>>>>> it is
>>>>>>>> about deciding acceptance. D will NEVER have infinite behavior as
>>>>>>>> long
>>>>>>>> as H is a proper decider.
>>>>>>>>
>>>>>>>> H is required to give the same answer as D does, or reject if D
>>>>>>>> REALLY
>>>>>>>> doesn't halt, but since D is just the opposite of H, D will always
>>>>>>>> halt
>>>>>>>> as long as H does.
>>>>>>>>
>>>>>>>
>>>>>>> Have you ever written any computer programs? If yes let me know the
>>>>>>> computer language. If no then you will never understand what I am
>>>>>>> saying.
>>>>>>>
>>>>>>
>>>>>> Yes, I have been programming for over 50 years. I started with
>>>>>> FORTRAN,
>>>>>> but have also done numerous Assembly languges, Basic, C, C++, APL,
>>>>>> RPG,
>>>>>> COBAL, Pascal, PHP, Java, Javascript, Python, Lisp, and probably a
>>>>>> number more that aren't coming to the top of my head, and that isn't
>>>>>> counting the languages that are really just dialectal variations
>>>>>> of the
>>>>>> above.
>>>>>>
>>>>>> I am WELL familiar with the Software Engineering process, which
>>>>>> seems to
>>>>>> be more that you do, since you think that a function that stopped a
>>>>>> potentially infinite loop can't return to its caller, the fact
>>>>>> that it
>>>>>
>>>>> See there is your huge mistake, not even getting my words
>>>>> correctly, not
>>>>> any infinite loop.
>>>>
>>>> Yes, you want to make the recursion special, but it really isn't. If
>>>> you
>>>> HAVE the infinite recursion, you will NEVER return, so you NEVER gave
>>>> teh answer.
>>>>
>>>> If you CAN break the loop and do to give the answer, then you don't
>>>> have
>>>> the infinite loop and can answer ANYBODY. The claim you are trying to
>>>> make is FALSE. If H can give the answer when directly asked, it can
>>>> give
>>>> that answer to ANYONE who calls it, because it has broken the infinite
>>>> recursion.
>>>>
>>>> REMEMBER, I am talking about H^ or D as the TOP level machine
>>>> calling on
>>>> their respective H algorithm. If H meets the requirements of being a
>>>> decider, it MUST give them to everyone that calls it, including the
>>>> machine that it is given the replication of.
>>>>
>>>
>>> Yes in this case you are correct.
>>>
>>>> Yes, the simulated version of H won't answer the simulated version of
>>>> D/H^ because your rules call for the simulation to be stopped before
>>>> you
>>>> get there, but the simulating H WILL give its answer to the calling
>>>> D/H^. You seem to have a blind spot for that version of the program.
>>>>
>>>
>>> void Ĥ(u32 P)
>>> {
>>> u32 Input_Halts = H(P, P);
>>> if (Input_Halts)
>>> HERE: goto HERE;
>>> }
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = H(Ĥ, Ĥ);
>>> }
>>>
>>> When we understand that any computation that must have its simulation
>>> aborted to prevent its otherwise infinite execution is correctly
>>> rejected as non-halting then we know that the first line of main() does
>>> correctly reject its input as halting.
>>>
>>> You are just not bright enough to get this.
>>>
>>>
>>
>> And you don't seem to be bright enough to understand that the REAL
>> definition of Halting is does the machine, when run as the actual
>> machine, come to its Halt infinite time.
>>
>
> If there is semantic incoherence inherent in the original definition of
> halting then changing this definition to remove this semantic
> incoherence is perfectly justified.
Except there ISN'T a sementic incoherence inherent in the original
definition of halting.
Halting is defined as what a actual machine does.
You only get the incoherence when you assume the existance of a machine
that does not exist, THAT is the incoherence. Your whole argument is
based on the fact that you begin with an assumption that H really does
exist, and refuse to acknowledge that the contradictions that it
generates are the proof that such a machine does not exist.
There is absolutely ZERO contradictions is saying that a machine that
does not exist won't return the answer to it caller that also does not
exist. THAT is your solution.
If you accept that H does not exist, then neither does H^ or D. There
existence depends on the existence of H. If you claim that H exists,
then so do they (which ever one maps to that H) and you get the
contradiction.
Halting is a natural property per its definition. There is ZERO
justification to change it.
It also turn out that Halting is also a property that exposes the
problem with your concept that all Truth is provable, as any system that
can understand Turing Machines and the like is complicated enough that
the logic system that work with the principle that All Truth is Provable
can't express them.
>
>> Your definition works, but only with the right value of 'correctly', and
>> it is NOT correctly determined that the decision to abort simulation was
>> done correctly.
>>
>
> void Ĥ(u32 P)
> {
> u32 Input_Halts = H(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> int main()
> {
> u32 Input_Would_Halt = H(Ĥ, Ĥ);
> }
>
> When we define halting as any computation that halts without its
> simulation ever being aborted:
>
BUT THAT ISN'T THE DEFINITION.
IF you want, you can define Olcott-Halting that way, but then you proofs
don't say anything about REAL Halting.
>>> 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.
>
> The quote above from Ben agrees with this.
> Kaz also seems to agree with the above definition of non-halting.
Give the ID of the message. YOU have PROVED Yourself to lie in
quotations taking them out of context.
>
> To the best of my understanding Ben does not even think that the above
> definition is a change to the original definition. It is merely another
> way to look at the exact same halting problem.
>
Best of you understanding isn't much. I would trust it as far as I could
spit.
The ONLY definition that matters on halting is the definition that a
Halting machine is a machine that when it runs finishes in finite time,
and a non-Halting machine is a machine that will not halt in finite time.
> When we accept the above definitions of Halting/non-halting
> Then we can know with complete certainty the input to H(Ĥ, Ĥ) is
> correctly decided as non-halting.
>
But WE don't
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-01 21:27 -0500 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <OMidnaUMfOPncSv9nZ2dnUU7-V3NnZ2d@giganews.com> |
| In reply to | #34385 |
On 6/1/2021 6:07 PM, Richard Damon wrote:
> On 6/1/21 11:25 AM, olcott wrote:
>> The Sipser proof is refuted on the basis of showing how Turing machine H
>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input
>> specifies infinitely nested simulation. Turing machine D correctly
>> decides accept on ⟨D⟩ input.
>
> Except the problem is that Sipser isn't about deciding Halting, it is
> about deciding acceptance. D will NEVER have infinite behavior as long
> as H is a proper decider.
>
> H is required to give the same answer as D does, or reject if D REALLY
> doesn't halt, but since D is just the opposite of H, D will always halt
> as long as H does.
>
int D(u32 P) // P is a machine address
{
if ( H(P, P) )
return 0 // reject when H accepts
return 1; // accept when H rejects
}
int main()
{
u32 HDD_Acceptance = H((u32)D, (u32)D);
u32 DD_Acceptance = D((u32)D);
Output("H(D,D) Would_Halt = ", HDD_Acceptance);
Output("D(D) Would_Halt = ", DD_Acceptance);
}
There can be a D that has the opposite accept / reject value as H.
There cannot be a D that has the opposite accept / reject value as H
and has the same accept / reject value as H. Putting this in the specs
for D is freaking nuts.
--
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-01 22:55 -0400 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <tqCtI.51045$AU5.39162@fx29.iad> |
| In reply to | #34392 |
On 6/1/21 10:27 PM, olcott wrote:
> On 6/1/2021 6:07 PM, Richard Damon wrote:
>> On 6/1/21 11:25 AM, olcott wrote:
>>> The Sipser proof is refuted on the basis of showing how Turing machine H
>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input
>>> specifies infinitely nested simulation. Turing machine D correctly
>>> decides accept on ⟨D⟩ input.
>>
>> Except the problem is that Sipser isn't about deciding Halting, it is
>> about deciding acceptance. D will NEVER have infinite behavior as long
>> as H is a proper decider.
>>
>> H is required to give the same answer as D does, or reject if D REALLY
>> doesn't halt, but since D is just the opposite of H, D will always halt
>> as long as H does.
>>
>
> int D(u32 P) // P is a machine address
> {
> if ( H(P, P) )
> return 0 // reject when H accepts
> return 1; // accept when H rejects
> }
>
>
> int main()
> {
> u32 HDD_Acceptance = H((u32)D, (u32)D);
> u32 DD_Acceptance = D((u32)D);
> Output("H(D,D) Would_Halt = ", HDD_Acceptance);
> Output("D(D) Would_Halt = ", DD_Acceptance);
> }
>
> There can be a D that has the opposite accept / reject value as H.
>
> There cannot be a D that has the opposite accept / reject value as H
> and has the same accept / reject value as H. Putting this in the specs
> for D is freaking nuts.
>
Remeber HOW the requriements are stated.
H is required to be given a description of D, and return the same answer
as D would, or reject if it doesn't Halt
D is required to use H giving the description it was given and return
the opposite results.
The requirements of D are EASY to meet. It HAS the H, so it just uses it
and returns the opposite answer, that is a TRIVIAL operation. As long as
H exists, we can trivially make a D.
H is the machine that can not exist, if it didn't have the 'if it didn't
halt' clause, it could just run D and return the value it returned, and
for this case we get the infinite loop and it won't answer, and that
would be fine. BUT, it DOES have a requirement to handle the non-halting
case in finite time, and that is what makes H impossible.
The contradiction does create the infinite loop, and it is H that needs
to break it by its requirements, and that makes it not able to do the
job, so H doesn't exist.
And THAT is the answer, H doesn't exist. Simple. We CAN'T universally
decide this sort of question, which also means we can't universally
decide the Halting Problem.
No Problem, we just found something we might not be able to know. Not a
problem unless you are trying to use a Truth rule that doesn't work for
this type of logic.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-01 22:20 -0500 |
| Subject | Refuting the Linz Halting Problem Proof(not bright enough) |
| Message-ID | <FNKdnfk4d4eOZCv9nZ2dnUU7-X3NnZ2d@giganews.com> |
| In reply to | #34394 |
On 6/1/2021 9:55 PM, Richard Damon wrote:
> On 6/1/21 10:27 PM, olcott wrote:
>> On 6/1/2021 6:07 PM, Richard Damon wrote:
>>> On 6/1/21 11:25 AM, olcott wrote:
>>>> The Sipser proof is refuted on the basis of showing how Turing machine H
>>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input
>>>> specifies infinitely nested simulation. Turing machine D correctly
>>>> decides accept on ⟨D⟩ input.
>>>
>>> Except the problem is that Sipser isn't about deciding Halting, it is
>>> about deciding acceptance. D will NEVER have infinite behavior as long
>>> as H is a proper decider.
>>>
>>> H is required to give the same answer as D does, or reject if D REALLY
>>> doesn't halt, but since D is just the opposite of H, D will always halt
>>> as long as H does.
>>>
>>
>> int D(u32 P) // P is a machine address
>> {
>> if ( H(P, P) )
>> return 0 // reject when H accepts
>> return 1; // accept when H rejects
>> }
>>
>>
>> int main()
>> {
>> u32 HDD_Acceptance = H((u32)D, (u32)D);
>> u32 DD_Acceptance = D((u32)D);
>> Output("H(D,D) Would_Halt = ", HDD_Acceptance);
>> Output("D(D) Would_Halt = ", DD_Acceptance);
>> }
>>
>> There can be a D that has the opposite accept / reject value as H.
>>
>> There cannot be a D that has the opposite accept / reject value as H
>> and has the same accept / reject value as H. Putting this in the specs
>> for D is freaking nuts.
>>
>
> Remeber HOW the requriements are stated.
>
> H is required to be given a description of D, and return the same answer
> as D would, or reject if it doesn't Halt
>
> D is required to use H giving the description it was given and return
> the opposite results.
>
>
> The requirements of D are EASY to meet. It HAS the H, so it just uses it
> and returns the opposite answer, that is a TRIVIAL operation. As long as
> H exists, we can trivially make a D.
>
> H is the machine that can not exist, if it didn't have the 'if it didn't
> halt' clause, it could just run D and return the value it returned, and
> for this case we get the infinite loop and it won't answer, and that
> would be fine. BUT, it DOES have a requirement to handle the non-halting
> case in finite time, and that is what makes H impossible.
>
> The contradiction does create the infinite loop, and it is H that needs
> to break it by its requirements, and that makes it not able to do the
> job, so H doesn't exist.
>
> And THAT is the answer, H doesn't exist. Simple. We CAN'T universally
> decide this sort of question, which also means we can't universally
> decide the Halting Problem.
>
void Ĥ(u32 P)
{
u32 Input_Halts = H(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = Halts(Ĥ, Ĥ);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
When we understand that any computation that must have its simulation
aborted to prevent its otherwise infinite execution is correctly
rejected as non-halting then we know that the first line of main() does
correctly reject its input as halting.
You are just not bright enough to get this.
--
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-01 22:31 -0500 |
| Subject | Re: Refuting the Linz Halting Problem Proof(not bright enough)(typo) |
| Message-ID | <rL6dneJTN7MzZiv9nZ2dnUU7-IHNnZ2d@giganews.com> |
| In reply to | #34395 |
On 6/1/2021 10:20 PM, olcott wrote:
>
> void Ĥ(u32 P)
> {
> u32 Input_Halts = H(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> int main()
> {
u32 Input_Would_Halt = H(Ĥ, Ĥ);
> Output("Input_Would_Halt = ", Input_Would_Halt);
> }
>
> When we understand that any computation that must have its simulation
> aborted to prevent its otherwise infinite execution is correctly
> rejected as non-halting then we know that the first line of main() does
> correctly reject its input as halting.
>
> You are just not bright enough to get this.
--
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-01 22:25 -0500 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <9_-dnXFMFIavZyv9nZ2dnUU7-RfNnZ2d@giganews.com> |
| In reply to | #34394 |
On 6/1/2021 9:55 PM, Richard Damon wrote:
> On 6/1/21 10:27 PM, olcott wrote:
>> On 6/1/2021 6:07 PM, Richard Damon wrote:
>>> On 6/1/21 11:25 AM, olcott wrote:
>>>> The Sipser proof is refuted on the basis of showing how Turing machine H
>>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input
>>>> specifies infinitely nested simulation. Turing machine D correctly
>>>> decides accept on ⟨D⟩ input.
>>>
>>> Except the problem is that Sipser isn't about deciding Halting, it is
>>> about deciding acceptance. D will NEVER have infinite behavior as long
>>> as H is a proper decider.
>>>
>>> H is required to give the same answer as D does, or reject if D REALLY
>>> doesn't halt, but since D is just the opposite of H, D will always halt
>>> as long as H does.
>>>
>>
>> int D(u32 P) // P is a machine address
>> {
>> if ( H(P, P) )
>> return 0 // reject when H accepts
>> return 1; // accept when H rejects
>> }
>>
>>
>> int main()
>> {
>> u32 HDD_Acceptance = H((u32)D, (u32)D);
>> u32 DD_Acceptance = D((u32)D);
>> Output("H(D,D) Would_Halt = ", HDD_Acceptance);
>> Output("D(D) Would_Halt = ", DD_Acceptance);
>> }
>>
>> There can be a D that has the opposite accept / reject value as H.
>>
>> There cannot be a D that has the opposite accept / reject value as H
>> and has the same accept / reject value as H. Putting this in the specs
>> for D is freaking nuts.
>>
>
> Remeber HOW the requriements are stated.
>
> H is required to be given a description of D, and return the same answer
> as D would, or reject if it doesn't Halt
>
> D is required to use H giving the description it was given and return
> the opposite results.
if (H == D && D != H)
;
else
printf("Requirements are Freaking nuts!");
--
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 06:59 -0400 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <BwJtI.492538$ST2.269672@fx47.iad> |
| In reply to | #34397 |
On 6/1/21 11:25 PM, olcott wrote:
> On 6/1/2021 9:55 PM, Richard Damon wrote:
>> On 6/1/21 10:27 PM, olcott wrote:
>>> On 6/1/2021 6:07 PM, Richard Damon wrote:
>>>> On 6/1/21 11:25 AM, olcott wrote:
>>>>> The Sipser proof is refuted on the basis of showing how Turing
>>>>> machine H
>>>>> correctly decides reject on ⟨D,⟨D⟩⟩ input on the basis that this input
>>>>> specifies infinitely nested simulation. Turing machine D correctly
>>>>> decides accept on ⟨D⟩ input.
>>>>
>>>> Except the problem is that Sipser isn't about deciding Halting, it is
>>>> about deciding acceptance. D will NEVER have infinite behavior as long
>>>> as H is a proper decider.
>>>>
>>>> H is required to give the same answer as D does, or reject if D REALLY
>>>> doesn't halt, but since D is just the opposite of H, D will always halt
>>>> as long as H does.
>>>>
>>>
>>> int D(u32 P) // P is a machine address
>>> {
>>> if ( H(P, P) )
>>> return 0 // reject when H accepts
>>> return 1; // accept when H rejects
>>> }
>>>
>>>
>>> int main()
>>> {
>>> u32 HDD_Acceptance = H((u32)D, (u32)D);
>>> u32 DD_Acceptance = D((u32)D);
>>> Output("H(D,D) Would_Halt = ", HDD_Acceptance);
>>> Output("D(D) Would_Halt = ", DD_Acceptance);
>>> }
>>>
>>> There can be a D that has the opposite accept / reject value as H.
>>>
>>> There cannot be a D that has the opposite accept / reject value as H
>>> and has the same accept / reject value as H. Putting this in the specs
>>> for D is freaking nuts.
>>>
>>
>> Remeber HOW the requriements are stated.
>>
>> H is required to be given a description of D, and return the same answer
>> as D would, or reject if it doesn't Halt
>>
>> D is required to use H giving the description it was given and return
>> the opposite results.
> if (H == D && D != H)
> ;
> else
> printf("Requirements are Freaking nuts!");
>
>
Typo:
It should be Olcott is Freaking Nuts.
Remember, The Requirements are the Requirements. These requirements come
out of natural logic.
There is a natural desire for a machine that decides the way that H is
defined, to give the same answer as a machine if it will halt, and some
definite answer if it won't. This would allow for all sorts of stuff to
become provable (and you would like that).
It is easy to define a machine that return the opposite answer of
another machine.
Together, these requirements show that the first machine can't be built,
because it leads to the contradiction you show. The requirements aren't
'Nuts', they are impossible, and that means that we can't get something
that would have been nice, but we can live with that.
You need to learn that there ARE things that are impossible.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-02 13:32 +0100 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <87im2w8n14.fsf@bsb.me.uk> |
| In reply to | #34401 |
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. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-02 09:40 -0500 |
| Subject | Re: Refuting the Sipser Halting Problem Proof (V1)(freaking nuts) |
| Message-ID | <9didnVwUmpDkBSr9nZ2dnUU7-TXNnZ2d@giganews.com> |
| In reply to | #34402 |
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). It looks like the diagonalization proof boils down to the impossible requirement that H(D, ⟨D⟩) == H(⟨D⟩) && H(D, ⟨D⟩) != H(⟨D⟩) 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) -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 1 of 9 [1] 2 3 4 5 6 7 8 9 Next page →
Back to top | Article view | comp.theory
csiph-web