Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #29382 > unrolled thread
| Started by | Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> |
|---|---|
| First post | 2021-03-15 23:16 +0000 |
| Last post | 2021-03-15 19:49 -0500 |
| Articles | 20 on this page of 385 — 15 participants |
Back to article view | Back to comp.theory
olcott Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-03-15 23:16 +0000
Re: olcott "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 16:27 -0700
Re: olcott "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-15 16:33 -0700
Re: olcott olcott <NoOne@NoWhere.com> - 2021-03-15 18:49 -0500
Re: olcott Richard Damon <Richard@Damon-Family.org> - 2021-03-16 07:29 -0400
The key basis of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-03-16 08:30 -0500
Re: The key basis of the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-16 15:31 +0100
Re: The key basis of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-03-16 10:02 -0500
Re: The key basis of the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-16 16:23 +0100
Re: The key basis of the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-03-16 10:44 -0500
Re: The key basis of the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-03-16 16:48 +0100
Re: olcott "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-16 11:40 -0700
Re: olcott olcott <NoOne@NoWhere.com> - 2021-03-15 18:45 -0500
Re: olcott Alan Mackenzie <acm@muc.de> - 2021-03-16 21:54 +0000
Re: olcott olcott <NoOne@NoWhere.com> - 2021-03-16 17:03 -0500
Re: olcott Alan Mackenzie <acm@muc.de> - 2021-03-16 22:21 +0000
Mistakes in evaluating my work olcott <NoOne@NoWhere.com> - 2021-03-16 17:35 -0500
Re: Mistakes in evaluating my work Alan Mackenzie <acm@muc.de> - 2021-03-16 22:56 +0000
Re: Mistakes in evaluating my work olcott <NoOne@NoWhere.com> - 2021-03-16 18:27 -0500
Re: Mistakes in evaluating my work "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-16 17:58 -0700
Re: Mistakes in evaluating my work olcott <NoOne@NoWhere.com> - 2021-03-16 20:09 -0500
Re: Mistakes in evaluating my work "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-16 18:44 -0700
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-16 20:48 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-17 15:00 -0700
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-17 17:10 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-17 17:20 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-17 15:22 -0700
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-17 17:36 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 15:43 -0700
Re: Mistakes in evaluating my work (finite string transformations are TM computable) Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:34 -0400
Re: Mistakes in evaluating my work (finite string transformations are TM computable) olcott <NoOne@NoWhere.com> - 2021-03-18 22:39 -0500
Re: Mistakes in evaluating my work (finite string transformations are TM computable) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 00:03 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-18 23:14 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 11:08 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 10:39 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:09 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 16:18 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 15:27 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 16:42 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:54 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 17:03 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 22:29 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 18:51 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the G"odel sentence) R Kym Horsell <kym@kymhorsell.com> - 2021-03-19 23:06 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 18:41 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 17:59 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 19:07 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 18:32 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 19:56 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 19:06 -0600
Re: Mistakes in evaluating my work (Wittgenstein) olcott <NoOne@NoWhere.com> - 2021-03-19 20:19 -0500
Re: Mistakes in evaluating my work (Wittgenstein) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 19:44 -0600
Re: Mistakes in evaluating my work (Wittgenstein) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:21 +0000
Re: Mistakes in evaluating my work (Wittgenstein) olcott <NoOne@NoWhere.com> - 2021-03-19 21:30 -0500
Re: Mistakes in evaluating my work (Wittgenstein) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:46 +0000
Re: Mistakes in evaluating my work (Wittgenstein) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 23:25 -0600
Re: Mistakes in evaluating my work (Wittgenstein) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:15 +0000
Re: Mistakes in evaluating my work (Wittgenstein) olcott <NoOne@NoWhere.com> - 2021-03-19 21:24 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:13 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 20:30 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 22:07 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 23:30 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 20:32 -0700
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:02 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 01:05 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-19 20:15 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:01 +0000
Re: Mistakes in evaluating my work (Wittgenstein) olcott <NoOne@NoWhere.com> - 2021-03-19 21:21 -0500
Re: Mistakes in evaluating my work (Wittgenstein) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 02:41 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-19 22:11 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 14:49 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 09:55 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 15:18 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 11:03 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 11:20 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 10:36 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 11:42 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 10:59 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 12:14 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 12:14 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 13:50 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 12:55 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 14:13 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 13:43 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 14:46 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 14:13 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 15:26 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 16:10 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 17:53 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 17:11 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 18:18 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 18:02 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 19:07 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 18:17 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 19:33 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 18:44 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 19:51 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 19:22 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 20:33 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 20:02 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 21:10 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 20:20 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 21:31 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 21:01 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 23:13 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 23:23 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 09:48 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-21 13:03 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-21 18:41 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 09:22 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 21:16 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-25 20:23 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 22:53 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-25 21:58 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 23:25 -0400
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-25 22:28 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Richard Damon <Richard@Damon-Family.org> - 2021-03-25 23:55 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-25 23:23 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 07:42 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 10:22 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) André G. Isaak <agisaak@gm.invalid> - 2021-03-26 17:14 -0600
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 19:59 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-26 09:44 -0700
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 12:52 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Andy Walker <anw@cuboid.co.uk> - 2021-03-26 19:10 +0000
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 14:34 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Andy Walker <anw@cuboid.co.uk> - 2021-03-26 23:21 +0000
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 18:53 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 20:14 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) Andy Walker <anw@cuboid.co.uk> - 2021-03-27 13:21 +0000
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-27 09:05 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-27 13:38 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 14:52 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-26 20:02 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-27 04:48 -0700
Re: Mistakes in evaluating my work (UTM / halt decider) Andy Walker <anw@cuboid.co.uk> - 2021-03-27 12:37 +0000
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-27 08:53 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-27 08:34 -0500
Re: Mistakes in evaluating my work (UTM / halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-03-27 10:44 -0400
Re: Mistakes in evaluating my work (UTM / halt decider) olcott <NoOne@NoWhere.com> - 2021-03-26 18:33 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 18:46 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 18:45 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 13:51 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-20 23:30 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 19:00 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-21 07:47 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 10:19 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-22 16:43 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 11:56 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 11:17 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 12:27 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 11:53 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 13:10 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 13:12 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 12:49 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 14:25 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 13:36 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 15:07 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 16:51 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 18:03 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 18:23 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 19:37 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 18:51 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 20:07 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 19:24 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 20:37 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 03:41 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 09:48 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 14:58 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 10:12 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Alan Mackenzie <acm@muc.de> - 2021-03-23 15:58 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 11:04 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) André G. Isaak <agisaak@gm.invalid> - 2021-03-23 10:30 -0600
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 11:43 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) André G. Isaak <agisaak@gm.invalid> - 2021-03-23 11:46 -0600
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 12:58 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 22:03 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 21:58 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 16:41 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 12:10 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 17:36 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 12:53 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 23:14 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 18:36 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-24 00:56 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 20:22 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-23 18:28 -0700
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-24 17:17 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-24 12:25 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-24 13:45 -0700
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-23 18:30 -0700
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) André G. Isaak <agisaak@gm.invalid> - 2021-03-23 19:35 -0600
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 22:00 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 23:37 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 21:53 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 16:00 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) olcott <NoOne@NoWhere.com> - 2021-03-23 11:24 -0500
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-23 16:42 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 21:48 +0000
Re: Mistakes in evaluating my work (Occurs check proves [ G = ~Provable(G) ] is infinitely recursive) Peter <peterxpercival@hotmail.com> - 2021-03-23 16:10 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-22 19:50 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-22 14:49 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-22 19:32 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 14:51 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-22 17:22 +0000
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-22 12:31 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory)(V2) olcott <NoOne@NoWhere.com> - 2021-03-20 12:52 -0500
Re: Mistakes in evaluating my work (Wittgenstein) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 23:33 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 09:19 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 09:32 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 08:46 -0600
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) olcott <NoOne@NoWhere.com> - 2021-03-20 09:53 -0500
Re: Mistakes in evaluating my work (Wittgenstein: Gödel sentence is self-contradictory) André G. Isaak <agisaak@gm.invalid> - 2021-03-20 09:28 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Andy Walker <anw@cuboid.co.uk> - 2021-03-20 13:22 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Jeff Barnett <jbb@notatt.com> - 2021-03-20 11:11 -0600
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Andy Walker <anw@cuboid.co.uk> - 2021-03-20 17:57 +0000
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) olcott <NoOne@NoWhere.com> - 2021-03-20 13:02 -0500
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:00 -0400
Re: Mistakes in evaluating my work (Liar Paradox and the Gödel sentence) André G. Isaak <agisaak@gm.invalid> - 2021-03-19 18:05 -0600
Re: Mistakes in evaluating my work Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 01:54 +0000
Re: Mistakes in evaluating my work Richard Damon <Richard@Damon-Family.org> - 2021-03-18 07:27 -0400
Re: Mistakes in evaluating my work Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 01:53 +0000
Re: Mistakes in evaluating my work Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 01:52 +0000
Re: Mistakes in evaluating my work Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 01:43 +0000
Re: Mistakes in evaluating my work (Kaz mistake) olcott <NoOne@NoWhere.com> - 2021-03-16 20:58 -0500
Re: Mistakes in evaluating my work (Kaz mistake) Richard Damon <Richard@Damon-Family.org> - 2021-03-18 08:04 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] olcott <NoOne@NoWhere.com> - 2021-03-16 22:03 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 03:43 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] olcott <NoOne@NoWhere.com> - 2021-03-16 22:52 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 00:38 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-17 00:40 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 06:35 -0700
Re: Bob Andy Walker <anw@cuboid.co.uk> - 2021-03-17 20:10 +0000
Re: Bob Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 13:31 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-17 13:25 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [prerequisite to further dialogue] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 14:50 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 11:08 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 09:46 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 17:20 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 12:54 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 18:20 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 13:29 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 18:49 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 11:55 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 14:03 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 12:11 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-17 19:14 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 12:37 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 15:55 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-17 15:08 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 16:16 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 14:30 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-17 15:35 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 16:42 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-17 15:56 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 17:07 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-17 17:17 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 17:22 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 19:28 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 17:47 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-17 23:13 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-17 22:19 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 22:01 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 10:02 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-18 09:52 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 16:56 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 16:27 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 17:41 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:25 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:39 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 22:43 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 16:33 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 15:41 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 17:29 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-19 08:02 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 09:14 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 16:35 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 23:08 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 18:22 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 00:01 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 19:10 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 01:28 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 20:59 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:35 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 00:11 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 19:27 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 01:24 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 20:57 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 02:15 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 21:36 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:45 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:49 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 17:34 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 12:56 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 16:22 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-03-19 00:48 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 17:45 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 12:59 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 15:46 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 10:51 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 20:24 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-19 10:00 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 12:05 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 20:31 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 15:36 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:35 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 17:01 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 10:33 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 12:47 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 12:26 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 13:40 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 13:01 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 14:51 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 14:39 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:36 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 22:41 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 11:12 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 10:45 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 12:07 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 11:39 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 16:09 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 18:48 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 14:39 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 20:50 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 09:36 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 14:50 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-17 14:13 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-18 08:08 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 07:35 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Daniel Pehoushek <pehoushek1@gmail.com> - 2021-03-18 07:23 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-18 17:56 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 13:32 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] André G. Isaak <agisaak@gm.invalid> - 2021-03-18 13:00 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [André is not too bright?] olcott <NoOne@NoWhere.com> - 2021-03-18 14:51 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-18 23:47 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-18 22:52 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 10:04 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 09:17 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 11:17 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 10:49 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 12:12 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] olcott <NoOne@NoWhere.com> - 2021-03-19 11:41 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 16:12 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-19 20:28 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-19 13:32 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] R Kym Horsell <kym@kymhorsell.com> - 2021-03-19 21:01 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:29 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] R Kym Horsell <kym@kymhorsell.com> - 2021-03-19 21:48 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-19 21:13 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-19 14:21 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] R Kym Horsell <kym@kymhorsell.com> - 2021-03-19 21:51 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-20 14:05 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-20 09:02 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:16 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-20 13:11 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 20:04 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-03-19 13:14 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 15:25 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 18:15 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 17:21 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 18:56 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 18:02 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:24 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 20:31 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 22:00 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] olcott <NoOne@NoWhere.com> - 2021-03-19 15:23 -0500
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-19 21:18 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [Did math screw up?] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 18:22 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-19 16:13 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-19 21:30 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-20 10:04 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Jeff Barnett <jbb@notatt.com> - 2021-03-20 11:20 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-21 19:59 -0700
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-21 23:15 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Jeff Barnett <jbb@notatt.com> - 2021-03-21 21:37 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-22 12:43 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] R Kym Horsell <kym@kymhorsell.com> - 2021-03-22 13:21 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Jeff Barnett <jbb@notatt.com> - 2021-03-22 11:45 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Andy Walker <anw@cuboid.co.uk> - 2021-03-22 21:44 +0000
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Jeff Barnett <jbb@notatt.com> - 2021-03-22 16:47 -0600
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] Richard Damon <Richard@Damon-Family.org> - 2021-03-20 16:22 -0400
Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-03-21 20:07 -0700
Re: Mistakes in evaluating my work Richard Damon <Richard@Damon-Family.org> - 2021-03-18 07:23 -0400
Re: olcott R Kym Horsell <kym@kymhorsell.com> - 2021-03-16 00:38 +0000
Re: olcott olcott <NoOne@NoWhere.com> - 2021-03-15 19:49 -0500
Page 14 of 20 — ← Prev page 1 … 12 13 [14] 15 16 … 20 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-17 23:13 -0400 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <Nzz4I.2$dj.0@fx23.iad> |
| In reply to | #29553 |
On 3/17/21 8:28 PM, olcott wrote: > The function call interface is only provided for user-code to invoke > Halts() functionality. The actual Halts() embedded into the x86utm > operating system simply monitors the simulation of all machine > descriptions. > Which means that Halts is NOT the equivalent of a Turing Machine, so H_Hat has been built wrong. H^ is defined as wrapping the ACTUAL Turing Machine that is making the decision. That would be your WHOLE x86UTM OS. The fact that your OS doesn't really allow this says that it isn't really a UTM, and likely not even Turing Complete. Having this level of fundamental flaw makes your whole arguement broken, and it is clear that you have worded very hard to make you system have this defect as that is the whole basis of your flawed argument.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-17 22:19 -0500 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <Y4-dnZ1nq40qW8_9nZ2dnUU78LXNnZ2d@giganews.com> |
| In reply to | #29555 |
On 3/17/2021 10:13 PM, Richard Damon wrote: > On 3/17/21 8:28 PM, olcott wrote: > >> The function call interface is only provided for user-code to invoke >> Halts() functionality. The actual Halts() embedded into the x86utm >> operating system simply monitors the simulation of all machine >> descriptions. >> > > Which means that Halts is NOT the equivalent of a Turing Machine, so > H_Hat has been built wrong. > Apparently no one here is a reliable source on this: https://en.wikipedia.org/wiki/Turing_machine_equivalents I have already proved that the subset of the x86 language that I use <is> RASP equivalent. > H^ is defined as wrapping the ACTUAL Turing Machine that is making the > decision. That would be your WHOLE x86UTM OS. The fact that your OS > doesn't really allow this says that it isn't really a UTM, and likely > not even Turing Complete. > Anyone knowing software engineering knows that functionality invoked with a function call is an equivalent computation to inline code. > Having this level of fundamental flaw makes your whole arguement broken, > and it is clear that you have worded very hard to make you system have > this defect as that is the whole basis of your flawed argument. > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-03-17 22:01 -0700 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <d15ffbf1-2899-43d3-bc74-86fcc3309091n@googlegroups.com> |
| In reply to | #29556 |
> Apparently no one here is a reliable source on this: > https://en.wikipedia.org/wiki/Turing_machine_equivalents > > I have already proved that the subset of the x86 language that I use > <is> RASP equivalent. > > H^ is defined as wrapping the ACTUAL Turing Machine that is making the > > decision. That would be your WHOLE x86UTM OS. The fact that your OS > > doesn't really allow this says that it isn't really a UTM, and likely > > not even Turing Complete. > > > Anyone knowing software engineering knows that functionality invoked > with a function call is an equivalent computation to inline code. did you notice bob uses zero negations zero minuses zero exclusive ors frankly i think monotone reason is Spock level fascinating bobs procedures are ruled mainly by plus ones of counters bob completely solves small logical forms is bob Turing machine equivalent? and well honestly when bob is faced with small unsatisfiability bob just says zero then moves on with zero consideration given to ending it all so my guess is that bob is not a Turing equivalent machine little zeroes are nothings to bob that is as deep as it gets when bob says zero no end-is-near-problems at all so inequivalent is bob bob shall be called Turing Inequivalent zero fear of zero is bobs way > Copyright 2021 Pete Olcott > > "Great spirits have always encountered violent opposition from mediocre > minds." Einstein "ignorant minds are opposite forces whether or not there is violence." daniel (little d)
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-18 10:02 +0000 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <20210318023717.628@kylheku.com> |
| In reply to | #29556 |
On 2021-03-18, olcott <NoOne@NoWhere.com> wrote:
> On 3/17/2021 10:13 PM, Richard Damon wrote:
>> On 3/17/21 8:28 PM, olcott wrote:
>>
>>> The function call interface is only provided for user-code to invoke
>>> Halts() functionality. The actual Halts() embedded into the x86utm
>>> operating system simply monitors the simulation of all machine
>>> descriptions.
>>>
>>
>> Which means that Halts is NOT the equivalent of a Turing Machine, so
>> H_Hat has been built wrong.
>>
>
> Apparently no one here is a reliable source on this:
> https://en.wikipedia.org/wiki/Turing_machine_equivalents
Halts is categorically not a Turing machine. It is a function.
A Turing machine is a complete computation including input.
A function that takes no argument is a Turing machine, as is
a function that is applied to arguments.
Thus, Halts APPLIED TO ARGUMENTS is required to be a Turing machine.
That is not enough; Halts must be THE SAME Turing machine every time it
is applied to the same arguments, regardless of any context, such as
different points in the the history of execution of another machine.
Turing machines have no external context. The content of the tape,
and the tape machine's deterministic mechanism, is the entire
univers. There is nothing outside the universe. No bread crumbs
from any prior execution trace, nothing.
> I have already proved that the subset of the x86 language that I use
><is> RASP equivalent.
The x86 language is impure; it works by mutating state such as
the machine registers.
High level programming languages use machine languages like x86 in
extremely disciplined, structured ways, according to well-defined rules,
in order to make it possible to express functions. For instance, a
function must preserve certain registers, and the position of the stack.
When those languages expose mutability and imperative control flow,
additional coding rules must be obeyed in order for a procedure to be a
function, such as that it must not refer to any external state, only its
arguments, literal constants, and static, immutable data.
>
> Anyone knowing software engineering knows that functionality invoked
> with a function call is an equivalent computation to inline code.
You don't.
I have previously explained to you that these two functions are
identical, except for name.
void H_Hat(u32 P)
{
if (Halts(P, P))
again: goto again;
}
void Test(u32 P)
{
if (Halts(P, P))
again: goto again;
}
The call H_Hat((u32) H_Hat) is equivalent to Test((u32) H_Hat).
The compiler may inline EITHER this:
int main(void) {
H_Hat((u32) H_Hat);
}
OR this:
int main(void) {
Test((u32) H_Hat);
}
to this:
int main(void) {
if (Halts((u32 H_Hat, (u32) H_Hat)
again: goto again;
}
yet your execution traces claim different behaviors, and you defend
that erroneous situation.
--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-03-18 09:52 -0700 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <86185d41-60a3-47e4-9a37-cfdfc0fbcda8n@googlegroups.com> |
| In reply to | #29577 |
picking on tiny little ticks
about cycle detection
while looping over
all the outputs
about inputs
or we could discuss
bobs ten C++ line mind
using faith as the
logicians algorithm
faith in resolution
faith in subsumption
in a couple lines of code
inline joy faith(register num w) { when((count + one) < wyde()) for (register num g = zero;env::eon() && g < numbols.size(); g++)
when(isnay((w & (one << g)) ? (w & diagovreason[g]) : (w + (one << g)))) (*env::allBobs[soubs[g]]).yaystonays(rempos(g, w)); // resolution
when (count) for (register num g = zero; env::eon() && g < soups.size(); g++) { register num ug = intosoups[g]; register num apw = addpos(ug, w);
register Bob* supe = env::allBobs[soups[g]]; (*supe).yaystonays(apw); (*supe).yaystonays(apw + (one << ug)); } } // subsumption
sayvum inline num addpos(register num p, register num s) { return((s >> p) << (p + one)) + (s & tau[p]); }
sayvum inline num rempos(register num p, register num s) { return((s >> (p + one)) << p) + (s & tau[p]); }
On Thursday, March 18, 2021 at 12:40:33 PM UTC-4, Kaz Kylheku wrote:
> On 2021-03-18, olcott <No...@NoWhere.com> wrote:
> > On 3/17/2021 10:13 PM, Richard Damon wrote:
> >> On 3/17/21 8:28 PM, olcott wrote:
> >>
> >>> The function call interface is only provided for user-code to invoke
> >>> Halts() functionality. The actual Halts() embedded into the x86utm
> >>> operating system simply monitors the simulation of all machine
> >>> descriptions.
> >>>
> >>
> >> Which means that Halts is NOT the equivalent of a Turing Machine, so
> >> H_Hat has been built wrong.
> >>
> >
> > Apparently no one here is a reliable source on this:
> > https://en.wikipedia.org/wiki/Turing_machine_equivalents
> Halts is categorically not a Turing machine. It is a function.
> A Turing machine is a complete computation including input.
> A function that takes no argument is a Turing machine, as is
> a function that is applied to arguments.
>
> Thus, Halts APPLIED TO ARGUMENTS is required to be a Turing machine.
>
> That is not enough; Halts must be THE SAME Turing machine every time it
> is applied to the same arguments, regardless of any context, such as
> different points in the the history of execution of another machine.
>
> Turing machines have no external context. The content of the tape,
> and the tape machine's deterministic mechanism, is the entire
> univers. There is nothing outside the universe. No bread crumbs
> from any prior execution trace, nothing.
> > I have already proved that the subset of the x86 language that I use
> ><is> RASP equivalent.
> The x86 language is impure; it works by mutating state such as
> the machine registers.
>
> High level programming languages use machine languages like x86 in
> extremely disciplined, structured ways, according to well-defined rules,
> in order to make it possible to express functions. For instance, a
> function must preserve certain registers, and the position of the stack.
>
> When those languages expose mutability and imperative control flow,
> additional coding rules must be obeyed in order for a procedure to be a
> function, such as that it must not refer to any external state, only its
> arguments, literal constants, and static, immutable data.
> >
> > Anyone knowing software engineering knows that functionality invoked
> > with a function call is an equivalent computation to inline code.
> You don't.
>
> I have previously explained to you that these two functions are
> identical, except for name.
>
> void H_Hat(u32 P)
> {
> if (Halts(P, P))
> again: goto again;
> }
>
> void Test(u32 P)
> {
> if (Halts(P, P))
> again: goto again;
> }
>
> The call H_Hat((u32) H_Hat) is equivalent to Test((u32) H_Hat).
>
> The compiler may inline EITHER this:
>
> int main(void) {
> H_Hat((u32) H_Hat);
> }
>
> OR this:
>
> int main(void) {
> Test((u32) H_Hat);
> }
>
> to this:
>
> int main(void) {
> if (Halts((u32 H_Hat, (u32) H_Hat)
> again: goto again;
> }
>
> yet your execution traces claim different behaviors, and you defend
> that erroneous situation.
> --
> TXR Programming Language: http://nongnu.org/txr
> Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-18 16:56 -0500 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <m4WdnaxThYUeUc79nZ2dnUU7-QnNnZ2d@giganews.com> |
| In reply to | #29553 |
On 3/18/2021 4:41 PM, André G. Isaak wrote:
> On 2021-03-18 15:33, olcott wrote:
>> On 3/18/2021 3:39 PM, André G. Isaak wrote:
>>> On 2021-03-18 13:51, olcott wrote:
>>>> On 3/18/2021 2:01 PM, André G. Isaak wrote:
>>>>> On 2021-03-18 12:40, olcott wrote:
>>>>>> On 3/18/2021 1:26 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-18 11:47, olcott wrote:
>>>>>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>>>>
>>>>>>>>> So you're basically saying that all the calls to Halts() in the
>>>>>>>>> code you've shown aren't actually calls to your halt decider,
>>>>>>>>> but to something else, which makes it even more clear that your
>>>>>>>>> H_Hat isn't actually derived from your Halt decider.
>>>>>>>>>
>>>>>>>>> André
>>>>>>>>>
>>>>>>>>
>>>>>>>> Call to the halt decider can be thought of as examining the
>>>>>>>> global execution trace from the machine address specified as its
>>>>>>>> first parameter, forward.
>>>>>>>>
>>>>>>>> The first invocation of this halt decider is made by the x86utm
>>>>>>>> operating system and has the code entry point** as its machine
>>>>>>>> address parameter. ** machine address of main().
>>>>>>>
>>>>>>> Which means it doesn't meaningfully correspond to H in any of the
>>>>>>> proofs you deal with since those require two inputs.
>>>>>>>
>>>>>>> And your H_Hat is not based upon this 'halt decider' as it needs
>>>>>>> to be to address any of these proofs. You derive it instead from
>>>>>>> some other function which you say is there for 'user space'
>>>>>>> programs.
>>>>>>>
>>>>>>> H_Hat must be derived from the actual halt decider. Not from some
>>>>>>> special 'user space' glue code. That means your 'global' decider.
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> I have shown that Halts() does correctly decide that it was called
>>>>>> in infinite recursion without having to look at the parameters on
>>>>>> the stack.
>>>>>>
>>>>>> I have also shown exactly how my code corresponds to the
>>>>>> {Sipser, Kozen, Linz} proofs in my appendix.
>>>>>
>>>>> No, you have not.
>>>>>
>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>
>>>>>>
>>>>>> You can simply assume that this is not true.
>>>>>> You cannot show that this is not true.
>>>>>
>>>>> Nothing above addresses any of my points. What was the purpose for
>>>>> this reply?
>>>>>
>>>>> André
>>>>>
>>>>
>>>> The four page paper addresses your points.
>>>> I continue to rewrite it.
>>>
>>> You may *think* that it does, but it really doesn't.
>>>
>>> The 'key point', to use your favourite term, in all of the proofs
>>> that you mention is that H and H_Hat stand in a very specific
>>> relationship to one another. You break that relation.
>>
>> Appendix
>>
>> Key basis of the {Sipser, Kozen, Linz} halting problem undecidability
>> proofs.
>>
>> The following code implements the key basis of the {Sipser, Kozen,
>> Linz} halting problem undecidability proofs:
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Would_Halt = Halts(P, P);
>> if (Input_Would_Halt)
>> HERE: goto HERE;
>> }
>>
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> Output("Input_Would_Halt = ", Input_Would_Halt);
>> }
>>
>> In that the input program is defined to
>> "do the opposite of whatever the halt decider decides".
>
> You really ought to stop using that expression. It has two different
> meanings in English (_de re_ vs. _de dicto_) which you keep conflating.
>
>> Here are quotes from {Sipser, Kozen, Linz} showing that key basis:
>>
>> Now we construct a new Turing machine D with H as a subroutine. This
>> new TM calls H to determine what M does when the input to M is its own
>> description ⟨M⟩.
>> Once D has determined this information, it does the opposite.
>> (Sipser:1997:165)
>>
>> Suppose (for a contradiction) that there existed a total machine K
>> accepting the set HP...
>> • K halts and accepts if M halts on x, and
>> • K halts and rejects if M loops on x.
>> Consider a machine N ...
>> accepting if K rejects and going into a trivial loop if K accepts.
>> (Kozen:1997:233)
>>
>> ...Turing machine H will halt with either a yes or no answer. We
>> achieve this by asking that H halt in one of two corresponding final
>> states, say, qy or qn...
>> Next, we modify H to produce a Turing machine H'... in situations
>> where H reaches qy and halts, the modified machine H' will enter an
>> infinite loop. (Linz:1990:318-319)
>>
>> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
>> Lexington/Toronto: D. C. Heath and Company. (315-320)
>>
>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>> Boston: PWS Publishing Company (165-167)
>>
>> Kozen, Dexter 1997. Automata and Computability. New York:
>> Springer-Verlag. (231-234).
>>
>>
>> I just proved that you are wrong and I did it with cut-and-paste from
>> my paper:
>
> You can cut and paste it as many times as you want. It doesn't address
> my point, which is that the function which you call 'Halts' above isn't
> actually your halt decider. It's just an interface for 'user programs'
> to use.
>
It is closer in this regard to an actual Turing machine that never has
any actual input parameters it only has data on its tape. My UTM's tape
is a single contiguous block of memory.
> Your actual halt decider, which you don't actually show, is the one that
> is used when you invoke Halts(main) which is a separate routine as
> evidence by the fact that it takes different input.
There is one UTM / halt decider that I implement as one x86 emulator /
halt decider.
> Your H_Hat needs to
> stand in the correct relation to *this* program, not to the other
> 'halts' function.
This seems to be over your head.
> Why don't you actually *show* the code in which halts(main) is invoked
> so people can see exactly what you are doing rather than posting these
> partial snippets?
>
> André
>
(1) It is not fully rewritten yet.
(2) Publishing the code may reduce my chances that an academic journal
will want to publish my work, they usually only want to publish
unpublished work.
(3) If you can't understand the machine code execution trace you won't
be able to understand a program that is based on this machine code
execution trace.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-18 16:27 -0600 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <s30k4b$pd3$1@dont-email.me> |
| In reply to | #29570 |
On 2021-03-18 15:56, olcott wrote:
> On 3/18/2021 4:41 PM, André G. Isaak wrote:
>> On 2021-03-18 15:33, olcott wrote:
>>> On 3/18/2021 3:39 PM, André G. Isaak wrote:
>>>> On 2021-03-18 13:51, olcott wrote:
>>>>> On 3/18/2021 2:01 PM, André G. Isaak wrote:
>>>>>> On 2021-03-18 12:40, olcott wrote:
>>>>>>> On 3/18/2021 1:26 PM, André G. Isaak wrote:
>>>>>>>> On 2021-03-18 11:47, olcott wrote:
>>>>>>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>>>>>
>>>>>>>>>> So you're basically saying that all the calls to Halts() in
>>>>>>>>>> the code you've shown aren't actually calls to your halt
>>>>>>>>>> decider, but to something else, which makes it even more clear
>>>>>>>>>> that your H_Hat isn't actually derived from your Halt decider.
>>>>>>>>>>
>>>>>>>>>> André
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Call to the halt decider can be thought of as examining the
>>>>>>>>> global execution trace from the machine address specified as
>>>>>>>>> its first parameter, forward.
>>>>>>>>>
>>>>>>>>> The first invocation of this halt decider is made by the x86utm
>>>>>>>>> operating system and has the code entry point** as its machine
>>>>>>>>> address parameter. ** machine address of main().
>>>>>>>>
>>>>>>>> Which means it doesn't meaningfully correspond to H in any of
>>>>>>>> the proofs you deal with since those require two inputs.
>>>>>>>>
>>>>>>>> And your H_Hat is not based upon this 'halt decider' as it needs
>>>>>>>> to be to address any of these proofs. You derive it instead from
>>>>>>>> some other function which you say is there for 'user space'
>>>>>>>> programs.
>>>>>>>>
>>>>>>>> H_Hat must be derived from the actual halt decider. Not from
>>>>>>>> some special 'user space' glue code. That means your 'global'
>>>>>>>> decider.
>>>>>>>>
>>>>>>>> André
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> I have shown that Halts() does correctly decide that it was
>>>>>>> called in infinite recursion without having to look at the
>>>>>>> parameters on the stack.
>>>>>>>
>>>>>>> I have also shown exactly how my code corresponds to the
>>>>>>> {Sipser, Kozen, Linz} proofs in my appendix.
>>>>>>
>>>>>> No, you have not.
>>>>>>
>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>
>>>>>>>
>>>>>>> You can simply assume that this is not true.
>>>>>>> You cannot show that this is not true.
>>>>>>
>>>>>> Nothing above addresses any of my points. What was the purpose for
>>>>>> this reply?
>>>>>>
>>>>>> André
>>>>>>
>>>>>
>>>>> The four page paper addresses your points.
>>>>> I continue to rewrite it.
>>>>
>>>> You may *think* that it does, but it really doesn't.
>>>>
>>>> The 'key point', to use your favourite term, in all of the proofs
>>>> that you mention is that H and H_Hat stand in a very specific
>>>> relationship to one another. You break that relation.
>>>
>>> Appendix
>>>
>>> Key basis of the {Sipser, Kozen, Linz} halting problem undecidability
>>> proofs.
>>>
>>> The following code implements the key basis of the {Sipser, Kozen,
>>> Linz} halting problem undecidability proofs:
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Would_Halt = Halts(P, P);
>>> if (Input_Would_Halt)
>>> HERE: goto HERE;
>>> }
>>>
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>> }
>>>
>>> In that the input program is defined to
>>> "do the opposite of whatever the halt decider decides".
>>
>> You really ought to stop using that expression. It has two different
>> meanings in English (_de re_ vs. _de dicto_) which you keep conflating.
>>
>>> Here are quotes from {Sipser, Kozen, Linz} showing that key basis:
>>>
>>> Now we construct a new Turing machine D with H as a subroutine. This
>>> new TM calls H to determine what M does when the input to M is its
>>> own description ⟨M⟩.
>>> Once D has determined this information, it does the opposite.
>>> (Sipser:1997:165)
>>>
>>> Suppose (for a contradiction) that there existed a total machine K
>>> accepting the set HP...
>>> • K halts and accepts if M halts on x, and
>>> • K halts and rejects if M loops on x.
>>> Consider a machine N ...
>>> accepting if K rejects and going into a trivial loop if K accepts.
>>> (Kozen:1997:233)
>>>
>>> ...Turing machine H will halt with either a yes or no answer. We
>>> achieve this by asking that H halt in one of two corresponding final
>>> states, say, qy or qn...
>>> Next, we modify H to produce a Turing machine H'... in situations
>>> where H reaches qy and halts, the modified machine H' will enter an
>>> infinite loop. (Linz:1990:318-319)
>>>
>>> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
>>> Lexington/Toronto: D. C. Heath and Company. (315-320)
>>>
>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>> Boston: PWS Publishing Company (165-167)
>>>
>>> Kozen, Dexter 1997. Automata and Computability. New York:
>>> Springer-Verlag. (231-234).
>>>
>>>
>>> I just proved that you are wrong and I did it with cut-and-paste from
>>> my paper:
>>
>> You can cut and paste it as many times as you want. It doesn't address
>> my point, which is that the function which you call 'Halts' above
>> isn't actually your halt decider. It's just an interface for 'user
>> programs' to use.
>>
>
> It is closer in this regard to an actual Turing machine that never has
> any actual input parameters it only has data on its tape. My UTM's tape
> is a single contiguous block of memory.
Whether that is true or not, it has absolutely nothing to do with
establishing whether your halt decider stands in the correct relation to
your H_Hat.
>> Your actual halt decider, which you don't actually show, is the one
>> that is used when you invoke Halts(main) which is a separate routine
>> as evidence by the fact that it takes different input.
>
> There is one UTM / halt decider that I implement as one x86 emulator /
> halt decider.
So how do you end up with a call Halts(main) which takes only one
argument, and another call Halts(H_Hat, H_Hat) which takes two?
>> Your H_Hat needs to stand in the correct relation to *this* program,
>> not to the other 'halts' function.
>
> This seems to be over your head.
Back acha.
>> Why don't you actually *show* the code in which halts(main) is invoked
>> so people can see exactly what you are doing rather than posting these
>> partial snippets?
>>
>> André
>>
>
> (1) It is not fully rewritten yet.
So post the unrewritten version.
> (2) Publishing the code may reduce my chances that an academic journal
> will want to publish my work, they usually only want to publish
> unpublished work.
The technical term for that is 'cop-out'. An academic journal will be
interested in a *proof*, not some piece of code.
> (3) If you can't understand the machine code execution trace you won't
> be able to understand a program that is based on this machine code
> execution trace.
Partial/selectively-edited execution traces tell us absolutely nothing.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-18 17:41 -0500 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <ftedncs6ydm-Ss79nZ2dnUU7-VvNnZ2d@giganews.com> |
| In reply to | #29587 |
On 3/18/2021 5:27 PM, André G. Isaak wrote:
> On 2021-03-18 15:56, olcott wrote:
>> On 3/18/2021 4:41 PM, André G. Isaak wrote:
>>> On 2021-03-18 15:33, olcott wrote:
>>>> On 3/18/2021 3:39 PM, André G. Isaak wrote:
>>>>> On 2021-03-18 13:51, olcott wrote:
>>>>>> On 3/18/2021 2:01 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-18 12:40, olcott wrote:
>>>>>>>> On 3/18/2021 1:26 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-03-18 11:47, olcott wrote:
>>>>>>>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>>>>>>
>>>>>>>>>>> So you're basically saying that all the calls to Halts() in
>>>>>>>>>>> the code you've shown aren't actually calls to your halt
>>>>>>>>>>> decider, but to something else, which makes it even more
>>>>>>>>>>> clear that your H_Hat isn't actually derived from your Halt
>>>>>>>>>>> decider.
>>>>>>>>>>>
>>>>>>>>>>> André
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Call to the halt decider can be thought of as examining the
>>>>>>>>>> global execution trace from the machine address specified as
>>>>>>>>>> its first parameter, forward.
>>>>>>>>>>
>>>>>>>>>> The first invocation of this halt decider is made by the
>>>>>>>>>> x86utm operating system and has the code entry point** as its
>>>>>>>>>> machine address parameter. ** machine address of main().
>>>>>>>>>
>>>>>>>>> Which means it doesn't meaningfully correspond to H in any of
>>>>>>>>> the proofs you deal with since those require two inputs.
>>>>>>>>>
>>>>>>>>> And your H_Hat is not based upon this 'halt decider' as it
>>>>>>>>> needs to be to address any of these proofs. You derive it
>>>>>>>>> instead from some other function which you say is there for
>>>>>>>>> 'user space' programs.
>>>>>>>>>
>>>>>>>>> H_Hat must be derived from the actual halt decider. Not from
>>>>>>>>> some special 'user space' glue code. That means your 'global'
>>>>>>>>> decider.
>>>>>>>>>
>>>>>>>>> André
>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>> I have shown that Halts() does correctly decide that it was
>>>>>>>> called in infinite recursion without having to look at the
>>>>>>>> parameters on the stack.
>>>>>>>>
>>>>>>>> I have also shown exactly how my code corresponds to the
>>>>>>>> {Sipser, Kozen, Linz} proofs in my appendix.
>>>>>>>
>>>>>>> No, you have not.
>>>>>>>
>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>>
>>>>>>>>
>>>>>>>> You can simply assume that this is not true.
>>>>>>>> You cannot show that this is not true.
>>>>>>>
>>>>>>> Nothing above addresses any of my points. What was the purpose
>>>>>>> for this reply?
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> The four page paper addresses your points.
>>>>>> I continue to rewrite it.
>>>>>
>>>>> You may *think* that it does, but it really doesn't.
>>>>>
>>>>> The 'key point', to use your favourite term, in all of the proofs
>>>>> that you mention is that H and H_Hat stand in a very specific
>>>>> relationship to one another. You break that relation.
>>>>
>>>> Appendix
>>>>
>>>> Key basis of the {Sipser, Kozen, Linz} halting problem
>>>> undecidability proofs.
>>>>
>>>> The following code implements the key basis of the {Sipser, Kozen,
>>>> Linz} halting problem undecidability proofs:
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Halts(P, P);
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>> }
>>>>
>>>> In that the input program is defined to
>>>> "do the opposite of whatever the halt decider decides".
>>>
>>> You really ought to stop using that expression. It has two different
>>> meanings in English (_de re_ vs. _de dicto_) which you keep conflating.
>>>
>>>> Here are quotes from {Sipser, Kozen, Linz} showing that key basis:
>>>>
>>>> Now we construct a new Turing machine D with H as a subroutine. This
>>>> new TM calls H to determine what M does when the input to M is its
>>>> own description ⟨M⟩.
>>>> Once D has determined this information, it does the opposite.
>>>> (Sipser:1997:165)
>>>>
>>>> Suppose (for a contradiction) that there existed a total machine K
>>>> accepting the set HP...
>>>> • K halts and accepts if M halts on x, and
>>>> • K halts and rejects if M loops on x.
>>>> Consider a machine N ...
>>>> accepting if K rejects and going into a trivial loop if K accepts.
>>>> (Kozen:1997:233)
>>>>
>>>> ...Turing machine H will halt with either a yes or no answer. We
>>>> achieve this by asking that H halt in one of two corresponding final
>>>> states, say, qy or qn...
>>>> Next, we modify H to produce a Turing machine H'... in situations
>>>> where H reaches qy and halts, the modified machine H' will enter an
>>>> infinite loop. (Linz:1990:318-319)
>>>>
>>>> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
>>>> Lexington/Toronto: D. C. Heath and Company. (315-320)
>>>>
>>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>>> Boston: PWS Publishing Company (165-167)
>>>>
>>>> Kozen, Dexter 1997. Automata and Computability. New York:
>>>> Springer-Verlag. (231-234).
>>>>
>>>>
>>>> I just proved that you are wrong and I did it with cut-and-paste
>>>> from my paper:
>>>
>>> You can cut and paste it as many times as you want. It doesn't
>>> address my point, which is that the function which you call 'Halts'
>>> above isn't actually your halt decider. It's just an interface for
>>> 'user programs' to use.
>>>
>>
>> It is closer in this regard to an actual Turing machine that never has
>> any actual input parameters it only has data on its tape. My UTM's
>> tape is a single contiguous block of memory.
>
> Whether that is true or not, it has absolutely nothing to do with
> establishing whether your halt decider stands in the correct relation to
> your H_Hat.
>
>>> Your actual halt decider, which you don't actually show, is the one
>>> that is used when you invoke Halts(main) which is a separate routine
>>> as evidence by the fact that it takes different input.
>>
>> There is one UTM / halt decider that I implement as one x86 emulator /
>> halt decider.
>
> So how do you end up with a call Halts(main) which takes only one
> argument, and another call Halts(H_Hat, H_Hat) which takes two?
I just answered that in the part that you ignored (above)
-It is closer in this regard to an actual Turing machine that never has
-any actual input parameters it only has data on its tape. My UTM's
-tape is a single contiguous block of memory.
>>> Your H_Hat needs to stand in the correct relation to *this* program,
>>> not to the other 'halts' function.
>>
>> This seems to be over your head.
>
> Back acha.
>
>>> Why don't you actually *show* the code in which halts(main) is
>>> invoked so people can see exactly what you are doing rather than
>>> posting these partial snippets?
>>>
>>> André
>>>
>>
>> (1) It is not fully rewritten yet.
>
> So post the unrewritten version.
>
>> (2) Publishing the code may reduce my chances that an academic journal
>> will want to publish my work, they usually only want to publish
>> unpublished work.
>
> The technical term for that is 'cop-out'. An academic journal will be
> interested in a *proof*, not some piece of code.
THEY WILL NOT BE INTERESTED IN PUBLISHED WORK
>
>> (3) If you can't understand the machine code execution trace you won't
>> be able to understand a program that is based on this machine code
>> execution trace.
>
> Partial/selectively-edited execution traces tell us absolutely nothing.
Like I said its over your head.
>
> André
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2021-03-19 00:25 -0700 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <s31jl6$9fd$1@gioia.aioe.org> |
| In reply to | #29598 |
On 3/18/2021 3:41 PM, olcott wrote:
> On 3/18/2021 5:27 PM, André G. Isaak wrote:
>> On 2021-03-18 15:56, olcott wrote:
>>> On 3/18/2021 4:41 PM, André G. Isaak wrote:
>>>> On 2021-03-18 15:33, olcott wrote:
>>>>> On 3/18/2021 3:39 PM, André G. Isaak wrote:
>>>>>> On 2021-03-18 13:51, olcott wrote:
>>>>>>> On 3/18/2021 2:01 PM, André G. Isaak wrote:
>>>>>>>> On 2021-03-18 12:40, olcott wrote:
>>>>>>>>> On 3/18/2021 1:26 PM, André G. Isaak wrote:
>>>>>>>>>> On 2021-03-18 11:47, olcott wrote:
>>>>>>>>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>>>>>>>
>>>>>>>>>>>> So you're basically saying that all the calls to Halts() in
>>>>>>>>>>>> the code you've shown aren't actually calls to your halt
>>>>>>>>>>>> decider, but to something else, which makes it even more
>>>>>>>>>>>> clear that your H_Hat isn't actually derived from your Halt
>>>>>>>>>>>> decider.
>>>>>>>>>>>>
>>>>>>>>>>>> André
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Call to the halt decider can be thought of as examining the
>>>>>>>>>>> global execution trace from the machine address specified as
>>>>>>>>>>> its first parameter, forward.
>>>>>>>>>>>
>>>>>>>>>>> The first invocation of this halt decider is made by the
>>>>>>>>>>> x86utm operating system and has the code entry point** as its
>>>>>>>>>>> machine address parameter. ** machine address of main().
>>>>>>>>>>
>>>>>>>>>> Which means it doesn't meaningfully correspond to H in any of
>>>>>>>>>> the proofs you deal with since those require two inputs.
>>>>>>>>>>
>>>>>>>>>> And your H_Hat is not based upon this 'halt decider' as it
>>>>>>>>>> needs to be to address any of these proofs. You derive it
>>>>>>>>>> instead from some other function which you say is there for
>>>>>>>>>> 'user space' programs.
>>>>>>>>>>
>>>>>>>>>> H_Hat must be derived from the actual halt decider. Not from
>>>>>>>>>> some special 'user space' glue code. That means your 'global'
>>>>>>>>>> decider.
>>>>>>>>>>
>>>>>>>>>> André
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> I have shown that Halts() does correctly decide that it was
>>>>>>>>> called in infinite recursion without having to look at the
>>>>>>>>> parameters on the stack.
>>>>>>>>>
>>>>>>>>> I have also shown exactly how my code corresponds to the
>>>>>>>>> {Sipser, Kozen, Linz} proofs in my appendix.
>>>>>>>>
>>>>>>>> No, you have not.
>>>>>>>>
>>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>>>
>>>>>>>>>
>>>>>>>>> You can simply assume that this is not true.
>>>>>>>>> You cannot show that this is not true.
>>>>>>>>
>>>>>>>> Nothing above addresses any of my points. What was the purpose
>>>>>>>> for this reply?
>>>>>>>>
>>>>>>>> André
>>>>>>>>
>>>>>>>
>>>>>>> The four page paper addresses your points.
>>>>>>> I continue to rewrite it.
>>>>>>
>>>>>> You may *think* that it does, but it really doesn't.
>>>>>>
>>>>>> The 'key point', to use your favourite term, in all of the proofs
>>>>>> that you mention is that H and H_Hat stand in a very specific
>>>>>> relationship to one another. You break that relation.
>>>>>
>>>>> Appendix
>>>>>
>>>>> Key basis of the {Sipser, Kozen, Linz} halting problem
>>>>> undecidability proofs.
>>>>>
>>>>> The following code implements the key basis of the {Sipser, Kozen,
>>>>> Linz} halting problem undecidability proofs:
>>>>>
>>>>> void H_Hat(u32 P)
>>>>> {
>>>>> u32 Input_Would_Halt = Halts(P, P);
>>>>> if (Input_Would_Halt)
>>>>> HERE: goto HERE;
>>>>> }
>>>>>
>>>>>
>>>>> int main()
>>>>> {
>>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>>> }
>>>>>
>>>>> In that the input program is defined to
>>>>> "do the opposite of whatever the halt decider decides".
>>>>
>>>> You really ought to stop using that expression. It has two different
>>>> meanings in English (_de re_ vs. _de dicto_) which you keep conflating.
>>>>
>>>>> Here are quotes from {Sipser, Kozen, Linz} showing that key basis:
>>>>>
>>>>> Now we construct a new Turing machine D with H as a subroutine.
>>>>> This new TM calls H to determine what M does when the input to M is
>>>>> its own description ⟨M⟩.
>>>>> Once D has determined this information, it does the opposite.
>>>>> (Sipser:1997:165)
>>>>>
>>>>> Suppose (for a contradiction) that there existed a total machine K
>>>>> accepting the set HP...
>>>>> • K halts and accepts if M halts on x, and
>>>>> • K halts and rejects if M loops on x.
>>>>> Consider a machine N ...
>>>>> accepting if K rejects and going into a trivial loop if K accepts.
>>>>> (Kozen:1997:233)
>>>>>
>>>>> ...Turing machine H will halt with either a yes or no answer. We
>>>>> achieve this by asking that H halt in one of two corresponding
>>>>> final states, say, qy or qn...
>>>>> Next, we modify H to produce a Turing machine H'... in situations
>>>>> where H reaches qy and halts, the modified machine H' will enter an
>>>>> infinite loop. (Linz:1990:318-319)
>>>>>
>>>>> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
>>>>> Lexington/Toronto: D. C. Heath and Company. (315-320)
>>>>>
>>>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>>>> Boston: PWS Publishing Company (165-167)
>>>>>
>>>>> Kozen, Dexter 1997. Automata and Computability. New York:
>>>>> Springer-Verlag. (231-234).
>>>>>
>>>>>
>>>>> I just proved that you are wrong and I did it with cut-and-paste
>>>>> from my paper:
>>>>
>>>> You can cut and paste it as many times as you want. It doesn't
>>>> address my point, which is that the function which you call 'Halts'
>>>> above isn't actually your halt decider. It's just an interface for
>>>> 'user programs' to use.
>>>>
>>>
>>> It is closer in this regard to an actual Turing machine that never
>>> has any actual input parameters it only has data on its tape. My
>>> UTM's tape is a single contiguous block of memory.
>>
>> Whether that is true or not, it has absolutely nothing to do with
>> establishing whether your halt decider stands in the correct relation
>> to your H_Hat.
>>
>>>> Your actual halt decider, which you don't actually show, is the one
>>>> that is used when you invoke Halts(main) which is a separate routine
>>>> as evidence by the fact that it takes different input.
>>>
>>> There is one UTM / halt decider that I implement as one x86 emulator
>>> / halt decider.
>>
>
>> So how do you end up with a call Halts(main) which takes only one
>> argument, and another call Halts(H_Hat, H_Hat) which takes two?
>
> I just answered that in the part that you ignored (above)
> -It is closer in this regard to an actual Turing machine that never has
> -any actual input parameters it only has data on its tape. My UTM's
> -tape is a single contiguous block of memory.
>
>
>>>> Your H_Hat needs to stand in the correct relation to *this* program,
>>>> not to the other 'halts' function.
>>>
>>> This seems to be over your head.
>>
>> Back acha.
>>
>>>> Why don't you actually *show* the code in which halts(main) is
>>>> invoked so people can see exactly what you are doing rather than
>>>> posting these partial snippets?
>>>>
>>>> André
>>>>
>>>
>>> (1) It is not fully rewritten yet.
>>
>> So post the unrewritten version.
>>
>>> (2) Publishing the code may reduce my chances that an academic
>>> journal will want to publish my work, they usually only want to
>>> publish unpublished work.
>>
>> The technical term for that is 'cop-out'. An academic journal will be
>> interested in a *proof*, not some piece of code.
>
> THEY WILL NOT BE INTERESTED IN PUBLISHED WORK
This means you will never show your work. What a cop out.
>
>>
>>> (3) If you can't understand the machine code execution trace you
>>> won't be able to understand a program that is based on this machine
>>> code execution trace.
>>
>> Partial/selectively-edited execution traces tell us absolutely nothing.
>
> Like I said its over your head.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-03-18 23:39 -0400 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <v1V4I.6502$uP7.6065@fx41.iad> |
| In reply to | #29570 |
On 3/18/21 5:56 PM, olcott wrote: > > It is closer in this regard to an actual Turing machine that never has > any actual input parameters it only has data on its tape. My UTM's tape > is a single contiguous block of memory. You still don't seem to get it. The 'input parameters' to a Turing Machine is its tape and nothing but the tape. With that in mind, can you explain what you mean by has no input parameters?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-18 22:43 -0500 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <aMKdnSVNz5R7gMn9nZ2dnUU7-dednZ2d@giganews.com> |
| In reply to | #29617 |
On 3/18/2021 10:39 PM, Richard Damon wrote: > On 3/18/21 5:56 PM, olcott wrote: >> >> It is closer in this regard to an actual Turing machine that never has >> any actual input parameters it only has data on its tape. My UTM's tape >> is a single contiguous block of memory. > > You still don't seem to get it. > > The 'input parameters' to a Turing Machine is its tape and nothing but > the tape. > That is what I said in my reply to André quoted above. -- 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-03-18 16:33 -0500 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <xKudncQHAYC0Ws79nZ2dnUU7-bnNnZ2d@giganews.com> |
| In reply to | #29553 |
On 3/18/2021 3:39 PM, André G. Isaak wrote:
> On 2021-03-18 13:51, olcott wrote:
>> On 3/18/2021 2:01 PM, André G. Isaak wrote:
>>> On 2021-03-18 12:40, olcott wrote:
>>>> On 3/18/2021 1:26 PM, André G. Isaak wrote:
>>>>> On 2021-03-18 11:47, olcott wrote:
>>>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>>
>>>>>>> So you're basically saying that all the calls to Halts() in the
>>>>>>> code you've shown aren't actually calls to your halt decider, but
>>>>>>> to something else, which makes it even more clear that your H_Hat
>>>>>>> isn't actually derived from your Halt decider.
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> Call to the halt decider can be thought of as examining the global
>>>>>> execution trace from the machine address specified as its first
>>>>>> parameter, forward.
>>>>>>
>>>>>> The first invocation of this halt decider is made by the x86utm
>>>>>> operating system and has the code entry point** as its machine
>>>>>> address parameter. ** machine address of main().
>>>>>
>>>>> Which means it doesn't meaningfully correspond to H in any of the
>>>>> proofs you deal with since those require two inputs.
>>>>>
>>>>> And your H_Hat is not based upon this 'halt decider' as it needs to
>>>>> be to address any of these proofs. You derive it instead from some
>>>>> other function which you say is there for 'user space' programs.
>>>>>
>>>>> H_Hat must be derived from the actual halt decider. Not from some
>>>>> special 'user space' glue code. That means your 'global' decider.
>>>>>
>>>>> André
>>>>>
>>>>>
>>>>
>>>> I have shown that Halts() does correctly decide that it was called
>>>> in infinite recursion without having to look at the parameters on
>>>> the stack.
>>>>
>>>> I have also shown exactly how my code corresponds to the
>>>> {Sipser, Kozen, Linz} proofs in my appendix.
>>>
>>> No, you have not.
>>>
>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>
>>>>
>>>> You can simply assume that this is not true.
>>>> You cannot show that this is not true.
>>>
>>> Nothing above addresses any of my points. What was the purpose for
>>> this reply?
>>>
>>> André
>>>
>>
>> The four page paper addresses your points.
>> I continue to rewrite it.
>
> You may *think* that it does, but it really doesn't.
>
> The 'key point', to use your favourite term, in all of the proofs that
> you mention is that H and H_Hat stand in a very specific relationship to
> one another. You break that relation.
Appendix
Key basis of the {Sipser, Kozen, Linz} halting problem undecidability
proofs.
The following code implements the key basis of the {Sipser, Kozen, Linz}
halting problem undecidability proofs:
void H_Hat(u32 P)
{
u32 Input_Would_Halt = Halts(P, P);
if (Input_Would_Halt)
HERE: goto HERE;
}
int main()
{
u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
Output("Input_Would_Halt = ", Input_Would_Halt);
}
In that the input program is defined to "do the opposite of whatever the
halt decider decides". Here are quotes from {Sipser, Kozen, Linz}
showing that key basis:
Now we construct a new Turing machine D with H as a subroutine. This new
TM calls H to determine what M does when the input to M is its own
description ⟨M⟩.
Once D has determined this information, it does the opposite.
(Sipser:1997:165)
Suppose (for a contradiction) that there existed a total machine K
accepting the set HP...
• K halts and accepts if M halts on x, and
• K halts and rejects if M loops on x.
Consider a machine N ...
accepting if K rejects and going into a trivial loop if K accepts.
(Kozen:1997:233)
...Turing machine H will halt with either a yes or no answer. We achieve
this by asking that H halt in one of two corresponding final states,
say, qy or qn...
Next, we modify H to produce a Turing machine H'... in situations where
H reaches qy and halts, the modified machine H' will enter an infinite
loop. (Linz:1990:318-319)
Linz, Peter 1990. An Introduction to Formal Languages and Automata.
Lexington/Toronto: D. C. Heath and Company. (315-320)
Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
PWS Publishing Company (165-167)
Kozen, Dexter 1997. Automata and Computability. New York:
Springer-Verlag. (231-234).
I just proved that you are wrong and I did it with cut-and-paste from my
paper:
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
You can dogmatically assert that I am incorrect.
What you cannot do is point to any specific error.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-18 15:41 -0600 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <s30hej$4ih$1@dont-email.me> |
| In reply to | #29571 |
On 2021-03-18 15:33, olcott wrote:
> On 3/18/2021 3:39 PM, André G. Isaak wrote:
>> On 2021-03-18 13:51, olcott wrote:
>>> On 3/18/2021 2:01 PM, André G. Isaak wrote:
>>>> On 2021-03-18 12:40, olcott wrote:
>>>>> On 3/18/2021 1:26 PM, André G. Isaak wrote:
>>>>>> On 2021-03-18 11:47, olcott wrote:
>>>>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>>>
>>>>>>>> So you're basically saying that all the calls to Halts() in the
>>>>>>>> code you've shown aren't actually calls to your halt decider,
>>>>>>>> but to something else, which makes it even more clear that your
>>>>>>>> H_Hat isn't actually derived from your Halt decider.
>>>>>>>>
>>>>>>>> André
>>>>>>>>
>>>>>>>
>>>>>>> Call to the halt decider can be thought of as examining the
>>>>>>> global execution trace from the machine address specified as its
>>>>>>> first parameter, forward.
>>>>>>>
>>>>>>> The first invocation of this halt decider is made by the x86utm
>>>>>>> operating system and has the code entry point** as its machine
>>>>>>> address parameter. ** machine address of main().
>>>>>>
>>>>>> Which means it doesn't meaningfully correspond to H in any of the
>>>>>> proofs you deal with since those require two inputs.
>>>>>>
>>>>>> And your H_Hat is not based upon this 'halt decider' as it needs
>>>>>> to be to address any of these proofs. You derive it instead from
>>>>>> some other function which you say is there for 'user space' programs.
>>>>>>
>>>>>> H_Hat must be derived from the actual halt decider. Not from some
>>>>>> special 'user space' glue code. That means your 'global' decider.
>>>>>>
>>>>>> André
>>>>>>
>>>>>>
>>>>>
>>>>> I have shown that Halts() does correctly decide that it was called
>>>>> in infinite recursion without having to look at the parameters on
>>>>> the stack.
>>>>>
>>>>> I have also shown exactly how my code corresponds to the
>>>>> {Sipser, Kozen, Linz} proofs in my appendix.
>>>>
>>>> No, you have not.
>>>>
>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>
>>>>>
>>>>> You can simply assume that this is not true.
>>>>> You cannot show that this is not true.
>>>>
>>>> Nothing above addresses any of my points. What was the purpose for
>>>> this reply?
>>>>
>>>> André
>>>>
>>>
>>> The four page paper addresses your points.
>>> I continue to rewrite it.
>>
>> You may *think* that it does, but it really doesn't.
>>
>> The 'key point', to use your favourite term, in all of the proofs that
>> you mention is that H and H_Hat stand in a very specific relationship
>> to one another. You break that relation.
>
> Appendix
>
> Key basis of the {Sipser, Kozen, Linz} halting problem undecidability
> proofs.
>
> The following code implements the key basis of the {Sipser, Kozen, Linz}
> halting problem undecidability proofs:
>
> void H_Hat(u32 P)
> {
> u32 Input_Would_Halt = Halts(P, P);
> if (Input_Would_Halt)
> HERE: goto HERE;
> }
>
>
> int main()
> {
> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
> Output("Input_Would_Halt = ", Input_Would_Halt);
> }
>
> In that the input program is defined to
> "do the opposite of whatever the halt decider decides".
You really ought to stop using that expression. It has two different
meanings in English (_de re_ vs. _de dicto_) which you keep conflating.
> Here are quotes from {Sipser, Kozen, Linz}
> showing that key basis:
>
> Now we construct a new Turing machine D with H as a subroutine. This new
> TM calls H to determine what M does when the input to M is its own
> description ⟨M⟩.
> Once D has determined this information, it does the opposite.
> (Sipser:1997:165)
>
> Suppose (for a contradiction) that there existed a total machine K
> accepting the set HP...
> • K halts and accepts if M halts on x, and
> • K halts and rejects if M loops on x.
> Consider a machine N ...
> accepting if K rejects and going into a trivial loop if K accepts.
> (Kozen:1997:233)
>
> ...Turing machine H will halt with either a yes or no answer. We achieve
> this by asking that H halt in one of two corresponding final states,
> say, qy or qn...
> Next, we modify H to produce a Turing machine H'... in situations where
> H reaches qy and halts, the modified machine H' will enter an infinite
> loop. (Linz:1990:318-319)
>
> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
> Lexington/Toronto: D. C. Heath and Company. (315-320)
>
> Sipser, Michael 1997. Introduction to the Theory of Computation. Boston:
> PWS Publishing Company (165-167)
>
> Kozen, Dexter 1997. Automata and Computability. New York:
> Springer-Verlag. (231-234).
>
>
> I just proved that you are wrong and I did it with cut-and-paste from my
> paper:
You can cut and paste it as many times as you want. It doesn't address
my point, which is that the function which you call 'Halts' above isn't
actually your halt decider. It's just an interface for 'user programs'
to use.
Your actual halt decider, which you don't actually show, is the one that
is used when you invoke Halts(main) which is a separate routine as
evidence by the fact that it takes different input. Your H_Hat needs to
stand in the correct relation to *this* program, not to the other
'halts' function.
Why don't you actually *show* the code in which halts(main) is invoked
so people can see exactly what you are doing rather than posting these
partial snippets?
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-18 17:29 -0500 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <g6idnSy5PdvCSc79nZ2dnUU7-KPNnZ2d@giganews.com> |
| In reply to | #29573 |
On 3/18/2021 4:41 PM, André G. Isaak wrote:
> On 2021-03-18 15:33, olcott wrote:
>> On 3/18/2021 3:39 PM, André G. Isaak wrote:
>>> On 2021-03-18 13:51, olcott wrote:
>>>> On 3/18/2021 2:01 PM, André G. Isaak wrote:
>>>>> On 2021-03-18 12:40, olcott wrote:
>>>>>> On 3/18/2021 1:26 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-18 11:47, olcott wrote:
>>>>>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>>>>
>>>>>>>>> So you're basically saying that all the calls to Halts() in the
>>>>>>>>> code you've shown aren't actually calls to your halt decider,
>>>>>>>>> but to something else, which makes it even more clear that your
>>>>>>>>> H_Hat isn't actually derived from your Halt decider.
>>>>>>>>>
>>>>>>>>> André
>>>>>>>>>
>>>>>>>>
>>>>>>>> Call to the halt decider can be thought of as examining the
>>>>>>>> global execution trace from the machine address specified as its
>>>>>>>> first parameter, forward.
>>>>>>>>
>>>>>>>> The first invocation of this halt decider is made by the x86utm
>>>>>>>> operating system and has the code entry point** as its machine
>>>>>>>> address parameter. ** machine address of main().
>>>>>>>
>>>>>>> Which means it doesn't meaningfully correspond to H in any of the
>>>>>>> proofs you deal with since those require two inputs.
>>>>>>>
>>>>>>> And your H_Hat is not based upon this 'halt decider' as it needs
>>>>>>> to be to address any of these proofs. You derive it instead from
>>>>>>> some other function which you say is there for 'user space'
>>>>>>> programs.
>>>>>>>
>>>>>>> H_Hat must be derived from the actual halt decider. Not from some
>>>>>>> special 'user space' glue code. That means your 'global' decider.
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>>
>>>>>>
>>>>>> I have shown that Halts() does correctly decide that it was called
>>>>>> in infinite recursion without having to look at the parameters on
>>>>>> the stack.
>>>>>>
>>>>>> I have also shown exactly how my code corresponds to the
>>>>>> {Sipser, Kozen, Linz} proofs in my appendix.
>>>>>
>>>>> No, you have not.
>>>>>
>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>
>>>>>>
>>>>>> You can simply assume that this is not true.
>>>>>> You cannot show that this is not true.
>>>>>
>>>>> Nothing above addresses any of my points. What was the purpose for
>>>>> this reply?
>>>>>
>>>>> André
>>>>>
>>>>
>>>> The four page paper addresses your points.
>>>> I continue to rewrite it.
>>>
>>> You may *think* that it does, but it really doesn't.
>>>
>>> The 'key point', to use your favourite term, in all of the proofs
>>> that you mention is that H and H_Hat stand in a very specific
>>> relationship to one another. You break that relation.
>>
>> Appendix
>>
>> Key basis of the {Sipser, Kozen, Linz} halting problem undecidability
>> proofs.
>>
>> The following code implements the key basis of the {Sipser, Kozen,
>> Linz} halting problem undecidability proofs:
>>
>> void H_Hat(u32 P)
>> {
>> u32 Input_Would_Halt = Halts(P, P);
>> if (Input_Would_Halt)
>> HERE: goto HERE;
>> }
>>
>>
>> int main()
>> {
>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>> Output("Input_Would_Halt = ", Input_Would_Halt);
>> }
>>
>> In that the input program is defined to
>> "do the opposite of whatever the halt decider decides".
>
> You really ought to stop using that expression. It has two different
> meanings in English (_de re_ vs. _de dicto_) which you keep conflating.
>
>> Here are quotes from {Sipser, Kozen, Linz} showing that key basis:
>>
>> Now we construct a new Turing machine D with H as a subroutine. This
>> new TM calls H to determine what M does when the input to M is its own
>> description ⟨M⟩.
>> Once D has determined this information, it does the opposite.
>> (Sipser:1997:165)
>>
>> Suppose (for a contradiction) that there existed a total machine K
>> accepting the set HP...
>> • K halts and accepts if M halts on x, and
>> • K halts and rejects if M loops on x.
>> Consider a machine N ...
>> accepting if K rejects and going into a trivial loop if K accepts.
>> (Kozen:1997:233)
>>
>> ...Turing machine H will halt with either a yes or no answer. We
>> achieve this by asking that H halt in one of two corresponding final
>> states, say, qy or qn...
>> Next, we modify H to produce a Turing machine H'... in situations
>> where H reaches qy and halts, the modified machine H' will enter an
>> infinite loop. (Linz:1990:318-319)
>>
>> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
>> Lexington/Toronto: D. C. Heath and Company. (315-320)
>>
>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>> Boston: PWS Publishing Company (165-167)
>>
>> Kozen, Dexter 1997. Automata and Computability. New York:
>> Springer-Verlag. (231-234).
>>
>>
>> I just proved that you are wrong and I did it with cut-and-paste from
>> my paper:
>
> You can cut and paste it as many times as you want. It doesn't address
> my point, which is that the function which you call 'Halts' above isn't
> actually your halt decider. It's just an interface for 'user programs'
> to use.
As long as my decider input does the opposite of whatever the halt
decider says that it will do it is in the correct relation.
I can't believe that you don't get this so you must be playing head
games. Those that play head games win first prize as the biggest loser.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-03-19 08:02 -0600 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <s32atu$95u$1@dont-email.me> |
| In reply to | #29597 |
On 2021-03-18 16:29, olcott wrote:
> On 3/18/2021 4:41 PM, André G. Isaak wrote:
>> On 2021-03-18 15:33, olcott wrote:
>>> On 3/18/2021 3:39 PM, André G. Isaak wrote:
>>>> On 2021-03-18 13:51, olcott wrote:
>>>>> On 3/18/2021 2:01 PM, André G. Isaak wrote:
>>>>>> On 2021-03-18 12:40, olcott wrote:
>>>>>>> On 3/18/2021 1:26 PM, André G. Isaak wrote:
>>>>>>>> On 2021-03-18 11:47, olcott wrote:
>>>>>>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>>>>>
>>>>>>>>>> So you're basically saying that all the calls to Halts() in
>>>>>>>>>> the code you've shown aren't actually calls to your halt
>>>>>>>>>> decider, but to something else, which makes it even more clear
>>>>>>>>>> that your H_Hat isn't actually derived from your Halt decider.
>>>>>>>>>>
>>>>>>>>>> André
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Call to the halt decider can be thought of as examining the
>>>>>>>>> global execution trace from the machine address specified as
>>>>>>>>> its first parameter, forward.
>>>>>>>>>
>>>>>>>>> The first invocation of this halt decider is made by the x86utm
>>>>>>>>> operating system and has the code entry point** as its machine
>>>>>>>>> address parameter. ** machine address of main().
>>>>>>>>
>>>>>>>> Which means it doesn't meaningfully correspond to H in any of
>>>>>>>> the proofs you deal with since those require two inputs.
>>>>>>>>
>>>>>>>> And your H_Hat is not based upon this 'halt decider' as it needs
>>>>>>>> to be to address any of these proofs. You derive it instead from
>>>>>>>> some other function which you say is there for 'user space'
>>>>>>>> programs.
>>>>>>>>
>>>>>>>> H_Hat must be derived from the actual halt decider. Not from
>>>>>>>> some special 'user space' glue code. That means your 'global'
>>>>>>>> decider.
>>>>>>>>
>>>>>>>> André
>>>>>>>>
>>>>>>>>
>>>>>>>
>>>>>>> I have shown that Halts() does correctly decide that it was
>>>>>>> called in infinite recursion without having to look at the
>>>>>>> parameters on the stack.
>>>>>>>
>>>>>>> I have also shown exactly how my code corresponds to the
>>>>>>> {Sipser, Kozen, Linz} proofs in my appendix.
>>>>>>
>>>>>> No, you have not.
>>>>>>
>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>
>>>>>>>
>>>>>>> You can simply assume that this is not true.
>>>>>>> You cannot show that this is not true.
>>>>>>
>>>>>> Nothing above addresses any of my points. What was the purpose for
>>>>>> this reply?
>>>>>>
>>>>>> André
>>>>>>
>>>>>
>>>>> The four page paper addresses your points.
>>>>> I continue to rewrite it.
>>>>
>>>> You may *think* that it does, but it really doesn't.
>>>>
>>>> The 'key point', to use your favourite term, in all of the proofs
>>>> that you mention is that H and H_Hat stand in a very specific
>>>> relationship to one another. You break that relation.
>>>
>>> Appendix
>>>
>>> Key basis of the {Sipser, Kozen, Linz} halting problem undecidability
>>> proofs.
>>>
>>> The following code implements the key basis of the {Sipser, Kozen,
>>> Linz} halting problem undecidability proofs:
>>>
>>> void H_Hat(u32 P)
>>> {
>>> u32 Input_Would_Halt = Halts(P, P);
>>> if (Input_Would_Halt)
>>> HERE: goto HERE;
>>> }
>>>
>>>
>>> int main()
>>> {
>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>> }
>>>
>>> In that the input program is defined to
>>> "do the opposite of whatever the halt decider decides".
>>
>> You really ought to stop using that expression. It has two different
>> meanings in English (_de re_ vs. _de dicto_) which you keep conflating.
>>
>>> Here are quotes from {Sipser, Kozen, Linz} showing that key basis:
>>>
>>> Now we construct a new Turing machine D with H as a subroutine. This
>>> new TM calls H to determine what M does when the input to M is its
>>> own description ⟨M⟩.
>>> Once D has determined this information, it does the opposite.
>>> (Sipser:1997:165)
>>>
>>> Suppose (for a contradiction) that there existed a total machine K
>>> accepting the set HP...
>>> • K halts and accepts if M halts on x, and
>>> • K halts and rejects if M loops on x.
>>> Consider a machine N ...
>>> accepting if K rejects and going into a trivial loop if K accepts.
>>> (Kozen:1997:233)
>>>
>>> ...Turing machine H will halt with either a yes or no answer. We
>>> achieve this by asking that H halt in one of two corresponding final
>>> states, say, qy or qn...
>>> Next, we modify H to produce a Turing machine H'... in situations
>>> where H reaches qy and halts, the modified machine H' will enter an
>>> infinite loop. (Linz:1990:318-319)
>>>
>>> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
>>> Lexington/Toronto: D. C. Heath and Company. (315-320)
>>>
>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>> Boston: PWS Publishing Company (165-167)
>>>
>>> Kozen, Dexter 1997. Automata and Computability. New York:
>>> Springer-Verlag. (231-234).
>>>
>>>
>>> I just proved that you are wrong and I did it with cut-and-paste from
>>> my paper:
>>
>> You can cut and paste it as many times as you want. It doesn't address
>> my point, which is that the function which you call 'Halts' above
>> isn't actually your halt decider. It's just an interface for 'user
>> programs' to use.
>
> As long as my decider input does the opposite of whatever the halt
> decider says that it will do it is in the correct relation.
Except we don't actually *see* your real decider anywhere.
You claim that somewhere Halts(main) is invoked, but you don't show
where this occurs or how this is accomplished, nor do you show how the
results of this call is reported. Even if your unwilling to show the
entirety of your code you could minimally supply the portion which shows
these details.
To 'do the opposite of what the halt decider says' your H_Hat needs to
be be based on the code that calls Halts(main) and needs to append
behaviours at the point where that call reports its results. Otherwise
your H_Hat *isn't* following the Linz template.
André
--
To email remove 'invalid' & replace 'gm' with well known Google mail
service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-19 09:14 -0500 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <Y4GdnQijUrhVLMn9nZ2dnUU7-LvNnZ2d@giganews.com> |
| In reply to | #29631 |
On 3/19/2021 9:02 AM, André G. Isaak wrote:
> On 2021-03-18 16:29, olcott wrote:
>> On 3/18/2021 4:41 PM, André G. Isaak wrote:
>>> On 2021-03-18 15:33, olcott wrote:
>>>> On 3/18/2021 3:39 PM, André G. Isaak wrote:
>>>>> On 2021-03-18 13:51, olcott wrote:
>>>>>> On 3/18/2021 2:01 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-18 12:40, olcott wrote:
>>>>>>>> On 3/18/2021 1:26 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-03-18 11:47, olcott wrote:
>>>>>>>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>>>>>>
>>>>>>>>>>> So you're basically saying that all the calls to Halts() in
>>>>>>>>>>> the code you've shown aren't actually calls to your halt
>>>>>>>>>>> decider, but to something else, which makes it even more
>>>>>>>>>>> clear that your H_Hat isn't actually derived from your Halt
>>>>>>>>>>> decider.
>>>>>>>>>>>
>>>>>>>>>>> André
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Call to the halt decider can be thought of as examining the
>>>>>>>>>> global execution trace from the machine address specified as
>>>>>>>>>> its first parameter, forward.
>>>>>>>>>>
>>>>>>>>>> The first invocation of this halt decider is made by the
>>>>>>>>>> x86utm operating system and has the code entry point** as its
>>>>>>>>>> machine address parameter. ** machine address of main().
>>>>>>>>>
>>>>>>>>> Which means it doesn't meaningfully correspond to H in any of
>>>>>>>>> the proofs you deal with since those require two inputs.
>>>>>>>>>
>>>>>>>>> And your H_Hat is not based upon this 'halt decider' as it
>>>>>>>>> needs to be to address any of these proofs. You derive it
>>>>>>>>> instead from some other function which you say is there for
>>>>>>>>> 'user space' programs.
>>>>>>>>>
>>>>>>>>> H_Hat must be derived from the actual halt decider. Not from
>>>>>>>>> some special 'user space' glue code. That means your 'global'
>>>>>>>>> decider.
>>>>>>>>>
>>>>>>>>> André
>>>>>>>>>
>>>>>>>>>
>>>>>>>>
>>>>>>>> I have shown that Halts() does correctly decide that it was
>>>>>>>> called in infinite recursion without having to look at the
>>>>>>>> parameters on the stack.
>>>>>>>>
>>>>>>>> I have also shown exactly how my code corresponds to the
>>>>>>>> {Sipser, Kozen, Linz} proofs in my appendix.
>>>>>>>
>>>>>>> No, you have not.
>>>>>>>
>>>>>>>> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>>>>>>>>
>>>>>>>>
>>>>>>>> You can simply assume that this is not true.
>>>>>>>> You cannot show that this is not true.
>>>>>>>
>>>>>>> Nothing above addresses any of my points. What was the purpose
>>>>>>> for this reply?
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> The four page paper addresses your points.
>>>>>> I continue to rewrite it.
>>>>>
>>>>> You may *think* that it does, but it really doesn't.
>>>>>
>>>>> The 'key point', to use your favourite term, in all of the proofs
>>>>> that you mention is that H and H_Hat stand in a very specific
>>>>> relationship to one another. You break that relation.
>>>>
>>>> Appendix
>>>>
>>>> Key basis of the {Sipser, Kozen, Linz} halting problem
>>>> undecidability proofs.
>>>>
>>>> The following code implements the key basis of the {Sipser, Kozen,
>>>> Linz} halting problem undecidability proofs:
>>>>
>>>> void H_Hat(u32 P)
>>>> {
>>>> u32 Input_Would_Halt = Halts(P, P);
>>>> if (Input_Would_Halt)
>>>> HERE: goto HERE;
>>>> }
>>>>
>>>>
>>>> int main()
>>>> {
>>>> u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
>>>> Output("Input_Would_Halt = ", Input_Would_Halt);
>>>> }
>>>>
>>>> In that the input program is defined to
>>>> "do the opposite of whatever the halt decider decides".
>>>
>>> You really ought to stop using that expression. It has two different
>>> meanings in English (_de re_ vs. _de dicto_) which you keep conflating.
>>>
>>>> Here are quotes from {Sipser, Kozen, Linz} showing that key basis:
>>>>
>>>> Now we construct a new Turing machine D with H as a subroutine. This
>>>> new TM calls H to determine what M does when the input to M is its
>>>> own description ⟨M⟩.
>>>> Once D has determined this information, it does the opposite.
>>>> (Sipser:1997:165)
>>>>
>>>> Suppose (for a contradiction) that there existed a total machine K
>>>> accepting the set HP...
>>>> • K halts and accepts if M halts on x, and
>>>> • K halts and rejects if M loops on x.
>>>> Consider a machine N ...
>>>> accepting if K rejects and going into a trivial loop if K accepts.
>>>> (Kozen:1997:233)
>>>>
>>>> ...Turing machine H will halt with either a yes or no answer. We
>>>> achieve this by asking that H halt in one of two corresponding final
>>>> states, say, qy or qn...
>>>> Next, we modify H to produce a Turing machine H'... in situations
>>>> where H reaches qy and halts, the modified machine H' will enter an
>>>> infinite loop. (Linz:1990:318-319)
>>>>
>>>> Linz, Peter 1990. An Introduction to Formal Languages and Automata.
>>>> Lexington/Toronto: D. C. Heath and Company. (315-320)
>>>>
>>>> Sipser, Michael 1997. Introduction to the Theory of Computation.
>>>> Boston: PWS Publishing Company (165-167)
>>>>
>>>> Kozen, Dexter 1997. Automata and Computability. New York:
>>>> Springer-Verlag. (231-234).
>>>>
>>>>
>>>> I just proved that you are wrong and I did it with cut-and-paste
>>>> from my paper:
>>>
>>> You can cut and paste it as many times as you want. It doesn't
>>> address my point, which is that the function which you call 'Halts'
>>> above isn't actually your halt decider. It's just an interface for
>>> 'user programs' to use.
>>
>> As long as my decider input does the opposite of whatever the halt
>> decider says that it will do it is in the correct relation.
>
> Except we don't actually *see* your real decider anywhere.
>
> You claim that somewhere Halts(main) is invoked, but you don't show
> where this occurs or how this is accomplished, nor do you show how the
> results of this call is reported. Even if your unwilling to show the
> entirety of your code you could minimally supply the portion which shows
> these details.
>
If you can understand that it is correct on the basis of the execution
trace that I have provided then you won't be ale to understand it any
better by showing you the code.
> To 'do the opposite of what the halt decider says' your H_Hat needs to
> be be based on the code that calls Halts(main) and needs to append
> behaviours at the point where that call reports its results. Otherwise
> your H_Hat *isn't* following the Linz template.
>
> André
>
I don't know how to tell you that there is only a single global Halts()
that is an integral part of the x86utm operating system before you
understand this.
01 void H_Hat(u32 P)
02 {
03 u32 Input_Would_Halt = Halts(P, P);
04 if (Input_Would_Halt)
05 HERE: goto HERE;
06 }
07 int main()
08 {
09 H_Hat((u32)H_Hat,);
10 }
Lines 04 and 05 'do the opposite of what the halt decider says'
yet are never reached because x86utm.Halts() terminates line 03 before
returning any value.
--
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-03-18 16:35 -0500 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <xKudnccHAYAlWs79nZ2dnUU7-blQAAAA@giganews.com> |
| In reply to | #29553 |
On 3/18/2021 3:50 PM, Kaz Kylheku wrote:
> On 2021-03-18, olcott <NoOne@NoWhere.com> wrote:
>> On 3/18/2021 1:48 PM, Kaz Kylheku wrote:
>>> On 2021-03-18, olcott <NoOne@NoWhere.com> wrote:
>>>> On 3/18/2021 11:33 AM, André G. Isaak wrote:
>>>>> On 2021-03-17 18:28, olcott wrote:
>>>>>> On 3/17/2021 6:17 PM, André G. Isaak wrote:
>>>>>>> On 2021-03-17 16:07, olcott wrote:
>>>>>>>> On 3/17/2021 4:56 PM, André G. Isaak wrote:
>>>>>>>>> On 2021-03-17 15:42, olcott wrote:
>>>>>>>>>> On 3/17/2021 4:35 PM, André G. Isaak wrote:
>>>>>>>>>>> On 2021-03-17 15:16, olcott wrote:
>>>>>>>>>>>> On 3/17/2021 4:08 PM, André G. Isaak wrote:
>>>>>>>>>>>>> On 2021-03-17 14:55, olcott wrote:
>>>>>>>>>>>>>> On 3/17/2021 2:14 PM, Kaz Kylheku wrote:
>>>>>>>>>>>>>
>>>>>>>>>>>>>>> How does Halts suddenly have just one parameter? Halts(main())?
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Halts() no longer cares about parameters.
>>>>>>>>>>>>>
>>>>>>>>>>>>> What does that even mean? A halt decider answers a question
>>>>>>>>>>>>> about some input (i.e. a TM description/input string pair, i.e.
>>>>>>>>>>>>> parameters). How can you have a halt decider that doesn't care
>>>>>>>>>>>>> about parameters?
>>>>>>>>>>>>>
>>>>>>>>>>>>> André
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> I am only refuting the conventional halting problem
>>>>>>>>>>>> undecidability proofs by correctly deciding one instance of
>>>>>>>>>>>> their "undecidable" inputs. I don't care about any other inputs.
>>>>>>>>>>>
>>>>>>>>>>> So I ask again, what does it mean to have a Halts() that doesn't
>>>>>>>>>>> care about parameters? What you write above is a non-answer.
>>>>>>>>>>>
>>>>>>>>>>> André
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Halts() does not need to examine the parameters that it was called
>>>>>>>>>> with. It can ignore these parameters and still detect that it was
>>>>>>>>>> called twice in the execution trace of H_Hat() from the same
>>>>>>>>>> machine address without any conditional branch instructions
>>>>>>>>>> inbetween. This is sufficient for Halts() to decide that H_Hat()
>>>>>>>>>> has called it in infinite recursion.
>>>>>>>>>
>>>>>>>>> So what exactly is the prototype for Halts()?
>>>>>>>>>
>>>>>>>>> André
>>>>>>>>>
>>>>>>>>
>>>>>>>> u32 Halts(u32 P, u32 I); is the only one that I will provide.
>>>>>>>> Halts((u32) main) is not actually called that way.
>>>>>>>
>>>>>>> If that's the prototype for Halts() then regardless of how you call
>>>>>>> it it expects two arguments on the stack. So what exactly is that
>>>>>>> second argument when you call Halts(main)?
>>>>>>>
>>>>>>> André
>>>>>>>
>>>>>>
>>>>>> The function call interface is only provided for user-code to invoke
>>>>>> Halts() functionality. The actual Halts() embedded into the x86utm
>>>>>> operating system simply monitors the simulation of all machine
>>>>>> descriptions.
>>>>>
>>>>> So you're basically saying that all the calls to Halts() in the code
>>>>> you've shown aren't actually calls to your halt decider, but to
>>>>> something else, which makes it even more clear that your H_Hat isn't
>>>>> actually derived from your Halt decider.
>>>>>
>>>>> André
>>>>>
>>>>
>>>> Call to the halt decider can be thought of as examining the global
>>>> execution trace from the machine address specified as its first
>>>> parameter, forward.
>>>
>>> If you think it's okay to examine global anything, you can easily
>>> rig together a demo which uses simple global variables.
>>
>> You seem to be very persistently making sure to not pay attention to
>> what I am saying.
>>
>> The UTM is a pure function of its input and derives and execution trace
>> of these inputs as its output.
>
> My example program is likewise a pure function of its command line
> argument: either none, or "-h". What's your point?
>
>> The execution trace is for every aspect
>> of every computation that it simulates.
>
> That is actually not necessary; my pr ogram just records the fact of
> whether a function was called, and this is done for H_Hat and Halts.
>
> My Halts function examines the trace, and can determine that it's
> being called in infinite recursion.
>
> #include <stdint.h>
> #include <stdio.h>
> #include <stdlib.h>
> #include <string.h>
>
> #define array_size(array) (sizeof array / sizeof array[0])
> #define TRACE_MAX 128
>
> typedef uint32_t u32;
>
> u32 exec_trace[TRACE_MAX];
> unsigned trace_idx = 0;
>
> static u32 Halts(u32, u32);
>
> static void record_trace(u32 who)
> {
> if (trace_idx < array_size(exec_trace))
> exec_trace[trace_idx++] = who;
> }
>
> static void H_Hat(u32 P)
> {
> u32 Input_Halts;
>
> record_trace((u32) H_Hat);
>
> Input_Halts = Halts(P, P);
>
> if (Input_Halts)
> for(;;) /* meditate */;
> }
>
> static u32 Halts(u32 P, u32 I)
> {
> (void) P;
> (void) I;
>
> record_trace((u32) Halts);
>
> if (trace_idx == 1) {
> return 0;
> } else if (exec_trace[trace_idx - 2] == (u32) P) {
> puts("runaway recursion!");
> abort();
> } else {
> return 1;
> }
> }
>
> int main(int argc, char **argv)
> {
> /* -h option means call H_Hat(H_Hat) directly */
>
> if (argc >= 2 && strcmp(argv[1], "-h") == 0) {
> H_Hat((u32) H_Hat);
> printf("H_Hat returned!");
> } else {
> u32 Input_Halts = Halts((u32) H_Hat, (u32) H_Hat);
> printf("Input_Halts = %ld\n", (long) Input_Halts);
> }
>
> return 0;
> }
>
> $ gcc -Wall -W halt.c -o halt
> $ ./halt
> Input_Halts = 0
> $ ./halt -h
> runaway recursion!
> Aborted (core dumped)
>
> See? Direct call to H_Hat(H_Hat) is detected as a runaway recursion.
> A call to Halts(H_Hat, H_Hat) returns 0.
>
> The program is a Turing machine; it performs no I/O. The behavior
> depends only on whether there is a -h command line argument or not.
>
> My program is equivalent to yours; it hits all the same points.
>
> The only difference is that it is honest; the global state isn't
> squirreled away into the innards of a virtual amchine, so that it is
> invisible in the program code.
>
The UTM / halt decider <is> the global process that is merely aware of
its own internal state. You don't seem to be able to understand this.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-18 23:08 +0000 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <20210318155900.384@kylheku.com> |
| In reply to | #29572 |
On 2021-03-18, olcott <NoOne@NoWhere.com> wrote: > The UTM / halt decider <is> the global process that is merely aware of > its own internal state. You don't seem to be able to understand this. I've worked the awareness into my process by inserting the record_trace() calls into the right places. Note that a copmiler could be made to do this, in which case those calls would not be visible in the source code. Halts is also to be understood as an internal function; it is aware of the implementation of the mechanism and accesses the exec_trace array to make decisions. Squirreling the tracing mechanism into the VM makes no difference to the invalidity of your work; it just underscores the stupidity: that all it takes for you to dupe yourself with your own program is succeeding in making the invalid global communication back-channel invisible in the code of the program under test. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-03-18 18:22 -0500 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <-eSdnWUiaKIgfc79nZ2dnUU7-QfNnZ2d@giganews.com> |
| In reply to | #29599 |
On 3/18/2021 6:08 PM, Kaz Kylheku wrote: > On 2021-03-18, olcott <NoOne@NoWhere.com> wrote: >> The UTM / halt decider <is> the global process that is merely aware of >> its own internal state. You don't seem to be able to understand this. > > I've worked the awareness into my process by inserting the > record_trace() calls into the right places. Note that a copmiler > could be made to do this, in which case those calls would not be visible > in the source code. > > Halts is also to be understood as an internal function; it is aware of > the implementation of the mechanism and accesses the exec_trace array to > make decisions. > > Squirreling the tracing mechanism into the VM makes no difference > to the invalidity of your work; it just underscores the stupidity: > that all it takes for you to dupe yourself with your own program is > succeeding in making the invalid global communication back-channel > invisible in the code of the program under test. > The patient need not see into the mind of the doctor for the doctor to make a correct diagnosis of the patient. I don't see why you aren't getting this. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-03-19 00:01 +0000 |
| Subject | Re: Mistakes in evaluating my work (Kaz mistake) [fallacy of equivocation error] |
| Message-ID | <20210318163734.468@kylheku.com> |
| In reply to | #29600 |
On 2021-03-18, olcott <NoOne@NoWhere.com> wrote:
> On 3/18/2021 6:08 PM, Kaz Kylheku wrote:
>> On 2021-03-18, olcott <NoOne@NoWhere.com> wrote:
>>> The UTM / halt decider <is> the global process that is merely aware of
>>> its own internal state. You don't seem to be able to understand this.
>>
>> I've worked the awareness into my process by inserting the
>> record_trace() calls into the right places. Note that a copmiler
>> could be made to do this, in which case those calls would not be visible
>> in the source code.
>>
>> Halts is also to be understood as an internal function; it is aware of
>> the implementation of the mechanism and accesses the exec_trace array to
>> make decisions.
>>
>> Squirreling the tracing mechanism into the VM makes no difference
>> to the invalidity of your work; it just underscores the stupidity:
>> that all it takes for you to dupe yourself with your own program is
>> succeeding in making the invalid global communication back-channel
>> invisible in the code of the program under test.
>>
>
> The patient need not see into the mind of the doctor for the doctor to
> make a correct diagnosis of the patient.
>
> I don't see why you aren't getting this.
I'm totally getting it. Here is a new program with exception handling.
You're going to like this one better.
Pay attention:
$ ./halt
Halts calling 425653(425653)
runaway recursion detected!
Call to 425653(425653) aborted due to runaway recursion!
Input_Halts = 0
$ ./halt -h
calling H_Hat(H_Hat)
runaway recursion detected!
aborting
Aborted (core dumped)
The code follows. Now I have a global exception handler set up, which is
overridden locally by Halts in order to catch the recursion and
return 0. Detailed discussion of Halts is at the end:
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <setjmp.h>
#define array_size(array) (sizeof array / sizeof array[0])
#define TRACE_MAX 128
typedef uint32_t u32;
u32 exec_trace[TRACE_MAX];
unsigned trace_idx = 0;
jmp_buf abort_jmp;
static u32 Halts(u32, u32);
static void record_trace(u32 who)
{
if (trace_idx < array_size(exec_trace))
exec_trace[trace_idx++] = who;
}
static void H_Hat(u32 P)
{
u32 Input_Halts;
record_trace((u32) H_Hat);
Input_Halts = Halts(P, P);
if (Input_Halts)
for(;;) /* meditate */;
}
static u32 Halts(u32 P, u32 I)
{
record_trace((u32) Halts);
if (trace_idx == 1) {
/* local abort catch */
if (setjmp(abort_jmp) == 0) {
printf("Halts calling %lx(%lx)\n",
(unsigned long) P, (unsigned long) I);
((void (*)(u32)) P) (I);
printf("Call to %lx(%lx) returned\n",
(unsigned long) P, (unsigned long) I);
return 1;
} else {
printf("Call to %lx(%lx) aborted due to runaway recursion!\n",
(unsigned long) P, (unsigned long) I);
return 0;
}
} else if (exec_trace[trace_idx - 2] == (u32) P) {
puts("runaway recursion detected!");
longjmp(abort_jmp, 1);
} else {
return 1;
}
}
int main(int argc, char **argv)
{
/* Global abort catch */
if (setjmp(abort_jmp) == 0) {
if (argc >= 2 && strcmp(argv[1], "-h") == 0) {
puts("calling H_Hat(H_Hat)");
H_Hat((u32) H_Hat);
puts("H_Hat(H_Hat) returned!");
} else {
u32 Input_Halts = Halts((u32) H_Hat, (u32) H_Hat);
printf("Input_Halts = %ld\n", (long) Input_Halts);
}
} else {
puts("aborting");
abort();
}
return 0;
}
Let's dissect Halts:
static u32 Halts(u32 P, u32 I)
{
record_trace((u32) Halts);
A trace of Halts being called is recorded, but nothing else internally.
We don't record any events for the conditional branches we are taking;
this is all internal, and not "user code".
if (trace_idx == 1) {
trace_idx == 1 means we are the first function to be traced; i.e.
the spontaneous call from main to Halts.
/* local abort catch */
if (setjmp(abort_jmp) == 0) {
If we are the first to be called, we set up our own abort catch,
overriding the global machine's handler.
printf("Halts calling %lx(%lx)\n",
(unsigned long) P, (unsigned long) I);
((void (*)(u32)) P) (I);
We print a diagnostic that we are about to call P(I) and then we do it!
printf("Call to %lx(%lx) returned\n",
(unsigned long) P, (unsigned long) I);
return 1;
If P(I) returns, we decide 1: it halted.
} else {
printf("Call to %lx(%lx) aborted due to runaway recursion!\n",
(unsigned long) P, (unsigned long) I);
return 0;
If this else executes, it means the longjmp(abort_jmp, 1) was evaluated.
Runaway recursion was detected, and so we diagnose that and return 0.
}
} else if (exec_trace[trace_idx - 2] == (u32) P) {
puts("runaway recursion detected!");
longjmp(abort_jmp, 1);
In this else, we are not the first thing to be called. So we examine
the global execution trace: who was traced before us? If the function P
was traced before us, uh-oh: that is runaway recursion. If we were to
call P(I), it would just call us again. So we call that and hit the
abort escape via longjmp.
} else {
return 1;
Hand-waving catch-all return value; this doesn't happen in the demo,
so it doesn't matter.
}
}
[toc] | [prev] | [next] | [standalone]
Page 14 of 20 — ← Prev page 1 … 12 13 [14] 15 16 … 20 Next page →
Back to top | Article view | comp.theory
csiph-web