Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #35200 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-06-20 23:15 -0500 |
| Last post | 2021-06-22 12:25 -0700 |
| Articles | 20 on this page of 198 — 11 participants |
Back to article view | Back to comp.theory
What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-20 23:15 -0500
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-20 22:04 -0700
Re: What if a cat barks? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-21 12:16 +0100
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-21 17:15 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 20:07 -0500
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-21 18:35 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 20:40 -0500
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-21 18:42 -0700
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 21:54 -0400
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-22 12:22 -0700
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:57 -0400
Re: What if a cat barks? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-22 16:07 -0700
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 17:45 -0700
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-24 16:26 -0700
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-25 00:39 -0700
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 14:40 -0700
Re: What if a cat barks? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-23 02:47 +0100
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-22 21:15 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-22 23:00 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-22 22:21 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-23 06:57 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-23 05:25 -0700
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-23 10:33 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-23 21:09 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-23 17:00 +0100
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-23 11:12 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-24 02:40 -0700
Re: What if a cat barks? [ sound deduction proves that I am correct ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-24 11:49 +0100
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-24 10:39 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-24 22:51 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-24 10:25 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-24 08:47 -0700
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-24 11:03 -0500
Re: What if a cat barks? [ sound deduction proves that I am correct ] Richard Damon <Richard@Damon-Family.org> - 2021-06-23 21:23 -0400
Re: What if a cat barks? [ sound deduction proves that I am correct ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-23 11:01 +0100
Re: What if a cat barks? [ sound deduction proves that I am correct ] olcott <NoOne@NoWhere.com> - 2021-06-23 10:35 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-21 12:24 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 16:11 -0500
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 16:26 -0500
Re: What if a cat barks? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-21 14:58 -0700
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 20:03 -0400
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 19:37 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-21 19:05 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 20:48 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 22:02 -0400
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 21:17 -0400
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-21 18:57 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 20:39 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 22:22 -0400
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 21:29 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 07:00 -0400
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 09:23 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:40 -0400
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-21 20:29 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 22:09 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-22 10:47 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 12:05 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-22 12:38 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 14:17 -0500
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-23 11:29 -0600
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-23 15:07 -0500
Re: What if a cat barks? Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-23 15:12 -0700
Re: What if a cat barks? André G. Isaak <agisaak@gm.invalid> - 2021-06-23 17:13 -0600
Re: What if a cat barks? [ sound deduction is a proof ] olcott <NoOne@NoWhere.com> - 2021-06-23 19:01 -0500
Re: What if a cat barks? [ sound deduction is a proof ] André G. Isaak <agisaak@gm.invalid> - 2021-06-23 18:49 -0600
Re: What if a cat barks? [ sound deduction is a proof ] olcott <NoOne@NoWhere.com> - 2021-06-23 22:03 -0500
Re: What if a cat barks? [ sound deduction is a proof ] Richard Damon <Richard@Damon-Family.org> - 2021-06-24 07:29 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-24 10:42 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-24 22:39 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-25 11:33 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 13:14 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-25 13:50 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 16:11 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-25 15:40 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 17:59 -0400
Re: What if a cat barks? [ sound deduction is a proof ](axiom) olcott <NoOne@NoWhere.com> - 2021-06-25 17:56 -0500
Re: What if a cat barks? [ sound deduction is a proof ](axiom) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 20:40 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-25 20:01 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 21:37 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-25 20:46 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-25 22:07 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-25 22:07 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 01:11 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Jeff Barnett <jbb@notatt.com> - 2021-06-26 04:27 -0600
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-26 15:51 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) olcott <NoOne@NoWhere.com> - 2021-06-26 10:52 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 12:08 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 11:18 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 13:38 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-26 18:57 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 14:12 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(Ben lies) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 11:43 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) olcott <NoOne@NoWhere.com> - 2021-06-26 19:01 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 20:32 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) olcott <NoOne@NoWhere.com> - 2021-06-26 19:54 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 18:03 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 21:08 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 20:39 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 22:06 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) olcott <NoOne@NoWhere.com> - 2021-06-27 09:43 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 13:10 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) olcott <NoOne@NoWhere.com> - 2021-06-27 13:00 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(dumber than a box of rocks ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 15:40 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) olcott <NoOne@NoWhere.com> - 2021-06-27 15:04 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 16:17 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) olcott <NoOne@NoWhere.com> - 2021-06-27 17:46 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 19:03 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) olcott <NoOne@NoWhere.com> - 2021-06-27 18:11 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(liar liar pants on fire ) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 19:57 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-27 01:42 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 17:48 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) olcott <NoOne@NoWhere.com> - 2021-06-26 20:05 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 18:09 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(knucklehead) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 18:13 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) olcott <NoOne@NoWhere.com> - 2021-06-26 19:49 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 21:17 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) olcott <NoOne@NoWhere.com> - 2021-06-26 20:55 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 22:18 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 19:33 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 20:05 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain)(I dare you) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 20:03 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Jeff Barnett <jbb@notatt.com> - 2021-06-26 10:23 -0600
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-26 18:55 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Jeff Barnett <jbb@notatt.com> - 2021-06-26 17:04 -0600
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-27 10:54 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-06-27 20:24 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 14:56 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 16:32 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-06-27 22:01 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 17:26 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 19:07 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 18:18 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 17:00 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 17:11 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-27 17:15 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-27 20:02 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-06-28 02:29 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 20:44 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 21:40 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 22:16 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-06-27 21:37 +0100
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 17:28 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Jeff Barnett <jbb@notatt.com> - 2021-06-27 19:08 -0600
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-27 20:38 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-26 12:59 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 13:12 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 19:20 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 19:12 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 20:48 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 20:08 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 21:19 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 18:21 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 06:32 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 09:55 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 11:06 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 11:00 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 09:04 -0700
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 12:15 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) olcott <NoOne@NoWhere.com> - 2021-06-26 11:29 -0500
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Richard Damon <Richard@Damon-Family.org> - 2021-06-26 13:48 -0400
Re: What if a cat barks? [ sound deduction is a proof ](infinite invocation chain) Daniel Pehoushek <pehoushek1@gmail.com> - 2021-06-26 10:54 -0700
Re: What if a cat barks? [ sound deduction is a proof ] André G. Isaak <agisaak@gm.invalid> - 2021-06-24 15:13 -0600
Re: What if a cat barks? [ sound deduction is a proof ] olcott <NoOne@NoWhere.com> - 2021-06-24 16:40 -0500
Re: What if a cat barks? [ sound deduction is a proof ] André G. Isaak <agisaak@gm.invalid> - 2021-06-24 18:51 -0600
Re: What if a cat barks? [ sound deduction is a proof ] olcott <NoOne@NoWhere.com> - 2021-06-25 08:53 -0500
Re: What if a cat barks? [ sound deduction is a proof ] Richard Damon <Richard@Damon-Family.org> - 2021-06-25 11:39 -0400
Re: What if a cat barks? [ sound deduction is a proof ] Richard Damon <Richard@Damon-Family.org> - 2021-06-23 21:04 -0400
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-21 00:46 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 08:48 -0500
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-21 08:33 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-21 10:38 -0500
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 04:52 -0700
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 05:56 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 09:09 -0500
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 09:06 -0500
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 10:02 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 12:08 -0500
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 10:13 -0700
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 10:16 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 12:22 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:52 -0400
Re: What if a cat barks? wij <wyniijj@gmail.com> - 2021-06-22 17:31 -0700
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 20:12 -0500
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 12:21 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:51 -0400
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-22 18:46 -0400
Re: What if a cat barks? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-21 02:17 -0700
Re: What if a cat barks? [ no false assumptions please ] olcott <NoOne@NoWhere.com> - 2021-06-21 08:44 -0500
Re: What if a cat barks? [ no false assumptions please ] Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-06-22 02:38 -0700
Re: What if a cat barks? [ no false assumptions please ] olcott <NoOne@NoWhere.com> - 2021-06-22 08:55 -0500
Re: What if a cat barks? Richard Damon <Richard@Damon-Family.org> - 2021-06-21 07:20 -0400
Re: What if a cat barks? [ How can a cat bark? ] olcott <NoOne@NoWhere.com> - 2021-06-21 10:07 -0500
Re: What if a cat barks? [ How can a cat bark? ] Richard Damon <Richard@Damon-Family.org> - 2021-06-21 20:09 -0400
Re: What if a cat barks? [ How can a cat bark? ] olcott <NoOne@NoWhere.com> - 2021-06-21 19:36 -0500
Re: What if a cat barks? [ How can a cat bark? ] Richard Damon <Richard@Damon-Family.org> - 2021-06-21 21:23 -0400
Re: What if a cat barks? Peter <peterxpercival@hotmail.com> - 2021-06-22 15:05 +0100
Re: What if a cat barks? olcott <NoOne@NoWhere.com> - 2021-06-22 09:33 -0500
Re: What if a cat barks? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-06-22 12:25 -0700
Page 2 of 10 — ← Prev page 1 [2] 3 4 … 10 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-23 06:57 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <3sEAI.110548$od.49658@fx15.iad> |
| In reply to | #35294 |
On 6/22/21 11:21 PM, olcott wrote:
> On 6/22/2021 10:00 PM, Richard Damon wrote:
>> On 6/22/21 10:15 PM, olcott wrote:
>>> On 6/22/2021 8:47 PM, Ben Bacarisse wrote:
>>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:
>>>>
>>>>> On 6/21/2021 4:16 AM, Ben Bacarisse wrote:
>>>>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:
>>>>>>
>>>>>>> On 6/20/2021 9:15 PM, olcott wrote:
>>>>>>>> If you see an animal and test its DNA and confirm that it is
>>>>>>>> definitely a cat, what happens when the cat barks?
>>>>>>> [...]
>>>>>>>
>>>>>>> Have you been hearing cats bark lately? Wow.
>>>>>> He's making a bad analogy. The correct analogy is that /assuming/
>>>>>> that
>>>>>> a cat barks leads to a contradiction so we must reject the
>>>>>> assumption.
>>>>>> He can see the contradiction that assuming a halt decider leads to
>>>>>> (at
>>>>>> least he claimed to be able to see it) so what to do? He has to
>>>>>> state
>>>>>> that he has a barking cat -- a halt decider that works at least
>>>>>> for the
>>>>>> confounding case. Of course he doesn't, but he has to find some
>>>>>> way to
>>>>>> keep the discussion going (he only cares about keeping people
>>>>>> talking).
>>>>>
>>>>> Ahhh. Good. Okay, well I am still wondering why, when I tell him to
>>>>> run his "halt decider" against an unknown, black box program created
>>>>> by somebody else... Well, he seems to get pissed off. Afaict, his
>>>>> decider only works on programs that he already knows are,
>>>>> decided. Cheating 101? Or what? ;^o
>>>>
>>>> Well he flip-flops on this. He keeps saying that he has a halt decider
>>>> (sometimes without realising that he's said it) but when this is
>>>> pointed
>>>> out he claims he only cares about the one case -- the "hat"
>>>> construction
>>>> given in so many proofs.
>>>>
>>>> That, alone, would be noteworthy because it's impossible. Way back in
>>>> Dec 2018, he was waffling about a decider for one case (which is
>>>> trivial), when someone (I think it was Mike Terry) spotted that he was
>>>> actually claiming to have a TM H that gave the correct result for the
>>>> computation <[H^], [H^]> (my notation -- I'll explain it if you really
>>>> care about the details). Once it was pointed out that everyone knows
>>>> this is impossible PO was delighted and wrote things like:
>>>>
>>>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz
>>>> specs does not exist. I now have a fully encoded pair of Turing
>>>> Machines H / Ĥ proving them wrong."
>>>>
>>>> "I now have an actual H that decides actual halting for an
>>>> actual (Ĥ,
>>>> Ĥ) input pair. I have to write the UTM to execute this code, that
>>>> should not take very long. The key thing is the H and Ĥ are 100%
>>>> fully encoded as actual Turing machines."
>>>>
>>>> "I am waiting to encode the UTM in C++ so that I can actually
>>>> execute
>>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It
>>>> is not
>>>> a universal halt decider, yet it is exactly and precisely the Peter
>>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the
>>>> basis
>>>> of Ĥ actually deciding itself."
>>>>
>>>> I refer to this as the Big Lie because, of course, he never had any
>>>> such
>>>> pair of TMs, but as you can see, it was getting one (impossible) case
>>>> right that was the jumping-off point for the last two an half years of
>>>> nonsense.
>>>>
>>>
>>> Yes and of course when I make a C program that is computationally
>>> equivalent to the standard relation between the HP halt decider and its
>>> impossible input and show all of the steps of how this halt decider
>>> correctly decides this "known" to be impossible input that does not
>>> count at all because it is not 100% perfectly an actual TM.
>>
>> Except that it isn't because H^ doesn't make copies as it is supposed to
>> so you don't end up with a true equivalent.
>
> Others know that it is sufficiently equivalent.
There is no 'sufficiently' it only is or it isn't.
Is 2.0001 sufficiently equivalent to 2? Its pretty close, but is it
eqivalent.
>
> procedure compute_g(i):
> if f(i, i) == 0 then
> return 0
> else
> loop forever // (Wikipedia:Halting Problem)
>
> Its pretty obvious that the C code and the pseudo-code are saying
> exactly the same thing.
>
> // Simplified Linz Ĥ (Linz:1990:319)
> void P(u32 x)
> {
> u32 Input_Halts = H(x, x);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
>> This lets you 'cheat' to
>> detect the recursion that doesn't really exist in the original problem.
>
> Because others know that it is sufficiently equivalent they can also see
> the infinite recursion in the Linz proof as soon as they sufficiently
> understand my x86/C proof.
>
Just because something 'works' in a given case, doesn't mean it it
correct or right in general.
A simple fact is that your programs are close enough to show that they
don't work (since P(P) does Halt, while H(P,P) says it won't), but it
isn't fully equivalent as H does something that can't be done by the
'equivalent' Turing Machine. The key here is that this 'cheat' doesn't
let H achieve the actual goal of the problem, as the issue is much more
fundamental.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-06-23 05:25 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <49956bbd-e69c-40dc-8356-35688ff07c9bn@googlegroups.com> |
| In reply to | #35296 |
On Wednesday, 23 June 2021 at 11:57:06 UTC+1, Richard Damon wrote: > On 6/22/21 11:21 PM, olcott wrote: > > On 6/22/2021 10:00 PM, Richard Damon wrote: > >> > >>> Yes and of course when I make a C program that is computationally > >>> equivalent to the standard relation between the HP halt decider and its > >>> impossible input and show all of the steps of how this halt decider > >>> correctly decides this "known" to be impossible input that does not > >>> count at all because it is not 100% perfectly an actual TM. > >> > >> Except that it isn't because H^ doesn't make copies as it is supposed to > >> so you don't end up with a true equivalent. > > > > Others know that it is sufficiently equivalent. > There is no 'sufficiently' it only is or it isn't. > > Is 2.0001 sufficiently equivalent to 2? Its pretty close, but is it > equivalent. > PO's system uses x86 code instead of Turing machines. That enables him to detect when the halt decider is being called on a program including itself. That's not the root of the error (the halting problem also applies to x86 programs) but it is the root of the confusion. PO obviously thinks that he has found a counter example to Linz's impossible H. Othewise he would be so insistent be so insistent about it. I suggest that this is because he's tied himself up in knots thinking about infinite recursion and what would have happened had his H been a pure simulator instead of a simulator with an infinite recursion detector attached.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-23 10:33 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <EsednWBuJbCwyU79nZ2dnUU7-ffNnZ2d@giganews.com> |
| In reply to | #35297 |
On 6/23/2021 7:25 AM, Malcolm McLean wrote: > On Wednesday, 23 June 2021 at 11:57:06 UTC+1, Richard Damon wrote: >> On 6/22/21 11:21 PM, olcott wrote: >>> On 6/22/2021 10:00 PM, Richard Damon wrote: >>>> >>>>> Yes and of course when I make a C program that is computationally >>>>> equivalent to the standard relation between the HP halt decider and its >>>>> impossible input and show all of the steps of how this halt decider >>>>> correctly decides this "known" to be impossible input that does not >>>>> count at all because it is not 100% perfectly an actual TM. >>>> >>>> Except that it isn't because H^ doesn't make copies as it is supposed to >>>> so you don't end up with a true equivalent. >>> >>> Others know that it is sufficiently equivalent. >> There is no 'sufficiently' it only is or it isn't. >> >> Is 2.0001 sufficiently equivalent to 2? Its pretty close, but is it >> equivalent. >> > PO's system uses x86 code instead of Turing machines. That enables him > to detect when the halt decider is being called on a program including itself. > That's not the root of the error (the halting problem also applies to x86 > programs) but it is the root of the confusion. > PO obviously thinks that he has found a counter example to Linz's impossible H. > Othewise he would be so insistent be so insistent about it. I suggest that this > is because he's tied himself up in knots thinking about infinite recursion > and what would have happened had his H been a pure simulator instead of > a simulator with an infinite recursion detector attached. > Which of these seems to be untrue and why? Premise(1) Every computation that never halts unless its simulation is aborted is a computation that never halts. This verified as true on the basis of the meaning of its words. Premise(2) The simulation of the input to H(P,P) never halts without being aborted is a verified fact on the basis of its x86 execution trace. (shown below). From the above true premises it necessarily follows that simulating halt decider H correctly reports that its input: (P,P) never halts. Halting problem undecidability and infinitely nested simulation https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-23 21:09 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <xXQAI.57804$J21.55921@fx40.iad> |
| In reply to | #35298 |
On 6/23/21 11:33 AM, olcott wrote: > On 6/23/2021 7:25 AM, Malcolm McLean wrote: >> On Wednesday, 23 June 2021 at 11:57:06 UTC+1, Richard Damon wrote: >>> On 6/22/21 11:21 PM, olcott wrote: >>>> On 6/22/2021 10:00 PM, Richard Damon wrote: >>>>> >>>>>> Yes and of course when I make a C program that is computationally >>>>>> equivalent to the standard relation between the HP halt decider >>>>>> and its >>>>>> impossible input and show all of the steps of how this halt decider >>>>>> correctly decides this "known" to be impossible input that does not >>>>>> count at all because it is not 100% perfectly an actual TM. >>>>> >>>>> Except that it isn't because H^ doesn't make copies as it is >>>>> supposed to >>>>> so you don't end up with a true equivalent. >>>> >>>> Others know that it is sufficiently equivalent. >>> There is no 'sufficiently' it only is or it isn't. >>> >>> Is 2.0001 sufficiently equivalent to 2? Its pretty close, but is it >>> equivalent. >>> >> PO's system uses x86 code instead of Turing machines. That enables him >> to detect when the halt decider is being called on a program including >> itself. >> That's not the root of the error (the halting problem also applies to x86 >> programs) but it is the root of the confusion. >> PO obviously thinks that he has found a counter example to Linz's >> impossible H. >> Othewise he would be so insistent be so insistent about it. I suggest >> that this >> is because he's tied himself up in knots thinking about infinite >> recursion >> and what would have happened had his H been a pure simulator instead of >> a simulator with an infinite recursion detector attached. >> > Which of these seems to be untrue and why? > > Premise(1) Every computation that never halts unless its simulation is > aborted is a computation that never halts. This verified as true on the > basis of the meaning of its words. This is true when the 'halting' refers to the action of the specific instance of the simulatior simulation the given computation, but not other copies simulating other copies of the simulation. > > Premise(2) The simulation of the input to H(P,P) never halts without > being aborted is a verified fact on the basis of its x86 execution > trace. (shown below). This shows that SOME copy of the simulator needs to abort SOME copy of the computation, not any particular one. This is a different condition with just similar words. > > From the above true premises it necessarily follows that > simulating halt decider H correctly reports that its input: (P,P) never > halts. The two statements do NOT refer to the same 'property' of the machine, so (2) does not establish the conditions of (1), thus it is an unsound piece of logic. > > Halting problem undecidability and infinitely nested simulation > > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > >
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-23 17:00 +0100 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <87v9648tag.fsf@bsb.me.uk> |
| In reply to | #35297 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > On Wednesday, 23 June 2021 at 11:57:06 UTC+1, Richard Damon wrote: >> On 6/22/21 11:21 PM, olcott wrote: >> > On 6/22/2021 10:00 PM, Richard Damon wrote: >> >> >> >>> Yes and of course when I make a C program that is computationally >> >>> equivalent to the standard relation between the HP halt decider and its >> >>> impossible input and show all of the steps of how this halt decider >> >>> correctly decides this "known" to be impossible input that does not >> >>> count at all because it is not 100% perfectly an actual TM. >> >> >> >> Except that it isn't because H^ doesn't make copies as it is supposed to >> >> so you don't end up with a true equivalent. >> > >> > Others know that it is sufficiently equivalent. >> There is no 'sufficiently' it only is or it isn't. >> >> Is 2.0001 sufficiently equivalent to 2? Its pretty close, but is it >> equivalent. >> > PO's system uses x86 code instead of Turing machines. That enables him > to detect when the halt decider is being called on a program including itself. > That's not the root of the error (the halting problem also applies to x86 > programs) but it is the root of the confusion. > PO obviously thinks that he has found a counter example to Linz's > impossible H. I find this hard to believe but I accept that there are minds out there that I have little understanding of. Even so, how can anyone think they have a decider M that is correct about <[M^],[M^]> if a. M rejects <[M^],[M^]>, but b. M^([M^]) halts? It seems impossible to me that anyone can accept these facts and claim to have "a counter example" to the proof's hat construction. Surely even PO can see that such a TM is not correct? It think he know. That's why he was, briefly, honest about redefining what "halting" means. It was only after he realised that everyone would ignore him if he was talking about some other notion of "halting" that he stopped being clear about this redefinition. Further, PO recently posted this: | Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞ | if M applied to wM halts, and | | Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn | if M applied to wM does not halt which is (roughly) Linz's notation for what H^, built from a correct H, should do. I showed the last tiny step which is to set wM = <Ĥ> (so M is Ĥ) to get Ĥ.q0 <Ĥ> ⊢* Ĥ.qx <Ĥ> <Ĥ> ⊢* Ĥ.qy ⊢* ∞ if Ĥ applied to <Ĥ> halts, and Ĥ.q0 <Ĥ> ⊢* Ĥ.qx <Ĥ> <Ĥ> ⊢* Ĥ.qn if Ĥ applied to <Ĥ> does not halt which, in words is, "Ĥ run (from state q0) on input <Ĥ> does not halt if Ĥ applied to <Ĥ> halts", and "Ĥ run (from state q0) on input <Ĥ> halts (in state qn) if Ĥ applied to <Ĥ> does not halt". In reply, PO said he understood that, but then went on to say more things as if anything, true or false, can alter the fact that the assumption about H leads to a contradiction. Do you think he genuinely believes that saying more things, even true things, can "undo" a contradiction? That is a strange mind indeed. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-23 11:12 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <ecudnf1UmtfrwE79nZ2dnUU7-TnNnZ2d@giganews.com> |
| In reply to | #35300 |
On 6/23/2021 11:00 AM, Ben Bacarisse wrote:
> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>
>> On Wednesday, 23 June 2021 at 11:57:06 UTC+1, Richard Damon wrote:
>>> On 6/22/21 11:21 PM, olcott wrote:
>>>> On 6/22/2021 10:00 PM, Richard Damon wrote:
>>>>>
>>>>>> Yes and of course when I make a C program that is computationally
>>>>>> equivalent to the standard relation between the HP halt decider and its
>>>>>> impossible input and show all of the steps of how this halt decider
>>>>>> correctly decides this "known" to be impossible input that does not
>>>>>> count at all because it is not 100% perfectly an actual TM.
>>>>>
>>>>> Except that it isn't because H^ doesn't make copies as it is supposed to
>>>>> so you don't end up with a true equivalent.
>>>>
>>>> Others know that it is sufficiently equivalent.
>>> There is no 'sufficiently' it only is or it isn't.
>>>
>>> Is 2.0001 sufficiently equivalent to 2? Its pretty close, but is it
>>> equivalent.
>>>
>> PO's system uses x86 code instead of Turing machines. That enables him
>> to detect when the halt decider is being called on a program including itself.
>> That's not the root of the error (the halting problem also applies to x86
>> programs) but it is the root of the confusion.
>> PO obviously thinks that he has found a counter example to Linz's
>> impossible H.
>
> I find this hard to believe but I accept that there are minds out there
> that I have little understanding of. Even so, how can anyone think they
> have a decider M that is correct about <[M^],[M^]> if
>
> a. M rejects <[M^],[M^]>, but
> b. M^([M^]) halts?
>
// Simplified Linz Ĥ (Linz:1990:319)
void P(u32 x)
{
u32 Input_Halts = H(x, x);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input_Halts = H((u32)P, (u32)P);
Output("Input_Halts = ", Input_Halts);
}
Premise(1) Every computation that never halts unless its simulation is
aborted is a computation that never halts. This verified as true on the
basis of the meaning of its words.
Premise(2) The simulation of the input to H(P,P) never halts without
being aborted is a verified fact on the basis of its x86 execution
trace. (shown below).
Conclusion (3) From the above true premises it necessarily follows that
simulating halt decider H correctly reports that its input: (P,P) never
halts.
When (1) is true and (2) is true and (1) & (2) logically entails that
(3) is true, nothing can possibly contradict that (3) is true.
Make sure you carefully ignore all those words because that is the only
way that any fake ruse of a rebuttal can continue.
Halting problem undecidability and infinitely nested simulation
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
> It seems impossible to me that anyone can accept these facts and claim
> to have "a counter example" to the proof's hat construction. Surely
> even PO can see that such a TM is not correct? It think he know.
> That's why he was, briefly, honest about redefining what "halting"
> means. It was only after he realised that everyone would ignore him if
> he was talking about some other notion of "halting" that he stopped
> being clear about this redefinition.
>
> Further, PO recently posted this:
>
> | Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞
> | if M applied to wM halts, and
> |
> | Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn
> | if M applied to wM does not halt
>
> which is (roughly) Linz's notation for what H^, built from a correct H,
> should do. I showed the last tiny step which is to set wM = <Ĥ> (so M
> is Ĥ) to get
>
> Ĥ.q0 <Ĥ> ⊢* Ĥ.qx <Ĥ> <Ĥ> ⊢* Ĥ.qy ⊢* ∞
> if Ĥ applied to <Ĥ> halts, and
>
> Ĥ.q0 <Ĥ> ⊢* Ĥ.qx <Ĥ> <Ĥ> ⊢* Ĥ.qn
> if Ĥ applied to <Ĥ> does not halt
>
> which, in words is, "Ĥ run (from state q0) on input <Ĥ> does not halt if
> Ĥ applied to <Ĥ> halts", and "Ĥ run (from state q0) on input <Ĥ> halts
> (in state qn) if Ĥ applied to <Ĥ> does not halt".
>
> In reply, PO said he understood that, but then went on to say more
> things as if anything, true or false, can alter the fact that the
> assumption about H leads to a contradiction. Do you think he genuinely
> believes that saying more things, even true things, can "undo" a
> contradiction? That is a strange mind indeed.
>
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-06-24 02:40 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <f2f3e194-103f-41c7-a511-7af6523c1d76n@googlegroups.com> |
| In reply to | #35300 |
On Wednesday, 23 June 2021 at 17:00:57 UTC+1, Ben Bacarisse wrote: > > In reply, PO said he understood that, but then went on to say more > things as if anything, true or false, can alter the fact that the > assumption about H leads to a contradiction. Do you think he genuinely > believes that saying more things, even true things, can "undo" a > contradiction? That is a strange mind indeed. > We've had quite a bit of flip-flopping. We had a period when it was acknowledged that Linz's proof was sound but he had a slightly different property. Defining a slightly different property to halting is not an inherently bad thing to do, it could be the starting point of some significant work. But that's very hard to do, and you and I pointed out that PO's different problem wasn't one of the "interesting" ones. You needed to solve the original halting problem first to decide it, for example. So there might have been a row back from that when he realised that the response would be "well that might be true but it doesn't get us anywhere". However I do think that he genuinely thinks that he's got something significant. I'm not a mind reader, but a troll would have got bored by now, whilst the posts go off at too many tangents to be a fraudster. When you dry run his simulating halt decider on itself, it is confusing. Take out the halt detector and it runs forever. Put the halt detector in, and it detects non-halting behaviour (according to PO, no real reason to disbelieve him). So surely it's got that right? But in fact simulate one more step, and the halt detection in the simulated machine will kick in and halt it.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-24 11:49 +0100 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <87eecro7uq.fsf@bsb.me.uk> |
| In reply to | #35312 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > On Wednesday, 23 June 2021 at 17:00:57 UTC+1, Ben Bacarisse wrote: >> >> In reply, PO said he understood that, but then went on to say more >> things as if anything, true or false, can alter the fact that the >> assumption about H leads to a contradiction. Do you think he genuinely >> believes that saying more things, even true things, can "undo" a >> contradiction? That is a strange mind indeed. >> > We've had quite a bit of flip-flopping. We had a period when it was > acknowledged that Linz's proof was sound but he had a slightly > different property. Defining a slightly different property to halting > is not an inherently bad thing to do, it could be the starting point > of some significant work. But that's very hard to do, and you and I > pointed out that PO's different problem wasn't one of the "interesting" > ones. You needed to solve the original halting problem first to decide > it, for example. > > So there might have been a row back from that when he realised that > the response would be "well that might be true but it doesn't get us > anywhere". > > However I do think that he genuinely thinks that he's got something > significant. I'm not a mind reader, but a troll would have got bored by > now, whilst the posts go off at too many tangents to be a fraudster. I don't think he's a troll, and I don't think he's a fraudster, but the changes in his claims suggest to me that he is aware of being wrong and having to row-back the wildest ones. He certainly knows, but has not admitted, that he never had "two actual Turing machines" "fully encoded" back in Dec 2018, waiting only for a TM simulator to be able to run them (he claimed that would take about a week). I don't think these deceptions are fraudulent. I think his self-image can't cope with the concept of being wrong. > When you dry run his simulating halt decider on itself, it is confusing. > Take out the halt detector and it runs forever. Put the halt detector in, > and it detects non-halting behaviour (according to PO, no real reason > to disbelieve him). So surely it's got that right? I don't know what you mean. How do you run anything of his? We've never even seen the key function. > But in fact simulate > one more step, and the halt detection in the simulated machine will > kick in and halt it. I don't see the value in discussing all these details, though others clearly do. He's stated in various round-about ways that his "decider" (the hidden code we will never see) is wrong as far as "conventional" halting is concerned. There is zero dispute on the facts that the code indicates false for a halting computation. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-24 10:39 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <AZqdnfcpJNCEOkn9nZ2dnUU7-S3NnZ2d@giganews.com> |
| In reply to | #35313 |
On 6/24/2021 5:49 AM, Ben Bacarisse wrote:
> Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes:
>
>> On Wednesday, 23 June 2021 at 17:00:57 UTC+1, Ben Bacarisse wrote:
>>>
>>> In reply, PO said he understood that, but then went on to say more
>>> things as if anything, true or false, can alter the fact that the
>>> assumption about H leads to a contradiction. Do you think he genuinely
>>> believes that saying more things, even true things, can "undo" a
>>> contradiction? That is a strange mind indeed.
>>>
>> We've had quite a bit of flip-flopping. We had a period when it was
>> acknowledged that Linz's proof was sound but he had a slightly
>> different property. Defining a slightly different property to halting
>> is not an inherently bad thing to do, it could be the starting point
>> of some significant work. But that's very hard to do, and you and I
>> pointed out that PO's different problem wasn't one of the "interesting"
>> ones. You needed to solve the original halting problem first to decide
>> it, for example.
>>
>> So there might have been a row back from that when he realised that
>> the response would be "well that might be true but it doesn't get us
>> anywhere".
>>
>> However I do think that he genuinely thinks that he's got something
>> significant. I'm not a mind reader, but a troll would have got bored by
>> now, whilst the posts go off at too many tangents to be a fraudster.
>
> I don't think he's a troll, and I don't think he's a fraudster, but the
> changes in his claims suggest to me that he is aware of being wrong and
> having to row-back the wildest ones.
// Simplified Linz Ĥ (Linz:1990:319)
void P(u32 x)
{
u32 Input_Halts = H(x, x);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input_Halts = H((u32)P, (u32)P);
Output("Input_Halts = ", Input_Halts);
}
That H(P,P) cannot return a correct halt status to P in the above
computation is well proven.
That H(P,P) ever needs to return to P at all in the above code is the
key false assumption that unravels the whole proof.
> He certainly knows, but has not
> admitted, that he never had "two actual Turing machines" "fully encoded"
> back in Dec 2018, waiting only for a TM simulator to be able to run them
Virtual machines that are "computationally equivalent" to a Turing
machines are sufficiently Turing machines.
> (he claimed that would take about a week). I don't think these
> deceptions are fraudulent. I think his self-image can't cope with the
> concept of being wrong.
>
>> When you dry run his simulating halt decider on itself, it is confusing.
>> Take out the halt detector and it runs forever. Put the halt detector in,
>> and it detects non-halting behaviour (according to PO, no real reason
>> to disbelieve him). So surely it's got that right?
>
> I don't know what you mean. How do you run anything of his? We've
> never even seen the key function.
>
>> But in fact simulate
>> one more step, and the halt detection in the simulated machine will
>> kick in and halt it.
>
> I don't see the value in discussing all these details, though others
> clearly do. He's stated in various round-about ways that his "decider"
> (the hidden code we will never see) is wrong as far as "conventional"
> halting is concerned. There is zero dispute on the facts that the code
> indicates false for a halting computation.
>
When a simulating halt decider decides that an actual infinite loop
would never halt and it stops this simulation of this infinite loop it
correctly reports that the input never halts, even though the input does
indeed halt.
The same reasoning applies to infinite recursion and infinitely nested
simulation.
You always dodge this challenge because you know that you will fail
You always dodge this challenge because you know that you will fail
You always dodge this challenge because you know that you will fail
You always dodge this challenge because you know that you will fail
Premise(1) Every computation that never halts unless its simulation is
aborted is a computation that never halts. This verified as true on the
basis of the meaning of its words.
Premise(2) The simulation of the input to H(P,P) never halts without
being aborted is a verified fact on the basis of its x86 execution
trace. (pages 3-4 of the paper).
Conclusion(3) From the above true premises it necessarily follows that
simulating halt decider H correctly reports that its input: (P,P) never
halts.
Halting problem undecidability and infinitely nested simulation
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-24 22:51 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <1xbBI.88042$Vh1.61135@fx21.iad> |
| In reply to | #35316 |
On 6/24/21 11:39 AM, olcott wrote:
>
> // Simplified Linz Ĥ (Linz:1990:319)
> void P(u32 x)
> {
> u32 Input_Halts = H(x, x);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
>
> int main()
> {
> u32 Input_Halts = H((u32)P, (u32)P);
> Output("Input_Halts = ", Input_Halts);
> }
>
> That H(P,P) cannot return a correct halt status to P in the above
> computation is well proven.
>
> That H(P,P) ever needs to return to P at all in the above code is the
> key false assumption that unravels the whole proof.
But H needs to be a computation to be a Halting Decider. Computations
always return the same answer to a given question EVERY time it is
computed, the if H(P,P) answers when directly asked, it must also do so
when asked by P.
I thought we got this cleared up months ago when you admitted you didn't
understand what a computation was.
>
>> He certainly knows, but has not
>> admitted, that he never had "two actual Turing machines" "fully encoded"
>> back in Dec 2018, waiting only for a TM simulator to be able to run them
>
> Virtual machines that are "computationally equivalent" to a Turing
> machines are sufficiently Turing machines.
But to be computationally equivalent to a Turing Machine, they need to
be actual Computation, thus your claim that it doesn't need to return
its answer to P is false. Maybe you don't really understad what it means
to be computationally equivalent. Maybe you think that just means looks
something like each other,
>
>> (he claimed that would take about a week). I don't think these
>> deceptions are fraudulent. I think his self-image can't cope with the
>> concept of being wrong.
>>
>>> When you dry run his simulating halt decider on itself, it is confusing.
>>> Take out the halt detector and it runs forever. Put the halt detector
>>> in,
>>> and it detects non-halting behaviour (according to PO, no real reason
>>> to disbelieve him). So surely it's got that right?
>>
>> I don't know what you mean. How do you run anything of his? We've
>> never even seen the key function.
>>
>>> But in fact simulate
>>> one more step, and the halt detection in the simulated machine will
>>> kick in and halt it.
>>
>> I don't see the value in discussing all these details, though others
>> clearly do. He's stated in various round-about ways that his "decider"
>> (the hidden code we will never see) is wrong as far as "conventional"
>> halting is concerned. There is zero dispute on the facts that the code
>> indicates false for a halting computation.
>>
>
> When a simulating halt decider decides that an actual infinite loop
> would never halt and it stops this simulation of this infinite loop it
> correctly reports that the input never halts, even though the input does
> indeed halt.
And How is Halting correctly decided as Non-Halting. You make this claim
with what seems to be a straight face, which is a total absurdity.
That is like saying 1 is the same as infinity. It is just crazy talk.
Maybe you just don't understand what it means for two things to be
equivalent, and everything can just be equivalent if you really want to.
This IS the natural result of your logic going inconsistent.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-24 10:25 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <numdnZ0SZ61YPkn9nZ2dnUU7-XPNnZ2d@giganews.com> |
| In reply to | #35312 |
On 6/24/2021 4:40 AM, Malcolm McLean wrote:
> On Wednesday, 23 June 2021 at 17:00:57 UTC+1, Ben Bacarisse wrote:
>>
>> In reply, PO said he understood that, but then went on to say more
>> things as if anything, true or false, can alter the fact that the
>> assumption about H leads to a contradiction. Do you think he genuinely
>> believes that saying more things, even true things, can "undo" a
>> contradiction? That is a strange mind indeed.
>>
> We've had quite a bit of flip-flopping. We had a period when it was
> acknowledged that Linz's proof was sound but he had a slightly
> different property.
// Simplified Linz Ĥ (Linz:1990:319)
void P(u32 x)
{
u32 Input_Halts = H(x, x);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input_Halts = H((u32)P, (u32)P);
Output("Input_Halts = ", Input_Halts);
}
That H(P,P) cannot return a correct halt status to P in the above
computation is well proven.
That H(P,P) ever needs to return to P at all in the above code is the
key false assumption that unravels the whole proof.
> Defining a slightly different property to halting
> is not an inherently bad thing to do, it could be the starting point
> of some significant work. But that's very hard to do, and you and I
> pointed out that PO's different problem wasn't one of the "interesting"
> ones. You needed to solve the original halting problem first to decide
> it, for example.
>
> So there might have been a row back from that when he realised that
> the response would be "well that might be true but it doesn't get us
> anywhere".
>
> However I do think that he genuinely thinks that he's got something
> significant. I'm not a mind reader, but a troll would have got bored by
> now, whilst the posts go off at too many tangents to be a fraudster.
> When you dry run his simulating halt decider on itself, it is confusing.
> Take out the halt detector and it runs forever. Put the halt detector in,
> and it detects non-halting behaviour (according to PO, no real reason
> to disbelieve him). So surely it's got that right?
> But in fact simulate
> one more step, and the halt detection in the simulated machine will
> kick in and halt it.
>
I had the false assumption myself for a couple of days a year or two
ago. H can wait any fixed number of recursions before aborting its
input. If H simply waits for a later recursion to abort its input then
its input is never aborted because the code to abort this input does not
exist.
Halting problem undecidability and infinitely nested simulation
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2021-06-24 08:47 -0700 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <5417ed74-db25-4e7c-953b-bdbfff8e39bfn@googlegroups.com> |
| In reply to | #35315 |
On Thursday, 24 June 2021 at 16:25:00 UTC+1, olcott wrote: > On 6/24/2021 4:40 AM, Malcolm McLean wrote: > > That H(P,P) cannot return a correct halt status to P in the above > computation is well proven. > > That H(P,P) ever needs to return to P at all in the above code is the > key false assumption that unravels the whole proof. > H has to be a Turing machine. > > > But in fact simulate > > one more step, and the halt detection in the simulated machine will > > kick in and halt it. > > > I had the false assumption myself for a couple of days a year or two > ago. H can wait any fixed number of recursions before aborting its > input. If H simply waits for a later recursion to abort its input then > its input is never aborted because the code to abort this input does not > exist. > Halting problem undecidability and infinitely nested simulation > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > It's not really recursion. It's nested simulation, which is similar to recursion, but different from it in that control never passes to the child function. Instead the child function is simulated, then simulated by a simulated function, then simulated by a simulated simulated function and so on, with control always remaining in the root function. If H doesn't abort, then this goes on forever. However if it does abort, it always aborts one step before the child would have performed the identical abort. So you've kind of created your own paradox problem here. The abort / don't abort decision is always wrong.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-24 11:03 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <0vKdnRSDf9NbMUn9nZ2dnUU7-RXNnZ2d@giganews.com> |
| In reply to | #35318 |
On 6/24/2021 10:47 AM, Malcolm McLean wrote: > On Thursday, 24 June 2021 at 16:25:00 UTC+1, olcott wrote: >> On 6/24/2021 4:40 AM, Malcolm McLean wrote: >> >> That H(P,P) cannot return a correct halt status to P in the above >> computation is well proven. >> >> That H(P,P) ever needs to return to P at all in the above code is the >> key false assumption that unravels the whole proof. >> > H has to be a Turing machine. In the pseudo-code proofs H is always pseudo-code and never a Turing machine. It is not true that H must be a Turing machine as long as the H/P relationship is sufficiently equivalent to the H/⟨Ĥ⟩ the C/x86 version applied. >> >>> But in fact simulate >>> one more step, and the halt detection in the simulated machine will >>> kick in and halt it. >>> >> I had the false assumption myself for a couple of days a year or two >> ago. H can wait any fixed number of recursions before aborting its >> input. If H simply waits for a later recursion to abort its input then >> its input is never aborted because the code to abort this input does not >> exist. >> Halting problem undecidability and infinitely nested simulation >> https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation >> > It's not really recursion. It's nested simulation, which is similar to recursion, > but different from it in that control never passes to the child function. It is sufficiently computationally equivalent. > Instead the child function is simulated, then simulated by a simulated function, > then simulated by a simulated simulated function and so on, with control > always remaining in the root function. > > If H doesn't abort, then this goes on forever. However if it does abort, it always > aborts one step before the child would have performed the identical abort. This is not true. If we simply wait for the child to do it then it never happens. > So you've kind of created your own paradox problem here. The abort / don't > abort decision is always wrong. > Of the two hypothetical possibilities: (independent variable) (1) H aborts the simulation of P (2) H never aborts the simulation of P We ask what is the effect on the behavior of P? (dependent variable) (1) P halts (2) P never halts If the result of purely hypothetical H that never aborts its simulation/execution of P would result in the infinite execution of P then we know axiomatically that H decides that P never halts correctly. This is the axiom: Premise(1) Every computation that never halts unless its simulation is aborted is a computation that never halts. This verified as true on the basis of the meaning of its words. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-06-23 21:23 -0400 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <Y7RAI.56962$k_.51299@fx43.iad> |
| In reply to | #35297 |
On 6/23/21 8:25 AM, Malcolm McLean wrote: > On Wednesday, 23 June 2021 at 11:57:06 UTC+1, Richard Damon wrote: >> On 6/22/21 11:21 PM, olcott wrote: >>> On 6/22/2021 10:00 PM, Richard Damon wrote: >>>> >>>>> Yes and of course when I make a C program that is computationally >>>>> equivalent to the standard relation between the HP halt decider and its >>>>> impossible input and show all of the steps of how this halt decider >>>>> correctly decides this "known" to be impossible input that does not >>>>> count at all because it is not 100% perfectly an actual TM. >>>> >>>> Except that it isn't because H^ doesn't make copies as it is supposed to >>>> so you don't end up with a true equivalent. >>> >>> Others know that it is sufficiently equivalent. >> There is no 'sufficiently' it only is or it isn't. >> >> Is 2.0001 sufficiently equivalent to 2? Its pretty close, but is it >> equivalent. >> > PO's system uses x86 code instead of Turing machines. That enables him > to detect when the halt decider is being called on a program including itself. > That's not the root of the error (the halting problem also applies to x86 > programs) but it is the root of the confusion. > PO obviously thinks that he has found a counter example to Linz's impossible H. > Othewise he would be so insistent be so insistent about it. I suggest that this > is because he's tied himself up in knots thinking about infinite recursion > and what would have happened had his H been a pure simulator instead of > a simulator with an infinite recursion detector attached. > Yes, there can be a version of the Halting Problem expressed for x86 code instead of Turing Machines. One fundamental problem is that since x86 machines tend to have fixed finite memory, it is actually possible to decide such a machine in finite time with another finite (but much bigger) machine. This means that to make a REAL equivalent of the Halting Problem you need to be careful how you define everything so that this simple dodge doesn't work. I suspect that by the time you do get it worded properly, Peter's tricks become more obviously against the rules/definitions. My guess is you need to be more explicit about how answer MUST be returned, so his claims of not returing answers to parts of the infinite chain is clearly not allowed. He gets a lot of his tricks becuase the wording is based on Turing Machines, and a lot of behavior of Turing Machines is just fixed by their construction, and PO is just igoring that they have fundmantal rules for how they behave. Notice how when asked what a given behavior (like aborting the whole chain) means to an actual Turing Machine version, and he just can't answer, because the behavior just doesn't make sense for a Turing Machine.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-06-23 11:01 +0100 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <871r8saohb.fsf@bsb.me.uk> |
| In reply to | #35293 |
Richard Damon <Richard@Damon-Family.org> writes: > On 6/22/21 10:15 PM, olcott wrote: >> On 6/22/2021 8:47 PM, Ben Bacarisse wrote: >>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: >>>> Ahhh. Good. Okay, well I am still wondering why, when I tell him to >>>> run his "halt decider" against an unknown, black box program created >>>> by somebody else... Well, he seems to get pissed off. Afaict, his >>>> decider only works on programs that he already knows are, >>>> decided. Cheating 101? Or what? ;^o >>> >>> Well he flip-flops on this. He keeps saying that he has a halt decider >>> (sometimes without realising that he's said it) but when this is pointed >>> out he claims he only cares about the one case -- the "hat" construction >>> given in so many proofs. >>> >>> That, alone, would be noteworthy because it's impossible. Way back in >>> Dec 2018, he was waffling about a decider for one case (which is >>> trivial), when someone (I think it was Mike Terry) spotted that he was >>> actually claiming to have a TM H that gave the correct result for the >>> computation <[H^], [H^]> (my notation -- I'll explain it if you really >>> care about the details). Once it was pointed out that everyone knows >>> this is impossible PO was delighted and wrote things like: >>> >>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz >>> specs does not exist. I now have a fully encoded pair of Turing >>> Machines H / Ĥ proving them wrong." >>> >>> "I now have an actual H that decides actual halting for an actual (Ĥ, >>> Ĥ) input pair. I have to write the UTM to execute this code, that >>> should not take very long. The key thing is the H and Ĥ are 100% >>> fully encoded as actual Turing machines." >>> >>> "I am waiting to encode the UTM in C++ so that I can actually execute >>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not >>> a universal halt decider, yet it is exactly and precisely the Peter >>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis >>> of Ĥ actually deciding itself." >>> >>> I refer to this as the Big Lie because, of course, he never had any such >>> pair of TMs, but as you can see, it was getting one (impossible) case >>> right that was the jumping-off point for the last two an half years of >>> nonsense. >> >> Yes and of course when I make a C program that is computationally >> equivalent to the standard relation between the HP halt decider and its >> impossible input and show all of the steps of how this halt decider >> correctly decides this "known" to be impossible input that does not >> count at all because it is not 100% perfectly an actual TM. > > Except that it isn't because H^ doesn't make copies as it is supposed to > so you don't end up with a true equivalent. This lets you 'cheat' to > detect the recursion that doesn't really exist in the original > problem. This is obviously a problem in the formal sense, but it can be worked round in that there is a halting problem for C-like functions that use pointers as the "representation" and therefore the "hat" construction does not copy its input. It's just a bit fiddly to pin down the rules of what's allowed. The curious fact is that PO does not use this breaking of the rules to get the right answer. By using external state (as his "Halts" function apparently does) it's possible for Halts(Confound_Halts, Confound_Halts) to be correct about the halting of Confound_Halts(Confound_Halts). But that is not his plan. His plan is to write yards and yards of text to try to persuade someone, anyone, that the wrong answer is the right answer. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-23 10:35 -0500 |
| Subject | Re: What if a cat barks? [ sound deduction proves that I am correct ] |
| Message-ID | <EsednWNuJbA0yU79nZ2dnUU7-fednZ2d@giganews.com> |
| In reply to | #35295 |
On 6/23/2021 5:01 AM, Ben Bacarisse wrote: > Richard Damon <Richard@Damon-Family.org> writes: > >> On 6/22/21 10:15 PM, olcott wrote: >>> On 6/22/2021 8:47 PM, Ben Bacarisse wrote: >>>> "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes: > >>>>> Ahhh. Good. Okay, well I am still wondering why, when I tell him to >>>>> run his "halt decider" against an unknown, black box program created >>>>> by somebody else... Well, he seems to get pissed off. Afaict, his >>>>> decider only works on programs that he already knows are, >>>>> decided. Cheating 101? Or what? ;^o >>>> >>>> Well he flip-flops on this. He keeps saying that he has a halt decider >>>> (sometimes without realising that he's said it) but when this is pointed >>>> out he claims he only cares about the one case -- the "hat" construction >>>> given in so many proofs. >>>> >>>> That, alone, would be noteworthy because it's impossible. Way back in >>>> Dec 2018, he was waffling about a decider for one case (which is >>>> trivial), when someone (I think it was Mike Terry) spotted that he was >>>> actually claiming to have a TM H that gave the correct result for the >>>> computation <[H^], [H^]> (my notation -- I'll explain it if you really >>>> care about the details). Once it was pointed out that everyone knows >>>> this is impossible PO was delighted and wrote things like: >>>> >>>> "Everyone has claimed that H on input pair (Ĥ, Ĥ) meeting the Linz >>>> specs does not exist. I now have a fully encoded pair of Turing >>>> Machines H / Ĥ proving them wrong." >>>> >>>> "I now have an actual H that decides actual halting for an actual (Ĥ, >>>> Ĥ) input pair. I have to write the UTM to execute this code, that >>>> should not take very long. The key thing is the H and Ĥ are 100% >>>> fully encoded as actual Turing machines." >>>> >>>> "I am waiting to encode the UTM in C++ so that I can actually execute >>>> H on the input pair: (Ĥ, Ĥ). This should take a week or two. It is not >>>> a universal halt decider, yet it is exactly and precisely the Peter >>>> Linz H and Ĥ, with H actually deciding input pair: (Ĥ, Ĥ) on the basis >>>> of Ĥ actually deciding itself." >>>> >>>> I refer to this as the Big Lie because, of course, he never had any such >>>> pair of TMs, but as you can see, it was getting one (impossible) case >>>> right that was the jumping-off point for the last two an half years of >>>> nonsense. >>> >>> Yes and of course when I make a C program that is computationally >>> equivalent to the standard relation between the HP halt decider and its >>> impossible input and show all of the steps of how this halt decider >>> correctly decides this "known" to be impossible input that does not >>> count at all because it is not 100% perfectly an actual TM. >> >> Except that it isn't because H^ doesn't make copies as it is supposed to >> so you don't end up with a true equivalent. This lets you 'cheat' to >> detect the recursion that doesn't really exist in the original >> problem. > > This is obviously a problem in the formal sense, but it can be worked > round in that there is a halting problem for C-like functions that use > pointers as the "representation" and therefore the "hat" construction > does not copy its input. It's just a bit fiddly to pin down the rules > of what's allowed. > > The curious fact is that PO does not use this breaking of the rules to > get the right answer. By using external state (as his "Halts" function > apparently does) it's possible for Halts(Confound_Halts, Confound_Halts) > to be correct about the halting of Confound_Halts(Confound_Halts). > > But that is not his plan. His plan is to write yards and yards of text > to try to persuade someone, anyone, that the wrong answer is the right > answer. > Which of these seems to be untrue and why? Premise(1) Every computation that never halts unless its simulation is aborted is a computation that never halts. This verified as true on the basis of the meaning of its words. Premise(2) The simulation of the input to H(P,P) never halts without being aborted is a verified fact on the basis of its x86 execution trace. (shown below). From the above true premises it necessarily follows that simulating halt decider H correctly reports that its input: (P,P) never halts. Halting problem undecidability and infinitely nested simulation https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-06-21 12:24 -0600 |
| Message-ID | <saqlhk$860$1@dont-email.me> |
| In reply to | #35201 |
On 2021-06-20 23:04, Chris M. Thomasson wrote: > On 6/20/2021 9:15 PM, olcott wrote: >> If you see an animal and test its DNA and confirm that it is >> definitely a cat, what happens when the cat barks? > [...] > > Have you been hearing cats bark lately? Wow. As long as he's just hearing them bark, we're probably fine. It's when the barking cats start telling him to do things (like kill neighbours, steal catnip, or conquer Liechtenstein) that we really need to worry. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-21 16:11 -0500 |
| Message-ID | <tZOdneTmHpHNnUz9nZ2dnUU7-V3NnZ2d@giganews.com> |
| In reply to | #35221 |
On 6/21/2021 1:24 PM, André G. Isaak wrote: > On 2021-06-20 23:04, Chris M. Thomasson wrote: >> On 6/20/2021 9:15 PM, olcott wrote: >>> If you see an animal and test its DNA and confirm that it is >>> definitely a cat, what happens when the cat barks? >> [...] >> >> Have you been hearing cats bark lately? Wow. > > As long as he's just hearing them bark, we're probably fine. > > It's when the barking cats start telling him to do things (like kill > neighbours, steal catnip, or conquer Liechtenstein) that we really need > to worry. > > André > The point is that the mere intuition about the halting behavior of Ĥ applied to ⟨Ĥ⟩ is superseded by meticulous sound deductive inference. SELF-EVIDENT-TRUTH Every computation that never halts unless its simulation is aborted is a computation that never halts. SELF-EVIDENT-TRUTH The ⟨Ĥ⟩ ⟨Ĥ⟩ input to the embedded halt decider at Ĥ.qx is a computation that never halts unless its simulation is aborted. ∴ IMPOSSIBLY FALSE CONCLUSION The embedded simulating halt decider at Ĥ.qx correctly decides its input: ⟨Ĥ⟩ ⟨Ĥ⟩ is a computation that never halts. Ĥ.q0 ⟨Ĥ⟩ specifies an infinite chain of invocations that is terminated at its third invocation. The first invocation of Ĥ.qx ⟨Ĥ⟩, ⟨Ĥ⟩ is the first element of an infinite chain of invocations. It is common knowledge that when any invocation of an infinite chain of invocations is terminated that the whole chain terminates. That the first element of this infinite chain terminates after its third element has been terminated does not entail that this first element is an actual terminating computation. For the first element to be an actual terminating computation it must terminate without any of the elements of the infinite chain of invocations being terminated. Halting problem undecidability and infinitely nested simulation https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-06-21 16:26 -0500 |
| Message-ID | <0e-dnbFfeY-XmUz9nZ2dnUU7-ePNnZ2d@giganews.com> |
| In reply to | #35222 |
On 6/21/2021 4:11 PM, olcott wrote: > On 6/21/2021 1:24 PM, André G. Isaak wrote: >> On 2021-06-20 23:04, Chris M. Thomasson wrote: >>> On 6/20/2021 9:15 PM, olcott wrote: >>>> If you see an animal and test its DNA and confirm that it is >>>> definitely a cat, what happens when the cat barks? >>> [...] >>> >>> Have you been hearing cats bark lately? Wow. >> >> As long as he's just hearing them bark, we're probably fine. >> >> It's when the barking cats start telling him to do things (like kill >> neighbours, steal catnip, or conquer Liechtenstein) that we really >> need to worry. >> >> André >> > > The point is that the mere intuition about the halting behavior of Ĥ > applied to ⟨Ĥ⟩ is superseded by meticulous sound deductive inference. > Self-Evident-Truth (premise[1]) Every computation that never halts unless its simulation is aborted is a computation that never halts. Self-Evident-Truth (premise[2]) The ⟨Ĥ⟩ ⟨Ĥ⟩ input to the embedded halt decider at Ĥ.qx is a computation that never halts unless its simulation is aborted. ∴ Sound Deductive Conclusion The embedded simulating halt decider at Ĥ.qx correctly decides its input: ⟨Ĥ⟩ ⟨Ĥ⟩ is a computation that never halts. > Ĥ.q0 ⟨Ĥ⟩ specifies an infinite chain of invocations that is terminated > at its third invocation. The first invocation of Ĥ.qx ⟨Ĥ⟩, ⟨Ĥ⟩ is the > first element of an infinite chain of invocations. > > It is common knowledge that when any invocation of an infinite chain of > invocations is terminated that the whole chain terminates. That the > first element of this infinite chain terminates after its third element > has been terminated does not entail that this first element is an actual > terminating computation. > > For the first element to be an actual terminating computation it must > terminate without any of the elements of the infinite chain of > invocations being terminated. > > > > > > Halting problem undecidability and infinitely nested simulation > https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation > > > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
|---|---|
| Date | 2021-06-21 14:58 -0700 |
| Message-ID | <193a6478-18cd-4759-b4df-f9ec8a75368cn@googlegroups.com> |
| In reply to | #35223 |
olcott is a god damned spammer. do not help him.
[toc] | [prev] | [next] | [standalone]
Page 2 of 10 — ← Prev page 1 [2] 3 4 … 10 Next page →
Back to top | Article view | comp.theory
csiph-web